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-167873948200684.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 PolyORBNT-COL-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948200684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 8.9K Feb 26 00:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 00:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 00:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 01:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S10J30-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S10J30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678887086961

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=PolyORBNT-COL-S10J30
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 13:31:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 13:31:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 13:31:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 13:31:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 13:31:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 674 ms
[2023-03-15 13:31:29] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 13:31:29] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 6 ms.
[2023-03-15 13:31:29] [INFO ] Skeletonized 16 HLPN properties in 9 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S10J30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 10 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 571 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 38 rows 48 cols
[2023-03-15 13:31:29] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-15 13:31:29] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-15 13:31:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 13:31:29] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 13:31:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-15 13:31:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 13:31:29] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 13:31:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:31:29] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 13:31:29] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 5 ms to minimize.
[2023-03-15 13:31:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-15 13:31:29] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-15 13:31:29] [INFO ] After 112ms 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 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 16 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
// Phase 1: matrix 28 rows 34 cols
[2023-03-15 13:31:29] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-15 13:31:29] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 34/48 places, 28/38 transitions.
Incomplete random walk after 10006 steps, including 737 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 312 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 20 ms. (steps per millisecond=69 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 3 ms. (steps per millisecond=464 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2023-03-15 13:31:30] [INFO ] Flatten gal took : 21 ms
[2023-03-15 13:31:30] [INFO ] Flatten gal took : 7 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 13:31:30] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 256 ms.
[2023-03-15 13:31:30] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
[2023-03-15 13:31:30] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-15 13:31:30] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-15 13:31:30] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 13:31:30] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 13:31:30] [INFO ] Reduced 780 identical enabling conditions.
Deduced a syphon composed of 30 places in 24 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 556 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 91 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2023-03-15 13:31:30] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-15 13:31:30] [INFO ] Computed 92 place invariants in 101 ms
[2023-03-15 13:31:31] [INFO ] Dead Transitions using invariants and state equation in 1329 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-15 13:31:31] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2023-03-15 13:31:32] [INFO ] Computed 92 place invariants in 72 ms
[2023-03-15 13:31:32] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-15 13:31:32] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-15 13:31:32] [INFO ] Invariant cache hit.
[2023-03-15 13:31:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:31:32] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 17 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2439 ms. Remains : 664/664 places, 1325/1940 transitions.
Support contains 556 out of 664 places after structural reductions.
[2023-03-15 13:31:33] [INFO ] Flatten gal took : 178 ms
[2023-03-15 13:31:33] [INFO ] Flatten gal took : 140 ms
[2023-03-15 13:31:33] [INFO ] Input system was already deterministic with 1325 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 755 ms. (steps per millisecond=13 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 13:31:34] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-15 13:31:34] [INFO ] Invariant cache hit.
[2023-03-15 13:31:34] [INFO ] [Real]Absence check using 85 positive place invariants in 28 ms returned sat
[2023-03-15 13:31:34] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 13:31:35] [INFO ] After 771ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-15 13:31:35] [INFO ] [Nat]Absence check using 85 positive place invariants in 25 ms returned sat
[2023-03-15 13:31:35] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 13:31:36] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-15 13:31:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:31:36] [INFO ] After 146ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-15 13:31:36] [INFO ] Deduced a trap composed of 317 places in 313 ms of which 1 ms to minimize.
[2023-03-15 13:31:37] [INFO ] Deduced a trap composed of 313 places in 365 ms of which 1 ms to minimize.
[2023-03-15 13:31:37] [INFO ] Deduced a trap composed of 305 places in 335 ms of which 1 ms to minimize.
[2023-03-15 13:31:38] [INFO ] Deduced a trap composed of 313 places in 335 ms of which 3 ms to minimize.
[2023-03-15 13:31:38] [INFO ] Deduced a trap composed of 305 places in 330 ms of which 1 ms to minimize.
[2023-03-15 13:31:38] [INFO ] Deduced a trap composed of 299 places in 330 ms of which 1 ms to minimize.
[2023-03-15 13:31:39] [INFO ] Deduced a trap composed of 305 places in 328 ms of which 0 ms to minimize.
[2023-03-15 13:31:39] [INFO ] Deduced a trap composed of 305 places in 339 ms of which 1 ms to minimize.
[2023-03-15 13:31:40] [INFO ] Deduced a trap composed of 309 places in 317 ms of which 1 ms to minimize.
[2023-03-15 13:31:40] [INFO ] Deduced a trap composed of 311 places in 317 ms of which 1 ms to minimize.
[2023-03-15 13:31:40] [INFO ] Deduced a trap composed of 311 places in 331 ms of which 0 ms to minimize.
[2023-03-15 13:31:41] [INFO ] Deduced a trap composed of 313 places in 296 ms of which 1 ms to minimize.
[2023-03-15 13:31:41] [INFO ] Deduced a trap composed of 309 places in 279 ms of which 1 ms to minimize.
[2023-03-15 13:31:41] [INFO ] Deduced a trap composed of 311 places in 278 ms of which 1 ms to minimize.
[2023-03-15 13:31:42] [INFO ] Deduced a trap composed of 311 places in 282 ms of which 1 ms to minimize.
[2023-03-15 13:31:42] [INFO ] Deduced a trap composed of 301 places in 284 ms of which 1 ms to minimize.
[2023-03-15 13:31:43] [INFO ] Deduced a trap composed of 311 places in 330 ms of which 1 ms to minimize.
[2023-03-15 13:31:43] [INFO ] Deduced a trap composed of 309 places in 287 ms of which 0 ms to minimize.
[2023-03-15 13:31:43] [INFO ] Deduced a trap composed of 311 places in 314 ms of which 0 ms to minimize.
[2023-03-15 13:31:44] [INFO ] Deduced a trap composed of 313 places in 312 ms of which 0 ms to minimize.
[2023-03-15 13:31:44] [INFO ] Deduced a trap composed of 313 places in 302 ms of which 1 ms to minimize.
[2023-03-15 13:31:44] [INFO ] Deduced a trap composed of 309 places in 283 ms of which 1 ms to minimize.
[2023-03-15 13:31:45] [INFO ] Deduced a trap composed of 309 places in 312 ms of which 0 ms to minimize.
[2023-03-15 13:31:45] [INFO ] Deduced a trap composed of 299 places in 310 ms of which 0 ms to minimize.
[2023-03-15 13:31:47] [INFO ] Deduced a trap composed of 303 places in 327 ms of which 0 ms to minimize.
[2023-03-15 13:31:48] [INFO ] Deduced a trap composed of 303 places in 304 ms of which 1 ms to minimize.
[2023-03-15 13:31:48] [INFO ] Deduced a trap composed of 305 places in 298 ms of which 1 ms to minimize.
[2023-03-15 13:31:49] [INFO ] Deduced a trap composed of 305 places in 292 ms of which 1 ms to minimize.
[2023-03-15 13:31:49] [INFO ] Deduced a trap composed of 313 places in 328 ms of which 0 ms to minimize.
[2023-03-15 13:31:49] [INFO ] Deduced a trap composed of 311 places in 307 ms of which 1 ms to minimize.
[2023-03-15 13:31:50] [INFO ] Deduced a trap composed of 309 places in 297 ms of which 1 ms to minimize.
[2023-03-15 13:31:50] [INFO ] Deduced a trap composed of 317 places in 295 ms of which 4 ms to minimize.
[2023-03-15 13:31:50] [INFO ] Deduced a trap composed of 309 places in 303 ms of which 4 ms to minimize.
[2023-03-15 13:31:51] [INFO ] Deduced a trap composed of 309 places in 303 ms of which 0 ms to minimize.
[2023-03-15 13:31:52] [INFO ] Deduced a trap composed of 313 places in 295 ms of which 1 ms to minimize.
[2023-03-15 13:31:52] [INFO ] Deduced a trap composed of 315 places in 296 ms of which 1 ms to minimize.
[2023-03-15 13:31:52] [INFO ] Deduced a trap composed of 301 places in 330 ms of which 1 ms to minimize.
[2023-03-15 13:31:53] [INFO ] Deduced a trap composed of 309 places in 291 ms of which 1 ms to minimize.
[2023-03-15 13:31:53] [INFO ] Deduced a trap composed of 313 places in 310 ms of which 1 ms to minimize.
[2023-03-15 13:31:54] [INFO ] Deduced a trap composed of 305 places in 303 ms of which 1 ms to minimize.
[2023-03-15 13:31:54] [INFO ] Deduced a trap composed of 303 places in 292 ms of which 1 ms to minimize.
[2023-03-15 13:31:55] [INFO ] Deduced a trap composed of 307 places in 355 ms of which 1 ms to minimize.
[2023-03-15 13:31:55] [INFO ] Deduced a trap composed of 313 places in 326 ms of which 1 ms to minimize.
[2023-03-15 13:31:55] [INFO ] Deduced a trap composed of 311 places in 333 ms of which 2 ms to minimize.
[2023-03-15 13:31:56] [INFO ] Deduced a trap composed of 317 places in 366 ms of which 0 ms to minimize.
[2023-03-15 13:31:56] [INFO ] Deduced a trap composed of 307 places in 307 ms of which 0 ms to minimize.
[2023-03-15 13:31:57] [INFO ] Deduced a trap composed of 303 places in 336 ms of which 1 ms to minimize.
[2023-03-15 13:31:57] [INFO ] Deduced a trap composed of 307 places in 303 ms of which 2 ms to minimize.
[2023-03-15 13:31:57] [INFO ] Deduced a trap composed of 309 places in 284 ms of which 0 ms to minimize.
[2023-03-15 13:31:58] [INFO ] Deduced a trap composed of 301 places in 317 ms of which 0 ms to minimize.
[2023-03-15 13:31:59] [INFO ] Deduced a trap composed of 313 places in 348 ms of which 1 ms to minimize.
[2023-03-15 13:31:59] [INFO ] Deduced a trap composed of 303 places in 338 ms of which 1 ms to minimize.
[2023-03-15 13:31:59] [INFO ] Deduced a trap composed of 295 places in 335 ms of which 0 ms to minimize.
[2023-03-15 13:32:00] [INFO ] Deduced a trap composed of 311 places in 317 ms of which 0 ms to minimize.
[2023-03-15 13:32:00] [INFO ] Deduced a trap composed of 307 places in 330 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 13:32:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 13:32:00] [INFO ] After 25145ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1290
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 80 place count 619 transition count 1255
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 150 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 583 transition count 1254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 581 transition count 1252
Applied a total of 156 rules in 201 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-15 13:32:00] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 13:32:00] [INFO ] Computed 82 place invariants in 30 ms
[2023-03-15 13:32:01] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 821 ms. Remains : 581/664 places, 1252/1325 transitions.
Incomplete random walk after 10000 steps, including 721 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:32:01] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-15 13:32:01] [INFO ] Invariant cache hit.
[2023-03-15 13:32:01] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-15 13:32:01] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 13:32:02] [INFO ] After 339ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 13:32:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:32:02] [INFO ] After 101ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:32:02] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:32:02] [INFO ] [Nat]Absence check using 75 positive place invariants in 31 ms returned sat
[2023-03-15 13:32:02] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 17 ms returned sat
[2023-03-15 13:32:02] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:32:02] [INFO ] After 214ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:32:03] [INFO ] Deduced a trap composed of 229 places in 277 ms of which 0 ms to minimize.
[2023-03-15 13:32:03] [INFO ] Deduced a trap composed of 233 places in 276 ms of which 0 ms to minimize.
[2023-03-15 13:32:03] [INFO ] Deduced a trap composed of 231 places in 275 ms of which 0 ms to minimize.
[2023-03-15 13:32:04] [INFO ] Deduced a trap composed of 231 places in 281 ms of which 0 ms to minimize.
[2023-03-15 13:32:04] [INFO ] Deduced a trap composed of 223 places in 293 ms of which 1 ms to minimize.
[2023-03-15 13:32:04] [INFO ] Deduced a trap composed of 231 places in 294 ms of which 1 ms to minimize.
[2023-03-15 13:32:05] [INFO ] Deduced a trap composed of 241 places in 277 ms of which 1 ms to minimize.
[2023-03-15 13:32:05] [INFO ] Deduced a trap composed of 227 places in 300 ms of which 0 ms to minimize.
[2023-03-15 13:32:05] [INFO ] Deduced a trap composed of 237 places in 301 ms of which 3 ms to minimize.
[2023-03-15 13:32:06] [INFO ] Deduced a trap composed of 229 places in 281 ms of which 1 ms to minimize.
[2023-03-15 13:32:06] [INFO ] Deduced a trap composed of 229 places in 271 ms of which 0 ms to minimize.
[2023-03-15 13:32:06] [INFO ] Deduced a trap composed of 229 places in 278 ms of which 1 ms to minimize.
[2023-03-15 13:32:07] [INFO ] Deduced a trap composed of 231 places in 276 ms of which 1 ms to minimize.
[2023-03-15 13:32:07] [INFO ] Deduced a trap composed of 229 places in 273 ms of which 1 ms to minimize.
[2023-03-15 13:32:08] [INFO ] Deduced a trap composed of 229 places in 281 ms of which 1 ms to minimize.
[2023-03-15 13:32:08] [INFO ] Deduced a trap composed of 235 places in 283 ms of which 1 ms to minimize.
[2023-03-15 13:32:08] [INFO ] Deduced a trap composed of 231 places in 301 ms of which 1 ms to minimize.
[2023-03-15 13:32:09] [INFO ] Deduced a trap composed of 233 places in 250 ms of which 1 ms to minimize.
[2023-03-15 13:32:09] [INFO ] Deduced a trap composed of 241 places in 278 ms of which 0 ms to minimize.
[2023-03-15 13:32:09] [INFO ] Deduced a trap composed of 237 places in 291 ms of which 1 ms to minimize.
[2023-03-15 13:32:10] [INFO ] Deduced a trap composed of 239 places in 297 ms of which 1 ms to minimize.
[2023-03-15 13:32:10] [INFO ] Deduced a trap composed of 237 places in 274 ms of which 1 ms to minimize.
[2023-03-15 13:32:10] [INFO ] Deduced a trap composed of 227 places in 277 ms of which 1 ms to minimize.
[2023-03-15 13:32:11] [INFO ] Deduced a trap composed of 237 places in 283 ms of which 0 ms to minimize.
[2023-03-15 13:32:11] [INFO ] Deduced a trap composed of 229 places in 291 ms of which 0 ms to minimize.
[2023-03-15 13:32:11] [INFO ] Deduced a trap composed of 231 places in 271 ms of which 0 ms to minimize.
[2023-03-15 13:32:12] [INFO ] Deduced a trap composed of 235 places in 282 ms of which 1 ms to minimize.
[2023-03-15 13:32:12] [INFO ] Deduced a trap composed of 235 places in 278 ms of which 1 ms to minimize.
[2023-03-15 13:32:12] [INFO ] Deduced a trap composed of 231 places in 269 ms of which 0 ms to minimize.
[2023-03-15 13:32:13] [INFO ] Deduced a trap composed of 235 places in 290 ms of which 1 ms to minimize.
[2023-03-15 13:32:13] [INFO ] Deduced a trap composed of 237 places in 259 ms of which 0 ms to minimize.
[2023-03-15 13:32:13] [INFO ] Deduced a trap composed of 231 places in 258 ms of which 0 ms to minimize.
[2023-03-15 13:32:14] [INFO ] Deduced a trap composed of 233 places in 277 ms of which 1 ms to minimize.
[2023-03-15 13:32:14] [INFO ] Deduced a trap composed of 231 places in 271 ms of which 1 ms to minimize.
[2023-03-15 13:32:15] [INFO ] Deduced a trap composed of 233 places in 294 ms of which 0 ms to minimize.
[2023-03-15 13:32:15] [INFO ] Deduced a trap composed of 235 places in 295 ms of which 1 ms to minimize.
[2023-03-15 13:32:16] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 1 ms to minimize.
[2023-03-15 13:32:16] [INFO ] Deduced a trap composed of 237 places in 265 ms of which 0 ms to minimize.
[2023-03-15 13:32:16] [INFO ] Deduced a trap composed of 231 places in 263 ms of which 0 ms to minimize.
[2023-03-15 13:32:17] [INFO ] Deduced a trap composed of 233 places in 266 ms of which 1 ms to minimize.
[2023-03-15 13:32:17] [INFO ] Deduced a trap composed of 231 places in 268 ms of which 1 ms to minimize.
[2023-03-15 13:32:17] [INFO ] Deduced a trap composed of 239 places in 259 ms of which 1 ms to minimize.
[2023-03-15 13:32:18] [INFO ] Deduced a trap composed of 233 places in 264 ms of which 1 ms to minimize.
[2023-03-15 13:32:18] [INFO ] Deduced a trap composed of 231 places in 270 ms of which 1 ms to minimize.
[2023-03-15 13:32:18] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 1 ms to minimize.
[2023-03-15 13:32:19] [INFO ] Deduced a trap composed of 235 places in 266 ms of which 0 ms to minimize.
[2023-03-15 13:32:19] [INFO ] Deduced a trap composed of 227 places in 275 ms of which 0 ms to minimize.
[2023-03-15 13:32:19] [INFO ] Deduced a trap composed of 239 places in 275 ms of which 1 ms to minimize.
[2023-03-15 13:32:20] [INFO ] Deduced a trap composed of 239 places in 275 ms of which 0 ms to minimize.
[2023-03-15 13:32:20] [INFO ] Deduced a trap composed of 235 places in 270 ms of which 1 ms to minimize.
[2023-03-15 13:32:21] [INFO ] Deduced a trap composed of 235 places in 262 ms of which 1 ms to minimize.
[2023-03-15 13:32:24] [INFO ] Deduced a trap composed of 237 places in 269 ms of which 1 ms to minimize.
[2023-03-15 13:32:24] [INFO ] Deduced a trap composed of 229 places in 269 ms of which 0 ms to minimize.
[2023-03-15 13:32:24] [INFO ] Deduced a trap composed of 229 places in 262 ms of which 1 ms to minimize.
[2023-03-15 13:32:25] [INFO ] Deduced a trap composed of 227 places in 268 ms of which 0 ms to minimize.
[2023-03-15 13:32:25] [INFO ] Deduced a trap composed of 229 places in 274 ms of which 1 ms to minimize.
[2023-03-15 13:32:25] [INFO ] Deduced a trap composed of 235 places in 278 ms of which 0 ms to minimize.
[2023-03-15 13:32:26] [INFO ] Deduced a trap composed of 237 places in 274 ms of which 0 ms to minimize.
[2023-03-15 13:32:26] [INFO ] Deduced a trap composed of 229 places in 272 ms of which 0 ms to minimize.
[2023-03-15 13:32:27] [INFO ] Deduced a trap composed of 235 places in 241 ms of which 1 ms to minimize.
[2023-03-15 13:32:27] [INFO ] Deduced a trap composed of 223 places in 268 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 13:32:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 13:32:27] [INFO ] After 25181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 581 transition count 1251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 580 transition count 1251
Applied a total of 2 rules in 46 ms. Remains 580 /581 variables (removed 1) and now considering 1251/1252 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 580/581 places, 1251/1252 transitions.
Incomplete random walk after 10000 steps, including 730 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 430710 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 430710 steps, saw 69413 distinct states, run finished after 3008 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 13:32:30] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-15 13:32:30] [INFO ] Computed 82 place invariants in 33 ms
[2023-03-15 13:32:30] [INFO ] [Real]Absence check using 75 positive place invariants in 25 ms returned sat
[2023-03-15 13:32:30] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 13:32:30] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:32:30] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2023-03-15 13:32:30] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 13:32:31] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:32:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:32:31] [INFO ] After 127ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 13:32:32] [INFO ] Deduced a trap composed of 244 places in 288 ms of which 1 ms to minimize.
[2023-03-15 13:32:32] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 1 ms to minimize.
[2023-03-15 13:32:32] [INFO ] Deduced a trap composed of 234 places in 262 ms of which 0 ms to minimize.
[2023-03-15 13:32:33] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 1 ms to minimize.
[2023-03-15 13:32:33] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 1 ms to minimize.
[2023-03-15 13:32:33] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 0 ms to minimize.
[2023-03-15 13:32:34] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 1 ms to minimize.
[2023-03-15 13:32:34] [INFO ] Deduced a trap composed of 226 places in 273 ms of which 1 ms to minimize.
[2023-03-15 13:32:34] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 0 ms to minimize.
[2023-03-15 13:32:35] [INFO ] Deduced a trap composed of 247 places in 300 ms of which 1 ms to minimize.
[2023-03-15 13:32:35] [INFO ] Deduced a trap composed of 234 places in 294 ms of which 1 ms to minimize.
[2023-03-15 13:32:35] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 1 ms to minimize.
[2023-03-15 13:32:36] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 0 ms to minimize.
[2023-03-15 13:32:36] [INFO ] Deduced a trap composed of 228 places in 271 ms of which 1 ms to minimize.
[2023-03-15 13:32:36] [INFO ] Deduced a trap composed of 226 places in 273 ms of which 1 ms to minimize.
[2023-03-15 13:32:37] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 0 ms to minimize.
[2023-03-15 13:32:37] [INFO ] Deduced a trap composed of 230 places in 274 ms of which 0 ms to minimize.
[2023-03-15 13:32:37] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 0 ms to minimize.
[2023-03-15 13:32:38] [INFO ] Deduced a trap composed of 224 places in 291 ms of which 0 ms to minimize.
[2023-03-15 13:32:38] [INFO ] Deduced a trap composed of 238 places in 309 ms of which 0 ms to minimize.
[2023-03-15 13:32:38] [INFO ] Deduced a trap composed of 226 places in 290 ms of which 0 ms to minimize.
[2023-03-15 13:32:39] [INFO ] Deduced a trap composed of 228 places in 294 ms of which 1 ms to minimize.
[2023-03-15 13:32:39] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 0 ms to minimize.
[2023-03-15 13:32:39] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 1 ms to minimize.
[2023-03-15 13:32:40] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 5 ms to minimize.
[2023-03-15 13:32:40] [INFO ] Deduced a trap composed of 240 places in 279 ms of which 1 ms to minimize.
[2023-03-15 13:32:41] [INFO ] Deduced a trap composed of 232 places in 279 ms of which 1 ms to minimize.
[2023-03-15 13:32:41] [INFO ] Deduced a trap composed of 232 places in 293 ms of which 1 ms to minimize.
[2023-03-15 13:32:41] [INFO ] Deduced a trap composed of 224 places in 287 ms of which 0 ms to minimize.
[2023-03-15 13:32:42] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 1 ms to minimize.
[2023-03-15 13:32:42] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 0 ms to minimize.
[2023-03-15 13:32:42] [INFO ] Deduced a trap composed of 224 places in 277 ms of which 1 ms to minimize.
[2023-03-15 13:32:43] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 1 ms to minimize.
[2023-03-15 13:32:43] [INFO ] Deduced a trap composed of 226 places in 279 ms of which 0 ms to minimize.
[2023-03-15 13:32:43] [INFO ] Deduced a trap composed of 240 places in 282 ms of which 1 ms to minimize.
[2023-03-15 13:32:44] [INFO ] Deduced a trap composed of 234 places in 265 ms of which 0 ms to minimize.
[2023-03-15 13:32:44] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 0 ms to minimize.
[2023-03-15 13:32:45] [INFO ] Deduced a trap composed of 222 places in 281 ms of which 1 ms to minimize.
[2023-03-15 13:32:45] [INFO ] Deduced a trap composed of 242 places in 286 ms of which 1 ms to minimize.
[2023-03-15 13:32:45] [INFO ] Deduced a trap composed of 228 places in 270 ms of which 1 ms to minimize.
[2023-03-15 13:32:46] [INFO ] Deduced a trap composed of 230 places in 296 ms of which 1 ms to minimize.
[2023-03-15 13:32:46] [INFO ] Deduced a trap composed of 236 places in 272 ms of which 0 ms to minimize.
[2023-03-15 13:32:47] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 1 ms to minimize.
[2023-03-15 13:32:47] [INFO ] Deduced a trap composed of 232 places in 259 ms of which 1 ms to minimize.
[2023-03-15 13:32:48] [INFO ] Deduced a trap composed of 240 places in 302 ms of which 0 ms to minimize.
[2023-03-15 13:32:48] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 1 ms to minimize.
[2023-03-15 13:32:49] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 1 ms to minimize.
[2023-03-15 13:32:49] [INFO ] Deduced a trap composed of 226 places in 295 ms of which 1 ms to minimize.
[2023-03-15 13:32:49] [INFO ] Deduced a trap composed of 228 places in 295 ms of which 0 ms to minimize.
[2023-03-15 13:32:50] [INFO ] Deduced a trap composed of 228 places in 281 ms of which 1 ms to minimize.
[2023-03-15 13:32:50] [INFO ] Deduced a trap composed of 234 places in 255 ms of which 1 ms to minimize.
[2023-03-15 13:32:50] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 1 ms to minimize.
[2023-03-15 13:32:51] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 1 ms to minimize.
[2023-03-15 13:32:51] [INFO ] Deduced a trap composed of 226 places in 286 ms of which 0 ms to minimize.
[2023-03-15 13:32:51] [INFO ] Deduced a trap composed of 226 places in 290 ms of which 1 ms to minimize.
[2023-03-15 13:32:52] [INFO ] Deduced a trap composed of 234 places in 278 ms of which 1 ms to minimize.
[2023-03-15 13:32:52] [INFO ] Deduced a trap composed of 234 places in 290 ms of which 0 ms to minimize.
[2023-03-15 13:32:53] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 0 ms to minimize.
[2023-03-15 13:32:53] [INFO ] Deduced a trap composed of 238 places in 278 ms of which 1 ms to minimize.
[2023-03-15 13:32:54] [INFO ] Deduced a trap composed of 224 places in 271 ms of which 0 ms to minimize.
[2023-03-15 13:32:55] [INFO ] Deduced a trap composed of 226 places in 306 ms of which 1 ms to minimize.
[2023-03-15 13:32:56] [INFO ] Deduced a trap composed of 238 places in 291 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 13:32:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 13:32:56] [INFO ] After 25206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 50 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 23 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-15 13:32:56] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 13:32:56] [INFO ] Invariant cache hit.
[2023-03-15 13:32:56] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-15 13:32:56] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 13:32:56] [INFO ] Invariant cache hit.
[2023-03-15 13:32:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:32:59] [INFO ] Implicit Places using invariants and state equation in 3107 ms returned []
Implicit Place search using SMT with State Equation took 3557 ms to find 0 implicit places.
[2023-03-15 13:32:59] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-15 13:32:59] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 13:32:59] [INFO ] Invariant cache hit.
[2023-03-15 13:33:00] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4206 ms. Remains : 580/580 places, 1251/1251 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 105 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2023-03-15 13:33:00] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-15 13:33:00] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 13:33:00] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 13:33:00] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:33:00] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 13:33:00] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 15 ms returned sat
[2023-03-15 13:33:01] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:33:01] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2023-03-15 13:33:01] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 1 ms to minimize.
[2023-03-15 13:33:01] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2023-03-15 13:33:02] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 1 ms to minimize.
[2023-03-15 13:33:02] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 0 ms to minimize.
[2023-03-15 13:33:02] [INFO ] Deduced a trap composed of 222 places in 239 ms of which 1 ms to minimize.
[2023-03-15 13:33:03] [INFO ] Deduced a trap composed of 228 places in 242 ms of which 0 ms to minimize.
[2023-03-15 13:33:03] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 1 ms to minimize.
[2023-03-15 13:33:03] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 1 ms to minimize.
[2023-03-15 13:33:03] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 1 ms to minimize.
[2023-03-15 13:33:04] [INFO ] Deduced a trap composed of 224 places in 251 ms of which 1 ms to minimize.
[2023-03-15 13:33:04] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 0 ms to minimize.
[2023-03-15 13:33:04] [INFO ] Deduced a trap composed of 232 places in 244 ms of which 1 ms to minimize.
[2023-03-15 13:33:05] [INFO ] Deduced a trap composed of 226 places in 242 ms of which 0 ms to minimize.
[2023-03-15 13:33:05] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 0 ms to minimize.
[2023-03-15 13:33:05] [INFO ] Deduced a trap composed of 228 places in 245 ms of which 0 ms to minimize.
[2023-03-15 13:33:06] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 0 ms to minimize.
[2023-03-15 13:33:06] [INFO ] Deduced a trap composed of 224 places in 240 ms of which 0 ms to minimize.
[2023-03-15 13:33:06] [INFO ] Deduced a trap composed of 228 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:33:06] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 0 ms to minimize.
[2023-03-15 13:33:07] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 0 ms to minimize.
[2023-03-15 13:33:07] [INFO ] Deduced a trap composed of 220 places in 263 ms of which 1 ms to minimize.
[2023-03-15 13:33:07] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 0 ms to minimize.
[2023-03-15 13:33:08] [INFO ] Deduced a trap composed of 224 places in 254 ms of which 0 ms to minimize.
[2023-03-15 13:33:08] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 0 ms to minimize.
[2023-03-15 13:33:08] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 0 ms to minimize.
[2023-03-15 13:33:09] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 0 ms to minimize.
[2023-03-15 13:33:09] [INFO ] Deduced a trap composed of 234 places in 238 ms of which 1 ms to minimize.
[2023-03-15 13:33:09] [INFO ] Deduced a trap composed of 232 places in 241 ms of which 0 ms to minimize.
[2023-03-15 13:33:10] [INFO ] Deduced a trap composed of 228 places in 235 ms of which 0 ms to minimize.
[2023-03-15 13:33:10] [INFO ] Deduced a trap composed of 234 places in 236 ms of which 1 ms to minimize.
[2023-03-15 13:33:10] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 1 ms to minimize.
[2023-03-15 13:33:11] [INFO ] Deduced a trap composed of 236 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:33:11] [INFO ] Deduced a trap composed of 226 places in 240 ms of which 1 ms to minimize.
[2023-03-15 13:33:11] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:33:11] [INFO ] Deduced a trap composed of 226 places in 234 ms of which 0 ms to minimize.
[2023-03-15 13:33:12] [INFO ] Deduced a trap composed of 238 places in 236 ms of which 1 ms to minimize.
[2023-03-15 13:33:12] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 0 ms to minimize.
[2023-03-15 13:33:12] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 1 ms to minimize.
[2023-03-15 13:33:13] [INFO ] Deduced a trap composed of 228 places in 235 ms of which 0 ms to minimize.
[2023-03-15 13:33:13] [INFO ] Deduced a trap composed of 230 places in 233 ms of which 0 ms to minimize.
[2023-03-15 13:33:13] [INFO ] Deduced a trap composed of 230 places in 233 ms of which 1 ms to minimize.
[2023-03-15 13:33:13] [INFO ] Deduced a trap composed of 228 places in 235 ms of which 0 ms to minimize.
[2023-03-15 13:33:14] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 0 ms to minimize.
[2023-03-15 13:33:14] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 0 ms to minimize.
[2023-03-15 13:33:14] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 0 ms to minimize.
[2023-03-15 13:33:14] [INFO ] Deduced a trap composed of 232 places in 237 ms of which 1 ms to minimize.
[2023-03-15 13:33:15] [INFO ] Deduced a trap composed of 232 places in 236 ms of which 0 ms to minimize.
[2023-03-15 13:33:15] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2023-03-15 13:33:15] [INFO ] Deduced a trap composed of 234 places in 228 ms of which 1 ms to minimize.
[2023-03-15 13:33:16] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 0 ms to minimize.
[2023-03-15 13:33:16] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 3 ms to minimize.
[2023-03-15 13:33:16] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 1 ms to minimize.
[2023-03-15 13:33:16] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 1 ms to minimize.
[2023-03-15 13:33:17] [INFO ] Deduced a trap composed of 226 places in 223 ms of which 1 ms to minimize.
[2023-03-15 13:33:17] [INFO ] Deduced a trap composed of 230 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:33:17] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 1 ms to minimize.
[2023-03-15 13:33:17] [INFO ] Deduced a trap composed of 226 places in 226 ms of which 0 ms to minimize.
[2023-03-15 13:33:18] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 1 ms to minimize.
[2023-03-15 13:33:18] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 0 ms to minimize.
[2023-03-15 13:33:18] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 1 ms to minimize.
[2023-03-15 13:33:19] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2023-03-15 13:33:19] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-15 13:33:19] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 0 ms to minimize.
[2023-03-15 13:33:19] [INFO ] Deduced a trap composed of 226 places in 238 ms of which 0 ms to minimize.
[2023-03-15 13:33:20] [INFO ] Deduced a trap composed of 226 places in 235 ms of which 0 ms to minimize.
[2023-03-15 13:33:20] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 1 ms to minimize.
[2023-03-15 13:33:20] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 1 ms to minimize.
[2023-03-15 13:33:21] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 1 ms to minimize.
[2023-03-15 13:33:21] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:33:21] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 1 ms to minimize.
[2023-03-15 13:33:21] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 1 ms to minimize.
[2023-03-15 13:33:22] [INFO ] Deduced a trap composed of 234 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:33:22] [INFO ] Deduced a trap composed of 236 places in 227 ms of which 0 ms to minimize.
[2023-03-15 13:33:22] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 2 ms to minimize.
[2023-03-15 13:33:23] [INFO ] Deduced a trap composed of 236 places in 227 ms of which 1 ms to minimize.
[2023-03-15 13:33:23] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 0 ms to minimize.
[2023-03-15 13:33:23] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2023-03-15 13:33:24] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 0 ms to minimize.
[2023-03-15 13:33:24] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 1 ms to minimize.
[2023-03-15 13:33:24] [INFO ] Deduced a trap composed of 226 places in 251 ms of which 0 ms to minimize.
[2023-03-15 13:33:25] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 0 ms to minimize.
[2023-03-15 13:33:26] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 0 ms to minimize.
[2023-03-15 13:33:26] [INFO ] Deduced a trap composed of 238 places in 246 ms of which 1 ms to minimize.
[2023-03-15 13:33:26] [INFO ] Deduced a trap composed of 232 places in 241 ms of which 1 ms to minimize.
[2023-03-15 13:33:27] [INFO ] Deduced a trap composed of 226 places in 258 ms of which 1 ms to minimize.
[2023-03-15 13:33:27] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 1 ms to minimize.
[2023-03-15 13:33:27] [INFO ] Deduced a trap composed of 226 places in 244 ms of which 0 ms to minimize.
[2023-03-15 13:33:28] [INFO ] Deduced a trap composed of 228 places in 256 ms of which 0 ms to minimize.
[2023-03-15 13:33:28] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2023-03-15 13:33:28] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2023-03-15 13:33:29] [INFO ] Deduced a trap composed of 232 places in 262 ms of which 1 ms to minimize.
[2023-03-15 13:33:29] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 1 ms to minimize.
[2023-03-15 13:33:29] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 0 ms to minimize.
[2023-03-15 13:33:29] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 0 ms to minimize.
[2023-03-15 13:33:30] [INFO ] Deduced a trap composed of 224 places in 253 ms of which 1 ms to minimize.
[2023-03-15 13:33:30] [INFO ] Deduced a trap composed of 234 places in 244 ms of which 0 ms to minimize.
[2023-03-15 13:33:30] [INFO ] Deduced a trap composed of 224 places in 261 ms of which 1 ms to minimize.
[2023-03-15 13:33:31] [INFO ] Deduced a trap composed of 230 places in 262 ms of which 0 ms to minimize.
[2023-03-15 13:33:31] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 1 ms to minimize.
[2023-03-15 13:33:32] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 0 ms to minimize.
[2023-03-15 13:33:32] [INFO ] Deduced a trap composed of 236 places in 259 ms of which 0 ms to minimize.
[2023-03-15 13:33:33] [INFO ] Deduced a trap composed of 238 places in 225 ms of which 0 ms to minimize.
[2023-03-15 13:33:34] [INFO ] Deduced a trap composed of 228 places in 253 ms of which 0 ms to minimize.
[2023-03-15 13:33:34] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 1 ms to minimize.
[2023-03-15 13:33:34] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 0 ms to minimize.
[2023-03-15 13:33:34] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 1 ms to minimize.
[2023-03-15 13:33:35] [INFO ] Deduced a trap composed of 228 places in 224 ms of which 1 ms to minimize.
[2023-03-15 13:33:35] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 1 ms to minimize.
[2023-03-15 13:33:36] [INFO ] Deduced a trap composed of 228 places in 230 ms of which 1 ms to minimize.
[2023-03-15 13:33:36] [INFO ] Deduced a trap composed of 232 places in 229 ms of which 0 ms to minimize.
[2023-03-15 13:33:37] [INFO ] Deduced a trap composed of 228 places in 231 ms of which 0 ms to minimize.
[2023-03-15 13:33:37] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 1 ms to minimize.
[2023-03-15 13:33:37] [INFO ] Deduced a trap composed of 234 places in 244 ms of which 0 ms to minimize.
[2023-03-15 13:33:38] [INFO ] Deduced a trap composed of 228 places in 230 ms of which 0 ms to minimize.
[2023-03-15 13:33:39] [INFO ] Deduced a trap composed of 226 places in 260 ms of which 1 ms to minimize.
[2023-03-15 13:33:39] [INFO ] Deduced a trap composed of 232 places in 245 ms of which 1 ms to minimize.
[2023-03-15 13:33:40] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 1 ms to minimize.
[2023-03-15 13:33:40] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2023-03-15 13:33:41] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 1 ms to minimize.
[2023-03-15 13:33:41] [INFO ] Deduced a trap composed of 224 places in 259 ms of which 0 ms to minimize.
[2023-03-15 13:33:41] [INFO ] Deduced a trap composed of 222 places in 262 ms of which 0 ms to minimize.
[2023-03-15 13:33:41] [INFO ] Deduced a trap composed of 232 places in 260 ms of which 0 ms to minimize.
[2023-03-15 13:33:42] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 1 ms to minimize.
[2023-03-15 13:33:42] [INFO ] Deduced a trap composed of 234 places in 272 ms of which 2 ms to minimize.
[2023-03-15 13:33:42] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 0 ms to minimize.
[2023-03-15 13:33:43] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 0 ms to minimize.
[2023-03-15 13:33:44] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 1 ms to minimize.
[2023-03-15 13:36:45] [INFO ] Trap strengthening (SAT) tested/added 128/128 trap constraints in 224543 ms
[2023-03-15 13:36:45] [INFO ] After 224908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 13:36:45] [INFO ] After 225017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 5 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 620 transition count 1289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 72 place count 618 transition count 1257
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 585 transition count 1256
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 583 transition count 1254
Applied a total of 142 rules in 215 ms. Remains 583 /664 variables (removed 81) and now considering 1254/1325 (removed 71) transitions.
[2023-03-15 13:36:46] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-15 13:36:46] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-15 13:36:47] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
[2023-03-15 13:36:47] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:36:47] [INFO ] Invariant cache hit.
[2023-03-15 13:36:47] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-15 13:36:47] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:36:47] [INFO ] Invariant cache hit.
[2023-03-15 13:36:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:36:49] [INFO ] Implicit Places using invariants and state equation in 2384 ms returned []
Implicit Place search using SMT with State Equation took 2840 ms to find 0 implicit places.
[2023-03-15 13:36:49] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-15 13:36:49] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:36:49] [INFO ] Invariant cache hit.
[2023-03-15 13:36:50] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/664 places, 1254/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4399 ms. Remains : 583/664 places, 1254/1325 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s164 1) (LT s532 1)), p1:(AND (GEQ s578 1) (GEQ s581 1)), p2:(LT s579 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6849 reset in 1179 ms.
Product exploration explored 100000 steps with 6860 reset in 1099 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 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 9 factoid took 471 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 683 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10000 steps, including 110 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 102 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 13:36:53] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:36:53] [INFO ] Invariant cache hit.
[2023-03-15 13:36:54] [INFO ] [Real]Absence check using 75 positive place invariants in 24 ms returned sat
[2023-03-15 13:36:54] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 13:36:54] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 13:36:54] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-15 13:36:54] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 13:37:02] [INFO ] After 8648ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 13:37:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:37:03] [INFO ] After 75ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 13:37:03] [INFO ] Deduced a trap composed of 267 places in 302 ms of which 1 ms to minimize.
[2023-03-15 13:37:03] [INFO ] Deduced a trap composed of 267 places in 278 ms of which 0 ms to minimize.
[2023-03-15 13:37:04] [INFO ] Deduced a trap composed of 275 places in 296 ms of which 1 ms to minimize.
[2023-03-15 13:37:04] [INFO ] Deduced a trap composed of 275 places in 290 ms of which 0 ms to minimize.
[2023-03-15 13:37:04] [INFO ] Deduced a trap composed of 275 places in 292 ms of which 0 ms to minimize.
[2023-03-15 13:37:05] [INFO ] Deduced a trap composed of 254 places in 284 ms of which 1 ms to minimize.
[2023-03-15 13:37:05] [INFO ] Deduced a trap composed of 283 places in 283 ms of which 1 ms to minimize.
[2023-03-15 13:37:05] [INFO ] Deduced a trap composed of 255 places in 279 ms of which 1 ms to minimize.
[2023-03-15 13:37:06] [INFO ] Deduced a trap composed of 267 places in 275 ms of which 1 ms to minimize.
[2023-03-15 13:37:06] [INFO ] Deduced a trap composed of 274 places in 271 ms of which 0 ms to minimize.
[2023-03-15 13:37:06] [INFO ] Deduced a trap composed of 271 places in 274 ms of which 1 ms to minimize.
[2023-03-15 13:37:07] [INFO ] Deduced a trap composed of 266 places in 276 ms of which 0 ms to minimize.
[2023-03-15 13:37:07] [INFO ] Deduced a trap composed of 263 places in 279 ms of which 0 ms to minimize.
[2023-03-15 13:37:08] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5407 ms
[2023-03-15 13:37:08] [INFO ] After 5561ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-15 13:37:08] [INFO ] After 14497ms 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 7 ms.
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 583 transition count 1252
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 581 transition count 1252
Applied a total of 4 rules in 35 ms. Remains 581 /583 variables (removed 2) and now considering 1252/1254 (removed 2) transitions.
[2023-03-15 13:37:08] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 13:37:08] [INFO ] Computed 82 place invariants in 19 ms
[2023-03-15 13:37:09] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 648 ms. Remains : 581/583 places, 1252/1254 transitions.
Finished random walk after 272 steps, including 19 resets, run visited all 1 properties in 4 ms. (steps per millisecond=68 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X p0), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 p2)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 560 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 32 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-15 13:37:10] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-15 13:37:10] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-15 13:37:10] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
[2023-03-15 13:37:10] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:37:10] [INFO ] Invariant cache hit.
[2023-03-15 13:37:11] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-15 13:37:11] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:37:11] [INFO ] Invariant cache hit.
[2023-03-15 13:37:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:37:13] [INFO ] Implicit Places using invariants and state equation in 2471 ms returned []
Implicit Place search using SMT with State Equation took 2906 ms to find 0 implicit places.
[2023-03-15 13:37:13] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 13:37:13] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:37:13] [INFO ] Invariant cache hit.
[2023-03-15 13:37:14] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4078 ms. Remains : 583/583 places, 1254/1254 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 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Finished random walk after 3919 steps, including 270 resets, run visited all 3 properties in 59 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 6828 reset in 1056 ms.
Product exploration explored 100000 steps with 6867 reset in 1079 ms.
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 22 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-15 13:37:17] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:37:17] [INFO ] Invariant cache hit.
[2023-03-15 13:37:17] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
[2023-03-15 13:37:17] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:37:17] [INFO ] Invariant cache hit.
[2023-03-15 13:37:18] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-15 13:37:18] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:37:18] [INFO ] Invariant cache hit.
[2023-03-15 13:37:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:37:20] [INFO ] Implicit Places using invariants and state equation in 2398 ms returned []
Implicit Place search using SMT with State Equation took 2838 ms to find 0 implicit places.
[2023-03-15 13:37:20] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 13:37:20] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 13:37:20] [INFO ] Invariant cache hit.
[2023-03-15 13:37:21] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3882 ms. Remains : 583/583 places, 1254/1254 transitions.
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-00 finished in 35456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 363 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 664 transition count 1321
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 660 transition count 1321
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 8 place count 660 transition count 1286
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 78 place count 625 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 624 transition count 1285
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 624 transition count 1285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 623 transition count 1284
Applied a total of 82 rules in 55 ms. Remains 623 /664 variables (removed 41) and now considering 1284/1325 (removed 41) transitions.
[2023-03-15 13:37:21] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
// Phase 1: matrix 1275 rows 623 cols
[2023-03-15 13:37:21] [INFO ] Computed 92 place invariants in 19 ms
[2023-03-15 13:37:22] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
[2023-03-15 13:37:22] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-15 13:37:22] [INFO ] Invariant cache hit.
[2023-03-15 13:37:22] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-15 13:37:22] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-15 13:37:22] [INFO ] Invariant cache hit.
[2023-03-15 13:37:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:37:25] [INFO ] Implicit Places using invariants and state equation in 2450 ms returned []
Implicit Place search using SMT with State Equation took 2759 ms to find 0 implicit places.
[2023-03-15 13:37:25] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 13:37:25] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-15 13:37:25] [INFO ] Invariant cache hit.
[2023-03-15 13:37:26] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/664 places, 1284/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4589 ms. Remains : 623/664 places, 1284/1325 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s496 1) (GEQ s617 1)) (AND (GEQ s284 1) (GEQ s596 1)) (AND (GEQ s225 1) (GEQ s590 1)) (AND (GEQ s343 1) (GEQ s602 1)) (AND (GEQ s319 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-01 finished in 4693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 12 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 59 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-15 13:37:26] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-15 13:37:26] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-15 13:37:26] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
[2023-03-15 13:37:26] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:26] [INFO ] Invariant cache hit.
[2023-03-15 13:37:27] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-15 13:37:27] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:27] [INFO ] Invariant cache hit.
[2023-03-15 13:37:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:37:29] [INFO ] Implicit Places using invariants and state equation in 2204 ms returned []
Implicit Place search using SMT with State Equation took 2575 ms to find 0 implicit places.
[2023-03-15 13:37:29] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 13:37:29] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:29] [INFO ] Invariant cache hit.
[2023-03-15 13:37:29] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3747 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s199 1) (GEQ s202 1) (GEQ s206 1) (GEQ s210 8)) (AND (GEQ s199 1) (GEQ s200 1) (GEQ s202 1) (GEQ s210 8)) (AND (GEQ s199 1) (GEQ s201 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-02 finished in 3813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 654 transition count 1292
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 621 transition count 1291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 620 transition count 1291
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 68 place count 620 transition count 1257
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 585 transition count 1256
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 3 with 2 rules applied. Total rules applied 140 place count 584 transition count 1255
Applied a total of 140 rules in 68 ms. Remains 584 /664 variables (removed 80) and now considering 1255/1325 (removed 70) transitions.
[2023-03-15 13:37:30] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2023-03-15 13:37:30] [INFO ] Computed 82 place invariants in 21 ms
[2023-03-15 13:37:30] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
[2023-03-15 13:37:30] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-15 13:37:30] [INFO ] Invariant cache hit.
[2023-03-15 13:37:30] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-15 13:37:30] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-15 13:37:30] [INFO ] Invariant cache hit.
[2023-03-15 13:37:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:37:34] [INFO ] Implicit Places using invariants and state equation in 3253 ms returned []
Implicit Place search using SMT with State Equation took 3688 ms to find 0 implicit places.
[2023-03-15 13:37:34] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-15 13:37:34] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-15 13:37:34] [INFO ] Invariant cache hit.
[2023-03-15 13:37:34] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/664 places, 1255/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4835 ms. Remains : 584/664 places, 1255/1325 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s581 1) (LT s580 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-03 finished in 4923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1 U !p2)))))'
Support contains 36 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 581 transition count 1252
Applied a total of 146 rules in 77 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-15 13:37:34] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 13:37:34] [INFO ] Computed 82 place invariants in 24 ms
[2023-03-15 13:37:35] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
[2023-03-15 13:37:35] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-15 13:37:35] [INFO ] Invariant cache hit.
[2023-03-15 13:37:35] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-15 13:37:35] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-15 13:37:35] [INFO ] Invariant cache hit.
[2023-03-15 13:37:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:37:38] [INFO ] Implicit Places using invariants and state equation in 2491 ms returned []
Implicit Place search using SMT with State Equation took 2935 ms to find 0 implicit places.
[2023-03-15 13:37:38] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-15 13:37:38] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-15 13:37:38] [INFO ] Invariant cache hit.
[2023-03-15 13:37:39] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4206 ms. Remains : 581/664 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s35 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ s45 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ s55 1) (GEQ s163 1)) (AND (GEQ s0 1) (GEQ ...], 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 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-04 finished in 4339 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)||(F(p2)&&X(p1))))'
Support contains 54 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 20 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-15 13:37:39] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-15 13:37:39] [INFO ] Computed 82 place invariants in 13 ms
[2023-03-15 13:37:40] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
[2023-03-15 13:37:40] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:37:40] [INFO ] Invariant cache hit.
[2023-03-15 13:37:40] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-15 13:37:40] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:37:40] [INFO ] Invariant cache hit.
[2023-03-15 13:37:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:37:42] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
[2023-03-15 13:37:42] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:37:42] [INFO ] Invariant cache hit.
[2023-03-15 13:37:43] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3939 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 363 ms :[(NOT p1), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s203 1) (GEQ s208 1) (GEQ s209 1) (GEQ s210 1) (GEQ s214 7)) (AND (GEQ s203 1) (GEQ s204 1) (GEQ s205 1) (GEQ s213 1) (GEQ s214 7)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-07 finished in 4330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 620 transition count 1291
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 68 place count 620 transition count 1255
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 140 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 70 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-15 13:37:43] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-15 13:37:43] [INFO ] Computed 82 place invariants in 13 ms
[2023-03-15 13:37:44] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
[2023-03-15 13:37:44] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:44] [INFO ] Invariant cache hit.
[2023-03-15 13:37:44] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-15 13:37:44] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:44] [INFO ] Invariant cache hit.
[2023-03-15 13:37:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:37:47] [INFO ] Implicit Places using invariants and state equation in 2676 ms returned []
Implicit Place search using SMT with State Equation took 3105 ms to find 0 implicit places.
[2023-03-15 13:37:47] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 13:37:47] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:47] [INFO ] Invariant cache hit.
[2023-03-15 13:37:48] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4570 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s581 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7557 reset in 1007 ms.
Product exploration explored 100000 steps with 7565 reset in 983 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 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 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 70 steps, including 4 resets, run visited all 1 properties in 3 ms. (steps per millisecond=23 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 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 51 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 22 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-15 13:37:50] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:50] [INFO ] Invariant cache hit.
[2023-03-15 13:37:51] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
[2023-03-15 13:37:51] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:51] [INFO ] Invariant cache hit.
[2023-03-15 13:37:51] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-15 13:37:51] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:51] [INFO ] Invariant cache hit.
[2023-03-15 13:37:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:37:53] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2023-03-15 13:37:53] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 13:37:53] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:53] [INFO ] Invariant cache hit.
[2023-03-15 13:37:53] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3221 ms. Remains : 582/582 places, 1253/1253 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 124 steps, including 9 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7552 reset in 974 ms.
Product exploration explored 100000 steps with 7544 reset in 1002 ms.
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 19 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-15 13:37:56] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:56] [INFO ] Invariant cache hit.
[2023-03-15 13:37:56] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
[2023-03-15 13:37:56] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:56] [INFO ] Invariant cache hit.
[2023-03-15 13:37:57] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-15 13:37:57] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:37:57] [INFO ] Invariant cache hit.
[2023-03-15 13:37:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:38:00] [INFO ] Implicit Places using invariants and state equation in 2969 ms returned []
Implicit Place search using SMT with State Equation took 3420 ms to find 0 implicit places.
[2023-03-15 13:38:00] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 13:38:00] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 13:38:00] [INFO ] Invariant cache hit.
[2023-03-15 13:38:00] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4571 ms. Remains : 582/582 places, 1253/1253 transitions.
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-08 finished in 17439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 18 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-15 13:38:00] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-15 13:38:01] [INFO ] Computed 82 place invariants in 37 ms
[2023-03-15 13:38:01] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
[2023-03-15 13:38:01] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:38:01] [INFO ] Invariant cache hit.
[2023-03-15 13:38:02] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-15 13:38:02] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:38:02] [INFO ] Invariant cache hit.
[2023-03-15 13:38:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:38:04] [INFO ] Implicit Places using invariants and state equation in 2233 ms returned []
Implicit Place search using SMT with State Equation took 2745 ms to find 0 implicit places.
[2023-03-15 13:38:04] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:38:04] [INFO ] Invariant cache hit.
[2023-03-15 13:38:05] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4245 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-09 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 (GEQ s198 4) (GEQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-09 finished in 4358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||X(F((!p0 U (p1||G(!p0)))))) U X(G(p2)))))'
Support contains 36 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 23 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-15 13:38:05] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:38:05] [INFO ] Invariant cache hit.
[2023-03-15 13:38:06] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
[2023-03-15 13:38:06] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:38:06] [INFO ] Invariant cache hit.
[2023-03-15 13:38:06] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-15 13:38:06] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:38:06] [INFO ] Invariant cache hit.
[2023-03-15 13:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:38:10] [INFO ] Implicit Places using invariants and state equation in 4018 ms returned []
Implicit Place search using SMT with State Equation took 4467 ms to find 0 implicit places.
[2023-03-15 13:38:10] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:38:10] [INFO ] Invariant cache hit.
[2023-03-15 13:38:11] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5983 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s200 2), p0:(OR (AND (GEQ s32 1) (GEQ s98 1) (GEQ s130 1)) (AND (GEQ s32 1) (GEQ s98 1) (GEQ s131 1)) (AND (GEQ s32 1) (GEQ s98 1) (GEQ s132 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-10 finished in 6192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 33 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 580 transition count 1251
Applied a total of 148 rules in 55 ms. Remains 580 /664 variables (removed 84) and now considering 1251/1325 (removed 74) transitions.
[2023-03-15 13:38:11] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-15 13:38:11] [INFO ] Computed 82 place invariants in 23 ms
[2023-03-15 13:38:12] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
[2023-03-15 13:38:12] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 13:38:12] [INFO ] Invariant cache hit.
[2023-03-15 13:38:12] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-15 13:38:12] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 13:38:12] [INFO ] Invariant cache hit.
[2023-03-15 13:38:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:38:15] [INFO ] Implicit Places using invariants and state equation in 2530 ms returned []
Implicit Place search using SMT with State Equation took 2976 ms to find 0 implicit places.
[2023-03-15 13:38:15] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 13:38:15] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 13:38:15] [INFO ] Invariant cache hit.
[2023-03-15 13:38:15] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/664 places, 1251/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4196 ms. Remains : 580/664 places, 1251/1325 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s197 2) (AND (GEQ s191 1) (GEQ s579 1)) (AND (GEQ s186 1) (GEQ s579 1)) (AND (GEQ s167 1) (GEQ s579 1)) (AND (GEQ s172 1) (GEQ s579 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 1 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-12 finished in 4256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 43 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 21 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-15 13:38:15] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-15 13:38:15] [INFO ] Computed 82 place invariants in 20 ms
[2023-03-15 13:38:16] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
[2023-03-15 13:38:16] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:38:16] [INFO ] Invariant cache hit.
[2023-03-15 13:38:16] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-15 13:38:16] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:38:16] [INFO ] Invariant cache hit.
[2023-03-15 13:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:38:20] [INFO ] Implicit Places using invariants and state equation in 3819 ms returned []
Implicit Place search using SMT with State Equation took 4237 ms to find 0 implicit places.
[2023-03-15 13:38:20] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 13:38:20] [INFO ] Invariant cache hit.
[2023-03-15 13:38:21] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5766 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s13 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 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-14 finished in 5893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 619 transition count 1255
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 581 transition count 1252
Applied a total of 146 rules in 55 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-15 13:38:21] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 13:38:21] [INFO ] Computed 82 place invariants in 13 ms
[2023-03-15 13:38:22] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
[2023-03-15 13:38:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-15 13:38:22] [INFO ] Invariant cache hit.
[2023-03-15 13:38:22] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-15 13:38:22] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-15 13:38:22] [INFO ] Invariant cache hit.
[2023-03-15 13:38:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 13:38:25] [INFO ] Implicit Places using invariants and state equation in 2566 ms returned []
Implicit Place search using SMT with State Equation took 3010 ms to find 0 implicit places.
[2023-03-15 13:38:25] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-15 13:38:25] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-15 13:38:25] [INFO ] Invariant cache hit.
[2023-03-15 13:38:25] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4282 ms. Remains : 581/664 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S10J30-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s198 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S10J30-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S10J30-LTLFireability-15 finished in 4333 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)||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-15 13:38:26] [INFO ] Flatten gal took : 88 ms
[2023-03-15 13:38:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-15 13:38:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1325 transitions and 8384 arcs took 8 ms.
Total runtime 417990 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-COL-S10J30
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678888017679

--------------------
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: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 5 (type EXCL) for 0 PolyORBNT-COL-S10J30-LTLFireability-00
lola: time limit : 1200 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/1200 1/32 PolyORBNT-COL-S10J30-LTLFireability-00 78042 m, 15608 m/sec, 336394 t fired, .

Time elapsed: 5 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/1200 2/32 PolyORBNT-COL-S10J30-LTLFireability-00 165485 m, 17488 m/sec, 623671 t fired, .

Time elapsed: 10 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/1200 3/32 PolyORBNT-COL-S10J30-LTLFireability-00 252743 m, 17451 m/sec, 904545 t fired, .

Time elapsed: 15 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/1200 4/32 PolyORBNT-COL-S10J30-LTLFireability-00 339799 m, 17411 m/sec, 1184920 t fired, .

Time elapsed: 20 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/1200 5/32 PolyORBNT-COL-S10J30-LTLFireability-00 426925 m, 17425 m/sec, 1464958 t fired, .

Time elapsed: 25 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 30/1200 6/32 PolyORBNT-COL-S10J30-LTLFireability-00 514375 m, 17490 m/sec, 1746434 t fired, .

Time elapsed: 30 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 35/1200 7/32 PolyORBNT-COL-S10J30-LTLFireability-00 602456 m, 17616 m/sec, 2030146 t fired, .

Time elapsed: 35 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 40/1200 8/32 PolyORBNT-COL-S10J30-LTLFireability-00 690350 m, 17578 m/sec, 2313346 t fired, .

Time elapsed: 40 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 45/1200 9/32 PolyORBNT-COL-S10J30-LTLFireability-00 777782 m, 17486 m/sec, 2594031 t fired, .

Time elapsed: 45 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 50/1200 10/32 PolyORBNT-COL-S10J30-LTLFireability-00 865210 m, 17485 m/sec, 2875824 t fired, .

Time elapsed: 50 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 55/1200 11/32 PolyORBNT-COL-S10J30-LTLFireability-00 952729 m, 17503 m/sec, 3157532 t fired, .

Time elapsed: 55 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 60/1200 11/32 PolyORBNT-COL-S10J30-LTLFireability-00 1040142 m, 17482 m/sec, 3439434 t fired, .

Time elapsed: 60 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 65/1200 12/32 PolyORBNT-COL-S10J30-LTLFireability-00 1127394 m, 17450 m/sec, 3719649 t fired, .

Time elapsed: 65 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 70/1200 13/32 PolyORBNT-COL-S10J30-LTLFireability-00 1214605 m, 17442 m/sec, 4000633 t fired, .

Time elapsed: 70 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 75/1200 14/32 PolyORBNT-COL-S10J30-LTLFireability-00 1301737 m, 17426 m/sec, 4280920 t fired, .

Time elapsed: 75 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 80/1200 15/32 PolyORBNT-COL-S10J30-LTLFireability-00 1388881 m, 17428 m/sec, 4561771 t fired, .

Time elapsed: 80 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 85/1200 16/32 PolyORBNT-COL-S10J30-LTLFireability-00 1475593 m, 17342 m/sec, 4840700 t fired, .

Time elapsed: 85 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 90/1200 17/32 PolyORBNT-COL-S10J30-LTLFireability-00 1562368 m, 17355 m/sec, 5120169 t fired, .

Time elapsed: 90 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 95/1200 17/32 PolyORBNT-COL-S10J30-LTLFireability-00 1648985 m, 17323 m/sec, 5398877 t fired, .

Time elapsed: 95 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 100/1200 18/32 PolyORBNT-COL-S10J30-LTLFireability-00 1735322 m, 17267 m/sec, 5676610 t fired, .

Time elapsed: 100 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 105/1200 19/32 PolyORBNT-COL-S10J30-LTLFireability-00 1821714 m, 17278 m/sec, 5954603 t fired, .

Time elapsed: 105 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 110/1200 20/32 PolyORBNT-COL-S10J30-LTLFireability-00 1907928 m, 17242 m/sec, 6232356 t fired, .

Time elapsed: 110 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 115/1200 21/32 PolyORBNT-COL-S10J30-LTLFireability-00 1993949 m, 17204 m/sec, 6508845 t fired, .

Time elapsed: 115 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 120/1200 21/32 PolyORBNT-COL-S10J30-LTLFireability-00 2076478 m, 16505 m/sec, 6848387 t fired, .

Time elapsed: 120 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 125/1200 22/32 PolyORBNT-COL-S10J30-LTLFireability-00 2164874 m, 17679 m/sec, 7121809 t fired, .

Time elapsed: 125 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 130/1200 23/32 PolyORBNT-COL-S10J30-LTLFireability-00 2252524 m, 17530 m/sec, 7387869 t fired, .

Time elapsed: 130 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 135/1200 24/32 PolyORBNT-COL-S10J30-LTLFireability-00 2340933 m, 17681 m/sec, 7647151 t fired, .

Time elapsed: 135 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 140/1200 25/32 PolyORBNT-COL-S10J30-LTLFireability-00 2430272 m, 17867 m/sec, 7908180 t fired, .

Time elapsed: 140 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 145/1200 26/32 PolyORBNT-COL-S10J30-LTLFireability-00 2518798 m, 17705 m/sec, 8165518 t fired, .

Time elapsed: 145 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 150/1200 27/32 PolyORBNT-COL-S10J30-LTLFireability-00 2607277 m, 17695 m/sec, 8425461 t fired, .

Time elapsed: 150 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 155/1200 27/32 PolyORBNT-COL-S10J30-LTLFireability-00 2695035 m, 17551 m/sec, 8680473 t fired, .

Time elapsed: 155 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 160/1200 28/32 PolyORBNT-COL-S10J30-LTLFireability-00 2782211 m, 17435 m/sec, 8936909 t fired, .

Time elapsed: 160 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 165/1200 29/32 PolyORBNT-COL-S10J30-LTLFireability-00 2869897 m, 17537 m/sec, 9191779 t fired, .

Time elapsed: 165 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 170/1200 30/32 PolyORBNT-COL-S10J30-LTLFireability-00 2957371 m, 17494 m/sec, 9448935 t fired, .

Time elapsed: 170 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 175/1200 31/32 PolyORBNT-COL-S10J30-LTLFireability-00 3046312 m, 17788 m/sec, 9707427 t fired, .

Time elapsed: 175 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 180/1200 32/32 PolyORBNT-COL-S10J30-LTLFireability-00 3134322 m, 17602 m/sec, 9963232 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 5 (type EXCL) for PolyORBNT-COL-S10J30-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 8 (type EXCL) for 7 PolyORBNT-COL-S10J30-LTLFireability-08
lola: time limit : 1707 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1707 2/32 PolyORBNT-COL-S10J30-LTLFireability-08 115302 m, 23060 m/sec, 350704 t fired, .

Time elapsed: 190 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1707 3/32 PolyORBNT-COL-S10J30-LTLFireability-08 240072 m, 24954 m/sec, 764247 t fired, .

Time elapsed: 195 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1707 4/32 PolyORBNT-COL-S10J30-LTLFireability-08 365864 m, 25158 m/sec, 1188982 t fired, .

Time elapsed: 200 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/1707 6/32 PolyORBNT-COL-S10J30-LTLFireability-08 491888 m, 25204 m/sec, 1616366 t fired, .

Time elapsed: 205 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/1707 7/32 PolyORBNT-COL-S10J30-LTLFireability-08 617586 m, 25139 m/sec, 2042236 t fired, .

Time elapsed: 210 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/1707 8/32 PolyORBNT-COL-S10J30-LTLFireability-08 743246 m, 25132 m/sec, 2468822 t fired, .

Time elapsed: 215 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/1707 9/32 PolyORBNT-COL-S10J30-LTLFireability-08 868652 m, 25081 m/sec, 2893430 t fired, .

Time elapsed: 220 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/1707 11/32 PolyORBNT-COL-S10J30-LTLFireability-08 993590 m, 24987 m/sec, 3316957 t fired, .

Time elapsed: 225 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 45/1707 12/32 PolyORBNT-COL-S10J30-LTLFireability-08 1118065 m, 24895 m/sec, 3737447 t fired, .

Time elapsed: 230 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 50/1707 13/32 PolyORBNT-COL-S10J30-LTLFireability-08 1242788 m, 24944 m/sec, 4159843 t fired, .

Time elapsed: 235 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 55/1707 14/32 PolyORBNT-COL-S10J30-LTLFireability-08 1367316 m, 24905 m/sec, 4582371 t fired, .

Time elapsed: 240 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 60/1707 15/32 PolyORBNT-COL-S10J30-LTLFireability-08 1491984 m, 24933 m/sec, 5004920 t fired, .

Time elapsed: 245 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 65/1707 17/32 PolyORBNT-COL-S10J30-LTLFireability-08 1616028 m, 24808 m/sec, 5424937 t fired, .

Time elapsed: 250 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 70/1707 18/32 PolyORBNT-COL-S10J30-LTLFireability-08 1740112 m, 24816 m/sec, 5845911 t fired, .

Time elapsed: 255 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 75/1707 19/32 PolyORBNT-COL-S10J30-LTLFireability-08 1863891 m, 24755 m/sec, 6265231 t fired, .

Time elapsed: 260 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 80/1707 20/32 PolyORBNT-COL-S10J30-LTLFireability-08 1987134 m, 24648 m/sec, 6682772 t fired, .

Time elapsed: 265 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 85/1707 21/32 PolyORBNT-COL-S10J30-LTLFireability-08 2110708 m, 24714 m/sec, 7100579 t fired, .

Time elapsed: 270 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 90/1707 23/32 PolyORBNT-COL-S10J30-LTLFireability-08 2234418 m, 24742 m/sec, 7519345 t fired, .

Time elapsed: 275 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 95/1707 24/32 PolyORBNT-COL-S10J30-LTLFireability-08 2357700 m, 24656 m/sec, 7937193 t fired, .

Time elapsed: 280 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 100/1707 25/32 PolyORBNT-COL-S10J30-LTLFireability-08 2480652 m, 24590 m/sec, 8354026 t fired, .

Time elapsed: 285 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 105/1707 26/32 PolyORBNT-COL-S10J30-LTLFireability-08 2603471 m, 24563 m/sec, 8770691 t fired, .

Time elapsed: 290 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 110/1707 27/32 PolyORBNT-COL-S10J30-LTLFireability-08 2726352 m, 24576 m/sec, 9187002 t fired, .

Time elapsed: 295 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 115/1707 28/32 PolyORBNT-COL-S10J30-LTLFireability-08 2848739 m, 24477 m/sec, 9601484 t fired, .

Time elapsed: 300 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 120/1707 29/32 PolyORBNT-COL-S10J30-LTLFireability-08 2970805 m, 24413 m/sec, 10013566 t fired, .

Time elapsed: 305 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 125/1707 30/32 PolyORBNT-COL-S10J30-LTLFireability-08 3093261 m, 24491 m/sec, 10429155 t fired, .

Time elapsed: 310 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 130/1707 31/32 PolyORBNT-COL-S10J30-LTLFireability-08 3215363 m, 24420 m/sec, 10842448 t fired, .

Time elapsed: 315 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 135/1707 32/32 PolyORBNT-COL-S10J30-LTLFireability-08 3338502 m, 24627 m/sec, 11259825 t fired, .

Time elapsed: 320 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 8 (type EXCL) for PolyORBNT-COL-S10J30-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 325 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 3 (type EXCL) for 0 PolyORBNT-COL-S10J30-LTLFireability-00
lola: time limit : 3275 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 5/3275 1/32 PolyORBNT-COL-S10J30-LTLFireability-00 67246 m, 13449 m/sec, 150685 t fired, .

Time elapsed: 330 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 10/3275 2/32 PolyORBNT-COL-S10J30-LTLFireability-00 132328 m, 13016 m/sec, 292503 t fired, .

Time elapsed: 335 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 15/3275 3/32 PolyORBNT-COL-S10J30-LTLFireability-00 197206 m, 12975 m/sec, 433880 t fired, .

Time elapsed: 340 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 20/3275 4/32 PolyORBNT-COL-S10J30-LTLFireability-00 261762 m, 12911 m/sec, 574526 t fired, .

Time elapsed: 345 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 25/3275 5/32 PolyORBNT-COL-S10J30-LTLFireability-00 325956 m, 12838 m/sec, 714412 t fired, .

Time elapsed: 350 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 30/3275 6/32 PolyORBNT-COL-S10J30-LTLFireability-00 390158 m, 12840 m/sec, 854423 t fired, .

Time elapsed: 355 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 35/3275 6/32 PolyORBNT-COL-S10J30-LTLFireability-00 464148 m, 14798 m/sec, 1007385 t fired, .

Time elapsed: 360 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 40/3275 7/32 PolyORBNT-COL-S10J30-LTLFireability-00 543769 m, 15924 m/sec, 1153283 t fired, .

Time elapsed: 365 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 45/3275 8/32 PolyORBNT-COL-S10J30-LTLFireability-00 623104 m, 15867 m/sec, 1299627 t fired, .

Time elapsed: 370 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 50/3275 9/32 PolyORBNT-COL-S10J30-LTLFireability-00 702391 m, 15857 m/sec, 1444071 t fired, .

Time elapsed: 375 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 55/3275 10/32 PolyORBNT-COL-S10J30-LTLFireability-00 780771 m, 15676 m/sec, 1587948 t fired, .

Time elapsed: 380 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 60/3275 11/32 PolyORBNT-COL-S10J30-LTLFireability-00 858739 m, 15593 m/sec, 1730638 t fired, .

Time elapsed: 385 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 65/3275 12/32 PolyORBNT-COL-S10J30-LTLFireability-00 936259 m, 15504 m/sec, 1872435 t fired, .

Time elapsed: 390 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 70/3275 13/32 PolyORBNT-COL-S10J30-LTLFireability-00 1013350 m, 15418 m/sec, 2014543 t fired, .

Time elapsed: 395 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 75/3275 13/32 PolyORBNT-COL-S10J30-LTLFireability-00 1089044 m, 15138 m/sec, 2176768 t fired, .

Time elapsed: 400 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 80/3275 14/32 PolyORBNT-COL-S10J30-LTLFireability-00 1168620 m, 15915 m/sec, 2323892 t fired, .

Time elapsed: 405 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 85/3275 15/32 PolyORBNT-COL-S10J30-LTLFireability-00 1246630 m, 15602 m/sec, 2473803 t fired, .

Time elapsed: 410 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 90/3275 16/32 PolyORBNT-COL-S10J30-LTLFireability-00 1323453 m, 15364 m/sec, 2621975 t fired, .

Time elapsed: 415 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 95/3275 17/32 PolyORBNT-COL-S10J30-LTLFireability-00 1399855 m, 15280 m/sec, 2768985 t fired, .

Time elapsed: 420 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 100/3275 18/32 PolyORBNT-COL-S10J30-LTLFireability-00 1475282 m, 15085 m/sec, 2913755 t fired, .

Time elapsed: 425 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 105/3275 19/32 PolyORBNT-COL-S10J30-LTLFireability-00 1549801 m, 14903 m/sec, 3056847 t fired, .

Time elapsed: 430 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 110/3275 20/32 PolyORBNT-COL-S10J30-LTLFireability-00 1626487 m, 15337 m/sec, 3223506 t fired, .

Time elapsed: 435 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 115/3275 21/32 PolyORBNT-COL-S10J30-LTLFireability-00 1704289 m, 15560 m/sec, 3373058 t fired, .

Time elapsed: 440 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 120/3275 21/32 PolyORBNT-COL-S10J30-LTLFireability-00 1781078 m, 15357 m/sec, 3521033 t fired, .

Time elapsed: 445 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 125/3275 22/32 PolyORBNT-COL-S10J30-LTLFireability-00 1857571 m, 15298 m/sec, 3668139 t fired, .

Time elapsed: 450 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 130/3275 23/32 PolyORBNT-COL-S10J30-LTLFireability-00 1932848 m, 15055 m/sec, 3813347 t fired, .

Time elapsed: 455 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 135/3275 24/32 PolyORBNT-COL-S10J30-LTLFireability-00 2007530 m, 14936 m/sec, 3957130 t fired, .

Time elapsed: 460 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 140/3275 25/32 PolyORBNT-COL-S10J30-LTLFireability-00 2082654 m, 15024 m/sec, 4121345 t fired, .

Time elapsed: 465 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 145/3275 26/32 PolyORBNT-COL-S10J30-LTLFireability-00 2160657 m, 15600 m/sec, 4269736 t fired, .

Time elapsed: 470 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 150/3275 27/32 PolyORBNT-COL-S10J30-LTLFireability-00 2237841 m, 15436 m/sec, 4417907 t fired, .

Time elapsed: 475 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 155/3275 28/32 PolyORBNT-COL-S10J30-LTLFireability-00 2314239 m, 15279 m/sec, 4565530 t fired, .

Time elapsed: 480 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 160/3275 28/32 PolyORBNT-COL-S10J30-LTLFireability-00 2389736 m, 15099 m/sec, 4711503 t fired, .

Time elapsed: 485 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 165/3275 29/32 PolyORBNT-COL-S10J30-LTLFireability-00 2464238 m, 14900 m/sec, 4855018 t fired, .

Time elapsed: 490 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 170/3275 30/32 PolyORBNT-COL-S10J30-LTLFireability-00 2538441 m, 14840 m/sec, 5016464 t fired, .

Time elapsed: 495 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 175/3275 31/32 PolyORBNT-COL-S10J30-LTLFireability-00 2616312 m, 15574 m/sec, 5164529 t fired, .

Time elapsed: 500 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
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 180/3275 32/32 PolyORBNT-COL-S10J30-LTLFireability-00 2693370 m, 15411 m/sec, 5313411 t fired, .

Time elapsed: 505 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 3 (type EXCL) for PolyORBNT-COL-S10J30-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ 0 0 0 0 2 0 2 0
PolyORBNT-COL-S10J30-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-COL-S10J30-LTLFireability-00: CONJ unknown CONJ
PolyORBNT-COL-S10J30-LTLFireability-08: LTL unknown AGGR


Time elapsed: 510 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="PolyORBNT-COL-S10J30"
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 PolyORBNT-COL-S10J30, 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-167873948200684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J30.tgz
mv PolyORBNT-COL-S10J30 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;