Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016700460.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBLF-COL-S02J04T10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016700460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 13:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 154K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652853781780

Running Version 202205111006
[2022-05-18 06:03:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 06:03:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 06:03:03] [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.
[2022-05-18 06:03:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 06:03:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 668 ms
[2022-05-18 06:03:03] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-18 06:03:03] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 9 ms.
[2022-05-18 06:03:03] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 6 formulas.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-13 TRUE 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 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 06:03:04] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2022-05-18 06:03:04] [INFO ] Computed 26 place invariants in 18 ms
[2022-05-18 06:03:04] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-18 06:03:04] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2022-05-18 06:03:04] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 06:03:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-18 06:03:04] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 6 ms returned sat
[2022-05-18 06:03:04] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 06:03:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-18 06:03:04] [INFO ] After 46ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 06:03:04] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-18 06:03:04] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 32 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
[2022-05-18 06:03:04] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2022-05-18 06:03:04] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-18 06:03:04] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 2 transitions.
Found 2 dead transitions using SMT.
Drop transitions removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in SAFETY mode, iteration 1 : 59/81 places, 42/65 transitions.
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 194 edges and 57 vertex of which 1 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 1 /59 variables (removed 58) and now considering 0/42 (removed 42) transitions.
Finished structural reductions, in 2 iterations. Remains : 1/81 places, 0/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2022-05-18 06:03:04] [INFO ] Flatten gal took : 29 ms
[2022-05-18 06:03:04] [INFO ] Flatten gal took : 10 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2022-05-18 06:03:04] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 29 ms.
[2022-05-18 06:03:04] [INFO ] Unfolded 10 HLPN properties in 0 ms.
[2022-05-18 06:03:04] [INFO ] Reduced 10 identical enabling conditions.
[2022-05-18 06:03:04] [INFO ] Reduced 10 identical enabling conditions.
[2022-05-18 06:03:04] [INFO ] Reduced 10 identical enabling conditions.
[2022-05-18 06:03:04] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 272 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Applied a total of 2 rules in 49 ms. Remains 750 /752 variables (removed 2) and now considering 1412/1412 (removed 0) transitions.
[2022-05-18 06:03:04] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 750 cols
[2022-05-18 06:03:04] [INFO ] Computed 52 place invariants in 45 ms
[2022-05-18 06:03:05] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
[2022-05-18 06:03:05] [INFO ] Flow matrix only has 1282 transitions (discarded 20 similar events)
// Phase 1: matrix 1282 rows 750 cols
[2022-05-18 06:03:05] [INFO ] Computed 52 place invariants in 45 ms
[2022-05-18 06:03:05] [INFO ] Implicit Places using invariants in 430 ms returned [574, 575, 576, 577, 578, 579, 580, 581, 582, 583]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 436 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 740/752 places, 1302/1412 transitions.
Reduce places removed 2 places and 20 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 738 transition count 1282
Reduce places removed 10 places and 20 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 728 transition count 1262
Deduced a syphon composed of 10 places in 3 ms
Applied a total of 12 rules in 23 ms. Remains 728 /740 variables (removed 12) and now considering 1262/1302 (removed 40) transitions.
[2022-05-18 06:03:05] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 728 cols
[2022-05-18 06:03:05] [INFO ] Computed 52 place invariants in 33 ms
[2022-05-18 06:03:06] [INFO ] Implicit Places using invariants in 359 ms returned []
[2022-05-18 06:03:06] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 728 cols
[2022-05-18 06:03:06] [INFO ] Computed 52 place invariants in 23 ms
[2022-05-18 06:03:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:03:12] [INFO ] Implicit Places using invariants and state equation in 5967 ms returned []
Implicit Place search using SMT with State Equation took 6333 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 728/752 places, 1262/1412 transitions.
Finished structural reductions, in 2 iterations. Remains : 728/752 places, 1262/1412 transitions.
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Support contains 262 out of 718 places after structural reductions.
[2022-05-18 06:03:12] [INFO ] Flatten gal took : 118 ms
[2022-05-18 06:03:12] [INFO ] Flatten gal took : 100 ms
[2022-05-18 06:03:12] [INFO ] Input system was already deterministic with 1262 transitions.
Finished random walk after 93 steps, including 0 resets, run visited all 21 properties in 15 ms. (steps per millisecond=6 )
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(((!p0&&X((!p0 U (!p1||G(!p0))))) U (G((!p0&&X((!p0 U (!p1||G(!p0))))))||(X((!p0 U (!p1||G(!p0))))&&p2)))) U (G(F(((!p0&&X((!p0 U (!p1||G(!p0))))) U ((X((!p0 U (!p1||G(!p0))))&&p3)||G((!p0&&X((!p0 U (!p1||G(!p0))))))))))||(G(!p1)&&F(((!p0&&X((!p0 U (!p1||G(!p0))))) U ((X((!p0 U (!p1||G(!p0))))&&p4)||G((!p0&&X((!p0 U (!p1||G(!p0)))))))))))))'
Support contains 35 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Applied a total of 0 rules in 20 ms. Remains 718 /718 variables (removed 0) and now considering 1262/1262 (removed 0) transitions.
[2022-05-18 06:03:13] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 718 cols
[2022-05-18 06:03:13] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 06:03:13] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
[2022-05-18 06:03:13] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 718 cols
[2022-05-18 06:03:13] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 06:03:14] [INFO ] Implicit Places using invariants in 447 ms returned []
[2022-05-18 06:03:14] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 718 cols
[2022-05-18 06:03:14] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 06:03:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:03:20] [INFO ] Implicit Places using invariants and state equation in 5654 ms returned []
Implicit Place search using SMT with State Equation took 6103 ms to find 0 implicit places.
[2022-05-18 06:03:20] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 718 cols
[2022-05-18 06:03:20] [INFO ] Computed 42 place invariants in 24 ms
[2022-05-18 06:03:20] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 718/718 places, 1262/1262 transitions.
Stuttering acceptance computed with spot in 847 ms :[(OR (AND p0 (NOT p3) (NOT p4)) (AND p0 p1)), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (OR (AND p0 (NOT p3) (NOT p4)) (AND p0 p1)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p4)), (AND p0 p1), (OR (AND p0 (NOT p3) (NOT p4)) (AND p0 p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1)), (OR (AND p0 (NOT p3) (NOT p4)) (AND p0 p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=0 dest: 1}, { cond=(OR p3 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p4)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p4)), acceptance={} source=0 dest: 5}, { cond=(NOT p1), acceptance={} source=0 dest: 8}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=0 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 10}, { cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 12}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p3 p0 p1) (AND p0 p1 p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 10}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p3 p0 p1), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1, 2} source=2 dest: 11}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p3 p0 p1) (AND p0 p1 p4)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p3) p0 p1 (NOT p4)), acceptance={0, 1, 2} source=3 dest: 5}], [{ cond=(OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=4 dest: 1}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0, 2} source=4 dest: 2}, { cond=(OR (AND p3 p1) (AND (NOT p0) p1)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={2} source=4 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 2} source=4 dest: 4}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={1, 2} source=4 dest: 11}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1, 2} source=4 dest: 11}], [{ cond=(OR p3 (NOT p0) p4), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p4)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND (NOT p3) p0 (NOT p4)), acceptance={0, 1, 2} source=5 dest: 5}], [{ cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 12}], [{ cond=(OR (AND (NOT p0) p1) (AND p1 p4)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1 (NOT p4)), acceptance={} source=7 dest: 9}], [{ cond=p1, acceptance={} source=8 dest: 0}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=8 dest: 1}, { cond=(OR p3 (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(NOT p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p3) p1), acceptance={} source=8 dest: 11}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 12}], [{ cond=(OR p3 (NOT p0) p4), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=9 dest: 5}, { cond=p4, acceptance={} source=9 dest: 7}, { cond=(NOT p4), acceptance={} source=9 dest: 9}], [{ cond=(OR p3 (NOT p0) p2), acceptance={0, 1, 2} source=10 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={1, 2} source=10 dest: 10}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0, 1, 2} source=10 dest: 10}], [{ cond=(OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=11 dest: 1}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0, 2} source=11 dest: 2}, { cond=(OR (AND p3 p1) (AND (NOT p0) p1)), acceptance={0, 1, 2} source=11 dest: 2}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p4)), acceptance={} source=11 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={2} source=11 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 2} source=11 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p4)), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={1, 2} source=11 dest: 11}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 1, 2} source=11 dest: 11}], [{ cond=(OR p3 (NOT p0) p2), acceptance={} source=12 dest: 1}, { cond=p2, acceptance={} source=12 dest: 6}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=12 dest: 10}, { cond=(NOT p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(OR (GEQ s615 1) (GEQ s616 1) (GEQ s614 1) (GEQ s617 1) (GEQ s620 1) (GEQ s621 1) (GEQ s618 1) (GEQ s619 1) (GEQ s613 1) (GEQ s612 1)), p3:(AND (NOT (O...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 42183 reset in 1362 ms.
Product exploration explored 100000 steps with 42079 reset in 1142 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 (NOT p1) p3 (NOT p0) p2 p4), (X p2), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X p4), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND p3 p0 p1) (AND p0 p1 p4)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p4)))), (X (NOT (AND (NOT p3) p0 p1 (NOT p4)))), (X (NOT (AND (NOT p3) p0 (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p3 p0 p1))), (X (NOT (AND (NOT p3) p1))), (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p4))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (NOT (OR (AND p3 p1) (AND (NOT p0) p1)))), (X (OR p3 (NOT p0) p2)), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p3) p0 p1))), (X (OR p3 (NOT p0))), (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)))), (X (OR p3 (NOT p0) p4)), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (NOT (OR (AND p3 p0 p1) (AND p0 p1 p2)))), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p3 p0 p1) (AND p0 p1 p4))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p4))))), (X (X (NOT (AND (NOT p3) p0 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p4)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (NOT (OR (AND p3 p1) (AND (NOT p0) p1))))), (X (X (OR p3 (NOT p0) p2))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p4))))), (X (X (OR p3 (NOT p0)))), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1))))), (X (X (OR p3 (NOT p0) p4))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND p3 p0 p1) (AND p0 p1 p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 69 factoid took 54894 ms. Reduced automaton from 13 states, 65 edges and 5 AP to 13 states, 65 edges and 5 AP.
Stuttering acceptance computed with spot in 673 ms :[(OR (AND p0 (NOT p3) (NOT p4)) (AND p0 p1)), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (OR (AND p0 (NOT p3) (NOT p4)) (AND p0 p1)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p4)), (AND p0 p1), (OR (AND p0 (NOT p3) (NOT p4)) (AND p0 p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1)), (OR (AND p0 (NOT p3) (NOT p4)) (AND p0 p1)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 38) seen :26
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2022-05-18 06:04:22] [INFO ] Flow matrix only has 1242 transitions (discarded 20 similar events)
// Phase 1: matrix 1242 rows 718 cols
[2022-05-18 06:04:22] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 06:04:23] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-18 06:04:23] [INFO ] [Real]Absence check using 10 positive and 32 generalized place invariants in 32 ms returned sat
[2022-05-18 06:04:23] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:8
[2022-05-18 06:04:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-18 06:04:23] [INFO ] [Nat]Absence check using 10 positive and 32 generalized place invariants in 34 ms returned sat
[2022-05-18 06:04:23] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :0
Fused 12 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 12 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p0) p2 p4), (X p2), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X p4), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (OR (AND p3 p0 p1) (AND p0 p1 p4)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p4)))), (X (NOT (AND (NOT p3) p0 p1 (NOT p4)))), (X (NOT (AND (NOT p3) p0 (NOT p4)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p3 p0 p1))), (X (NOT (AND (NOT p3) p1))), (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p4))), (X (NOT (AND (NOT p3) p1 (NOT p2)))), (X (NOT (OR (AND p3 p1) (AND (NOT p0) p1)))), (X (OR p3 (NOT p0) p2)), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p3) p0 p1))), (X (OR p3 (NOT p0))), (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)))), (X (OR p3 (NOT p0) p4)), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (X (NOT (OR (AND p3 p0 p1) (AND p0 p1 p2)))), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p3 p0 p1) (AND p0 p1 p4))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p4))))), (X (X (NOT (AND (NOT p3) p0 (NOT p4))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p3 p0 p1)))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p4)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (NOT (OR (AND p3 p1) (AND (NOT p0) p1))))), (X (X (OR p3 (NOT p0) p2))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p4))))), (X (X (OR p3 (NOT p0)))), (X (X (OR (AND p3 (NOT p1)) (AND (NOT p0) (NOT p1))))), (X (X (OR p3 (NOT p0) p4))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND p3 p0 p1) (AND p0 p1 p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p4)))), (G (NOT (AND (NOT p0) p1 (NOT p3)))), (G (NOT (AND p1 (NOT p3)))), (G (NOT (AND p1 (NOT p3) (NOT p2)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (OR (AND p0 p1 p3) (AND p0 p1 p4)))), (G (NOT (AND p0 p1 (NOT p3)))), (G (NOT (AND p0 p1 p3))), (G (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p3) (NOT p4)))), (G (NOT (OR (AND p0 p1 p3) (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3))), (F (OR (AND (NOT p0) p1) (AND p1 p2))), (F (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p4)))), (F (AND p0 (NOT p3) (NOT p4))), (F (AND (NOT p1) (NOT p4))), (F (AND (NOT p0) (NOT p3) (NOT p4))), (F (AND (NOT p1) (NOT p3) (NOT p4))), (F p1), (F (NOT (OR p3 p4))), (F (NOT p3)), (F (OR (AND (NOT p0) p1) (AND p1 p4))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (F (NOT (OR (NOT p0) p3 p4))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p3) (NOT p2))), (F (NOT p2)), (F (NOT (OR p3 p2))), (F (AND p0 (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (OR (AND (NOT p0) p1) (AND p1 p3))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p3)))), (F (AND (NOT p0) (NOT p3) (NOT p2))), (F (NOT (OR (NOT p0) p3 p2))), (F (AND (NOT p0) p1)), (F (NOT p4)), (F (AND (NOT p3) (NOT p4)))]
Knowledge based reduction with 81 factoid took 46443 ms. Reduced automaton from 13 states, 65 edges and 5 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 227 ms :[(AND p0 (NOT p3) (NOT p4)), (AND p0 (NOT p3) (NOT p4)), false, (AND p0 (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 160 ms :[(AND p0 (NOT p3) (NOT p4)), (AND p0 (NOT p3) (NOT p4)), false, (AND p0 (NOT p3) (NOT p4))]
Support contains 35 out of 718 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 718 transition count 1212
Reduce places removed 50 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 70 rules applied. Total rules applied 120 place count 668 transition count 1192
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 140 place count 648 transition count 1192
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 140 place count 648 transition count 1112
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 300 place count 568 transition count 1112
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 310 place count 558 transition count 1102
Iterating global reduction 3 with 10 rules applied. Total rules applied 320 place count 558 transition count 1102
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 400 place count 518 transition count 1062
Applied a total of 400 rules in 148 ms. Remains 518 /718 variables (removed 200) and now considering 1062/1262 (removed 200) transitions.
[2022-05-18 06:05:10] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 518 cols
[2022-05-18 06:05:10] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 06:05:11] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
[2022-05-18 06:05:11] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 518 cols
[2022-05-18 06:05:11] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 06:05:11] [INFO ] Implicit Places using invariants in 380 ms returned []
[2022-05-18 06:05:11] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 518 cols
[2022-05-18 06:05:11] [INFO ] Computed 42 place invariants in 11 ms
[2022-05-18 06:05:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:05:16] [INFO ] Implicit Places using invariants and state equation in 4610 ms returned []
Implicit Place search using SMT with State Equation took 4994 ms to find 0 implicit places.
[2022-05-18 06:05:16] [INFO ] Redundant transitions in 68 ms returned []
[2022-05-18 06:05:16] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 518 cols
[2022-05-18 06:05:16] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:05:16] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 518/718 places, 1062/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 518/718 places, 1062/1262 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 (NOT p1) (NOT p0) p3 p4), (X p4), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p0 (NOT p3) (NOT p4)))), (X (X p4)), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p3) (NOT p4)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 690 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 493 ms :[(AND p0 (NOT p3) (NOT p4)), (AND p0 (NOT p3) (NOT p4)), false, (AND p0 (NOT p3) (NOT p4))]
Finished random walk after 45 steps, including 0 resets, run visited all 7 properties in 4 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p4), (X p4), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p4)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p0 (NOT p3) (NOT p4)))), (X (X p4)), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p0 (NOT p3) (NOT p4)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3) (NOT p4))), (F (AND (NOT p4) (NOT p1))), (F (NOT p4)), (F (AND p0 (NOT p3) (NOT p4))), (F (AND (NOT p0) p1)), (F p1), (F (AND (NOT p3) (NOT p4)))]
Knowledge based reduction with 15 factoid took 650 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND p0 (NOT p3) (NOT p4)), (AND p0 (NOT p3) (NOT p4)), false, (AND p0 (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 147 ms :[(AND p0 (NOT p3) (NOT p4)), (AND p0 (NOT p3) (NOT p4)), false, (AND p0 (NOT p3) (NOT p4))]
Stuttering acceptance computed with spot in 208 ms :[(AND p0 (NOT p3) (NOT p4)), (AND p0 (NOT p3) (NOT p4)), false, (AND p0 (NOT p3) (NOT p4))]
Product exploration explored 100000 steps with 28 reset in 504 ms.
Product exploration explored 100000 steps with 26 reset in 538 ms.
Built C files in :
/tmp/ltsmin2608965338655464823
[2022-05-18 06:05:20] [INFO ] Computing symmetric may disable matrix : 1062 transitions.
[2022-05-18 06:05:20] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:20] [INFO ] Computing symmetric may enable matrix : 1062 transitions.
[2022-05-18 06:05:20] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:20] [INFO ] Computing Do-Not-Accords matrix : 1062 transitions.
[2022-05-18 06:05:20] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:20] [INFO ] Built C files in 415ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2608965338655464823
Running compilation step : cd /tmp/ltsmin2608965338655464823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2608965338655464823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2608965338655464823;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 35 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 1062/1062 transitions.
Applied a total of 0 rules in 23 ms. Remains 518 /518 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
[2022-05-18 06:05:23] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 518 cols
[2022-05-18 06:05:23] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 06:05:24] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
[2022-05-18 06:05:24] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 518 cols
[2022-05-18 06:05:24] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:05:24] [INFO ] Implicit Places using invariants in 362 ms returned []
[2022-05-18 06:05:24] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 518 cols
[2022-05-18 06:05:24] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 06:05:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:05:29] [INFO ] Implicit Places using invariants and state equation in 5009 ms returned []
Implicit Place search using SMT with State Equation took 5374 ms to find 0 implicit places.
[2022-05-18 06:05:29] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-18 06:05:29] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 518 cols
[2022-05-18 06:05:29] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:05:30] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 518/518 places, 1062/1062 transitions.
Built C files in :
/tmp/ltsmin17003610162410673968
[2022-05-18 06:05:30] [INFO ] Computing symmetric may disable matrix : 1062 transitions.
[2022-05-18 06:05:30] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:30] [INFO ] Computing symmetric may enable matrix : 1062 transitions.
[2022-05-18 06:05:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:30] [INFO ] Computing Do-Not-Accords matrix : 1062 transitions.
[2022-05-18 06:05:30] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:05:30] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17003610162410673968
Running compilation step : cd /tmp/ltsmin17003610162410673968;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17003610162410673968;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17003610162410673968;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 06:05:33] [INFO ] Flatten gal took : 73 ms
[2022-05-18 06:05:33] [INFO ] Flatten gal took : 68 ms
[2022-05-18 06:05:33] [INFO ] Time to serialize gal into /tmp/LTL2889234929694094082.gal : 14 ms
[2022-05-18 06:05:33] [INFO ] Time to serialize properties into /tmp/LTL17320173375080348645.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2889234929694094082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17320173375080348645.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2889234...267
Read 1 LTL properties
Checking formula 0 : !(((F(((!("(((((((((cBlockedTasks_0>=10)&&(PollingAbort_0>=1))&&((Abort_Check_Sources_E_7>=1)&&(ORB_Lock_0>=1)))&&(AbourtToModifySrc_1...72683
Formula 0 simplified : !(F((!"(((((((((cBlockedTasks_0>=10)&&(PollingAbort_0>=1))&&((Abort_Check_Sources_E_7>=1)&&(ORB_Lock_0>=1)))&&(AbourtToModifySrc_1>=...72538
Detected timeout of ITS tools.
[2022-05-18 06:05:48] [INFO ] Flatten gal took : 66 ms
[2022-05-18 06:05:48] [INFO ] Applying decomposition
[2022-05-18 06:05:48] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13434432587385928865.txt' '-o' '/tmp/graph13434432587385928865.bin' '-w' '/tmp/graph13434432587385928865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13434432587385928865.bin' '-l' '-1' '-v' '-w' '/tmp/graph13434432587385928865.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:05:49] [INFO ] Decomposing Gal with order
[2022-05-18 06:05:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:05:49] [INFO ] Removed a total of 1116 redundant transitions.
[2022-05-18 06:05:49] [INFO ] Flatten gal took : 303 ms
[2022-05-18 06:05:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 518 labels/synchronizations in 42 ms.
[2022-05-18 06:05:49] [INFO ] Time to serialize gal into /tmp/LTL13189241060310051449.gal : 12 ms
[2022-05-18 06:05:49] [INFO ] Time to serialize properties into /tmp/LTL261531081303407430.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13189241060310051449.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL261531081303407430.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1318924...245
Read 1 LTL properties
Checking formula 0 : !(((F(((!("(((((((((i4.i2.u32.cBlockedTasks_0>=10)&&(i4.i2.u21.PollingAbort_0>=1))&&((i4.i2.u21.Abort_Check_Sources_E_7>=1)&&(i4.i2.u2...100863
Formula 0 simplified : !(F((!"(((((((((i4.i2.u32.cBlockedTasks_0>=10)&&(i4.i2.u21.PollingAbort_0>=1))&&((i4.i2.u21.Abort_Check_Sources_E_7>=1)&&(i4.i2.u21....100718
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12152173235833587217
[2022-05-18 06:06:04] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12152173235833587217
Running compilation step : cd /tmp/ltsmin12152173235833587217;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1823 ms.
Running link step : cd /tmp/ltsmin12152173235833587217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12152173235833587217;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ([]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))||(X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp2==true))))) U ([](<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp3==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))||([](!(LTLAPp1==true))&&<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp4==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-00 finished in 186527 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!F(p0) U p1)))'
Support contains 23 out of 718 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 718 transition count 1202
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 658 transition count 1192
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 648 transition count 1192
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 140 place count 648 transition count 1112
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 300 place count 568 transition count 1112
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 310 place count 558 transition count 1102
Iterating global reduction 3 with 10 rules applied. Total rules applied 320 place count 558 transition count 1102
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 460 place count 488 transition count 1032
Applied a total of 460 rules in 111 ms. Remains 488 /718 variables (removed 230) and now considering 1032/1262 (removed 230) transitions.
[2022-05-18 06:06:19] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:06:19] [INFO ] Computed 42 place invariants in 11 ms
[2022-05-18 06:06:20] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
[2022-05-18 06:06:20] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:06:20] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 06:06:20] [INFO ] Implicit Places using invariants in 386 ms returned []
[2022-05-18 06:06:20] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:06:20] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 06:06:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:24] [INFO ] Implicit Places using invariants and state equation in 4184 ms returned []
Implicit Place search using SMT with State Equation took 4572 ms to find 0 implicit places.
[2022-05-18 06:06:24] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-18 06:06:24] [INFO ] Flow matrix only has 1012 transitions (discarded 20 similar events)
// Phase 1: matrix 1012 rows 488 cols
[2022-05-18 06:06:25] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 06:06:25] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/718 places, 1032/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 488/718 places, 1032/1262 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), true, p0, (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s313 1) (GEQ s312 1) (GEQ s320 1) (GEQ s321 1) (GEQ s318 1) (GEQ s319 1) (GEQ s315 1) (GEQ s316 1) (GEQ s314 1) (GEQ s317 1)), p0:(OR (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-02 finished in 5773 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X((X(G(p1))||p0)))&&p2)))'
Support contains 20 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 708 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 708 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 698 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 698 transition count 1242
Applied a total of 40 rules in 44 ms. Remains 698 /718 variables (removed 20) and now considering 1242/1262 (removed 20) transitions.
[2022-05-18 06:06:25] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:25] [INFO ] Computed 42 place invariants in 23 ms
[2022-05-18 06:06:26] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
[2022-05-18 06:06:26] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:26] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:06:26] [INFO ] Implicit Places using invariants in 420 ms returned []
[2022-05-18 06:06:26] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:26] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 06:06:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:33] [INFO ] Implicit Places using invariants and state equation in 7357 ms returned []
Implicit Place search using SMT with State Equation took 7778 ms to find 0 implicit places.
[2022-05-18 06:06:33] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:33] [INFO ] Computed 42 place invariants in 56 ms
[2022-05-18 06:06:34] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 698/718 places, 1242/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 698/718 places, 1242/1262 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=p2, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 6}, { cond=(AND p2 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(OR (GEQ s83 1) (GEQ s82 1) (GEQ s85 1) (GEQ s84 1) (GEQ s87 1) (GEQ s86 1) (GEQ s89 1) (GEQ s88 1) (GEQ s91 1) (GEQ s90 1)), p0:(OR (GEQ s83 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6129 steps with 33 reset in 25 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-03 finished in 9189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(((G(p0)&&p1)||p2)))||G(X(!p1))))'
Support contains 84 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 708 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 708 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 698 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 698 transition count 1242
Applied a total of 40 rules in 33 ms. Remains 698 /718 variables (removed 20) and now considering 1242/1262 (removed 20) transitions.
[2022-05-18 06:06:34] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:34] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 06:06:35] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
[2022-05-18 06:06:35] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:35] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:06:35] [INFO ] Implicit Places using invariants in 390 ms returned []
[2022-05-18 06:06:35] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:35] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 06:06:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:42] [INFO ] Implicit Places using invariants and state equation in 6618 ms returned []
Implicit Place search using SMT with State Equation took 7009 ms to find 0 implicit places.
[2022-05-18 06:06:42] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:42] [INFO ] Computed 42 place invariants in 14 ms
[2022-05-18 06:06:42] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 698/718 places, 1242/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 698/718 places, 1242/1262 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), p1, (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 2}, { cond=(NOT p1), acceptance={} source=6 dest: 3}]], initial=5, aps=[p0:(AND (OR (LT s469 8) (LT s472 1) (LT s550 2)) (OR (LT s469 8) (LT s472 1) (LT s551 2)) (OR (LT s469 8) (LT s478 1) (LT s550 2)) (OR (LT s469 8) (LT s47...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 652 ms.
Product exploration explored 100000 steps with 33333 reset in 661 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 p1)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))))))
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 7 states, 13 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-05 finished in 9693 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0) U p1))&&X((F(p3)&&p2))))'
Support contains 74 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 708 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 708 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 698 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 698 transition count 1242
Applied a total of 40 rules in 26 ms. Remains 698 /718 variables (removed 20) and now considering 1242/1262 (removed 20) transitions.
[2022-05-18 06:06:44] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:44] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:06:44] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
[2022-05-18 06:06:44] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:45] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:06:45] [INFO ] Implicit Places using invariants in 374 ms returned []
[2022-05-18 06:06:45] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:45] [INFO ] Computed 42 place invariants in 14 ms
[2022-05-18 06:06:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:50] [INFO ] Implicit Places using invariants and state equation in 5116 ms returned []
Implicit Place search using SMT with State Equation took 5491 ms to find 0 implicit places.
[2022-05-18 06:06:50] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:50] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 06:06:50] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 698/718 places, 1242/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 698/718 places, 1242/1262 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (NOT p3) (NOT p1)), (OR (NOT p2) (NOT p3)), (NOT p1), true, (NOT p3)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s469 8) (GEQ s472 1) (GEQ s550 2)) (AND (GEQ s469 8) (GEQ s472 1) (GEQ s551 2)) (AND (GEQ s469 8) (GEQ s478 1) (GEQ s550 2)) (AND (GEQ s4...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31889 steps with 1215 reset in 155 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-09 finished in 6799 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(p0)||G(p1)))))'
Support contains 21 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 708 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 708 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 698 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 698 transition count 1242
Applied a total of 40 rules in 20 ms. Remains 698 /718 variables (removed 20) and now considering 1242/1262 (removed 20) transitions.
[2022-05-18 06:06:51] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:51] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 06:06:51] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
[2022-05-18 06:06:51] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:51] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:06:52] [INFO ] Implicit Places using invariants in 424 ms returned []
[2022-05-18 06:06:52] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:52] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 06:06:52] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:06:59] [INFO ] Implicit Places using invariants and state equation in 7437 ms returned []
Implicit Place search using SMT with State Equation took 7865 ms to find 0 implicit places.
[2022-05-18 06:06:59] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:06:59] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 06:07:00] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 698/718 places, 1242/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 698/718 places, 1242/1262 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (GEQ s420 1) (GEQ s421 1) (GEQ s418 1) (GEQ s419 1) (GEQ s416 1) (GEQ s417 1) (GEQ s414 1) (GEQ s415 1) (GEQ s412 1) (GEQ s413 1)), p0:(OR (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 32637 steps with 512 reset in 149 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-10 finished in 9226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!(G(p0) U p1)))||X(F(p2))))'
Support contains 34 out of 718 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 708 transition count 1252
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 708 transition count 1252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 698 transition count 1242
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 698 transition count 1242
Applied a total of 40 rules in 24 ms. Remains 698 /718 variables (removed 20) and now considering 1242/1262 (removed 20) transitions.
[2022-05-18 06:07:00] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:07:00] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:07:01] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
[2022-05-18 06:07:01] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:07:01] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 06:07:02] [INFO ] Implicit Places using invariants in 452 ms returned []
[2022-05-18 06:07:02] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:07:02] [INFO ] Computed 42 place invariants in 14 ms
[2022-05-18 06:07:02] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:07:09] [INFO ] Implicit Places using invariants and state equation in 7519 ms returned []
Implicit Place search using SMT with State Equation took 7975 ms to find 0 implicit places.
[2022-05-18 06:07:09] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 698 cols
[2022-05-18 06:07:09] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:07:10] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 698/718 places, 1242/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 698/718 places, 1242/1262 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (AND (NOT p2) p0), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p0 p1)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (GEQ s573 1) (GEQ s572 1) (GEQ s575 1) (GEQ s574 1) (GEQ s577 1) (GEQ s576 1) (GEQ s579 1) (GEQ s578 1) (GEQ s581 1) (GEQ s580 1)), p0:(OR (AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 546 ms.
Product exploration explored 100000 steps with 33333 reset in 528 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p2) p1))))
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 6 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-14 finished in 10924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 51 out of 718 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 718/718 places, 1262/1262 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 718 transition count 1172
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 628 transition count 1172
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 180 place count 628 transition count 1092
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 340 place count 548 transition count 1092
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 350 place count 538 transition count 1082
Iterating global reduction 2 with 10 rules applied. Total rules applied 360 place count 538 transition count 1082
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 520 place count 458 transition count 1002
Applied a total of 520 rules in 58 ms. Remains 458 /718 variables (removed 260) and now considering 1002/1262 (removed 260) transitions.
[2022-05-18 06:07:11] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:07:11] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 06:07:11] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
[2022-05-18 06:07:11] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:07:11] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 06:07:12] [INFO ] Implicit Places using invariants in 373 ms returned []
[2022-05-18 06:07:12] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:07:12] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 06:07:12] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 06:07:16] [INFO ] Implicit Places using invariants and state equation in 4241 ms returned []
Implicit Place search using SMT with State Equation took 4623 ms to find 0 implicit places.
[2022-05-18 06:07:16] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-18 06:07:16] [INFO ] Flow matrix only has 982 transitions (discarded 20 similar events)
// Phase 1: matrix 982 rows 458 cols
[2022-05-18 06:07:16] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 06:07:16] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 458/718 places, 1002/1262 transitions.
Finished structural reductions, in 1 iterations. Remains : 458/718 places, 1002/1262 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J04T10-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:(OR (AND (GEQ s80 1) (GEQ s176 1)) (AND (GEQ s90 1) (GEQ s176 1)) (AND (GEQ s109 1) (GEQ s176 1)) (AND (GEQ s99 1) (GEQ s176 1)) (AND (GEQ s120 1) (GEQ...], 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 386 steps with 0 reset in 7 ms.
FORMULA PolyORBLF-COL-S02J04T10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J04T10-LTLFireability-15 finished in 5612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(((!p0&&X((!p0 U (!p1||G(!p0))))) U (G((!p0&&X((!p0 U (!p1||G(!p0))))))||(X((!p0 U (!p1||G(!p0))))&&p2)))) U (G(F(((!p0&&X((!p0 U (!p1||G(!p0))))) U ((X((!p0 U (!p1||G(!p0))))&&p3)||G((!p0&&X((!p0 U (!p1||G(!p0))))))))))||(G(!p1)&&F(((!p0&&X((!p0 U (!p1||G(!p0))))) U ((X((!p0 U (!p1||G(!p0))))&&p4)||G((!p0&&X((!p0 U (!p1||G(!p0)))))))))))))'
Warning : SL/CL computation failed.
[2022-05-18 06:07:27] [INFO ] Flatten gal took : 64 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin379292709267199107
[2022-05-18 06:07:27] [INFO ] Computing symmetric may disable matrix : 1262 transitions.
[2022-05-18 06:07:27] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:07:27] [INFO ] Computing symmetric may enable matrix : 1262 transitions.
[2022-05-18 06:07:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:07:27] [INFO ] Applying decomposition
[2022-05-18 06:07:27] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1600862226143370671.txt' '-o' '/tmp/graph1600862226143370671.bin' '-w' '/tmp/graph1600862226143370671.weights'
[2022-05-18 06:07:27] [INFO ] Computing Do-Not-Accords matrix : 1262 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1600862226143370671.bin' '-l' '-1' '-v' '-w' '/tmp/graph1600862226143370671.weights' '-q' '0' '-e' '0.001'
[2022-05-18 06:07:27] [INFO ] Decomposing Gal with order
[2022-05-18 06:07:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:07:27] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 06:07:27] [INFO ] Built C files in 296ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin379292709267199107
Running compilation step : cd /tmp/ltsmin379292709267199107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 06:07:27] [INFO ] Removed a total of 1277 redundant transitions.
[2022-05-18 06:07:27] [INFO ] Flatten gal took : 133 ms
[2022-05-18 06:07:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 214 labels/synchronizations in 23 ms.
[2022-05-18 06:07:27] [INFO ] Time to serialize gal into /tmp/LTLFireability18123666248359482875.gal : 9 ms
[2022-05-18 06:07:27] [INFO ] Time to serialize properties into /tmp/LTLFireability9025882026878952754.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18123666248359482875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9025882026878952754.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((F(((!("(((((((((i21.u28.cBlockedTasks_0>=10)&&(i21.u28.PollingAbort_0>=1))&&((i21.u28.Abort_Check_Sources_E_7>=1)&&(i21.u28.ORB_Lo...95800
Formula 0 simplified : !(F((!"(((((((((i21.u28.cBlockedTasks_0>=10)&&(i21.u28.PollingAbort_0>=1))&&((i21.u28.Abort_Check_Sources_E_7>=1)&&(i21.u28.ORB_Lock...95655
Compilation finished in 4450 ms.
Running link step : cd /tmp/ltsmin379292709267199107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin379292709267199107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ([]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))||(X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp2==true))))) U ([](<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp3==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))||([](!(LTLAPp1==true))&&<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp4==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.077: LTL layer: formula: (<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ([]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))||(X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp2==true))))) U ([](<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp3==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))||([](!(LTLAPp1==true))&&<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp4==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))))
pins2lts-mc-linux64( 3/ 8), 0.077: "(<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ([]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))||(X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp2==true))))) U ([](<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp3==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))||([](!(LTLAPp1==true))&&<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp4==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.077: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.095: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.105: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.116: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.246: There are 1268 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.246: State length is 719, there are 1379 groups
pins2lts-mc-linux64( 0/ 8), 0.246: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.246: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.246: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.246: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.312: [Blue] ~47 levels ~960 states ~1976 transitions
pins2lts-mc-linux64( 0/ 8), 0.366: [Blue] ~93 levels ~1920 states ~4120 transitions
pins2lts-mc-linux64( 0/ 8), 0.501: [Blue] ~178 levels ~3840 states ~8280 transitions
pins2lts-mc-linux64( 0/ 8), 0.684: [Blue] ~344 levels ~7680 states ~16696 transitions
pins2lts-mc-linux64( 0/ 8), 1.101: [Blue] ~692 levels ~15360 states ~34056 transitions
pins2lts-mc-linux64( 0/ 8), 1.872: [Blue] ~1401 levels ~30720 states ~71280 transitions
pins2lts-mc-linux64( 5/ 8), 3.301: [Blue] ~2745 levels ~61440 states ~131208 transitions
pins2lts-mc-linux64( 5/ 8), 5.927: [Blue] ~5423 levels ~122880 states ~264048 transitions
pins2lts-mc-linux64( 6/ 8), 11.057: [Blue] ~11171 levels ~245760 states ~504608 transitions
pins2lts-mc-linux64( 0/ 8), 20.809: [Blue] ~21120 levels ~491520 states ~1103872 transitions
pins2lts-mc-linux64( 0/ 8), 39.358: [Blue] ~42566 levels ~983040 states ~2211760 transitions
pins2lts-mc-linux64( 2/ 8), 81.113: [Blue] ~62092 levels ~1966080 states ~4072816 transitions
pins2lts-mc-linux64( 2/ 8), 181.212: [Blue] ~129753 levels ~3932160 states ~8360208 transitions
pins2lts-mc-linux64( 2/ 8), 332.099: [Blue] ~273617 levels ~7864320 states ~17312792 transitions
pins2lts-mc-linux64( 2/ 8), 631.152: [Blue] ~542848 levels ~15728640 states ~35222488 transitions
pins2lts-mc-linux64( 6/ 8), 851.557: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 851.987:
pins2lts-mc-linux64( 0/ 8), 851.987: Explored 20187273 states 47830342 transitions, fanout: 2.369
pins2lts-mc-linux64( 0/ 8), 851.987: Total exploration time 851.720 sec (851.310 sec minimum, 851.477 sec on average)
pins2lts-mc-linux64( 0/ 8), 851.987: States per second: 23702, Transitions per second: 56157
pins2lts-mc-linux64( 0/ 8), 851.987:
pins2lts-mc-linux64( 0/ 8), 851.987: State space has 27133000 states, 11720766 are accepting
pins2lts-mc-linux64( 0/ 8), 851.987: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 851.987: blue states: 20187273 (74.40%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 851.987: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 851.987: all-red states: 12114854 (44.65%), bogus 1 (0.00%)
pins2lts-mc-linux64( 0/ 8), 851.987:
pins2lts-mc-linux64( 0/ 8), 851.987: Total memory used for local state coloring: 98.7MB
pins2lts-mc-linux64( 0/ 8), 851.987:
pins2lts-mc-linux64( 0/ 8), 851.987: Queue width: 8B, total height: 6470107, memory: 49.36MB
pins2lts-mc-linux64( 0/ 8), 851.987: Tree memory: 463.0MB, 17.9 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 851.987: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 851.987: Stored 1494 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 851.987: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 851.987: Est. total memory use: 512.4MB (~1073.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin379292709267199107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ([]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))||(X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp2==true))))) U ([](<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp3==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))||([](!(LTLAPp1==true))&&<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp4==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin379292709267199107;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ([]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))||(X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp2==true))))) U ([](<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp3==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))||([](!(LTLAPp1==true))&&<>(((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))) U ((X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))&&(LTLAPp4==true))||[]((!(LTLAPp0==true)&&X((!(LTLAPp0==true) U (!(LTLAPp1==true)||[](!(LTLAPp0==true)))))))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-18 06:28:56] [INFO ] Applying decomposition
[2022-05-18 06:28:56] [INFO ] Flatten gal took : 61 ms
[2022-05-18 06:28:56] [INFO ] Decomposing Gal with order
[2022-05-18 06:28:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 06:28:56] [INFO ] Removed a total of 3219 redundant transitions.
[2022-05-18 06:28:56] [INFO ] Flatten gal took : 118 ms
[2022-05-18 06:28:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 19 ms.
[2022-05-18 06:28:56] [INFO ] Time to serialize gal into /tmp/LTLFireability17954967839958672500.gal : 11 ms
[2022-05-18 06:28:56] [INFO ] Time to serialize properties into /tmp/LTLFireability5281514631428534019.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17954967839958672500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5281514631428534019.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((F(((!("(((((((((cBlockedTasks.cBlockedTasks_0>=10)&&(PollingAbort.PollingAbort_0>=1))&&((Threads7.Abort_Check_Sources_E_7>=1)&&(OR...103013
Formula 0 simplified : !(F((!"(((((((((cBlockedTasks.cBlockedTasks_0>=10)&&(PollingAbort.PollingAbort_0>=1))&&((Threads7.Abort_Check_Sources_E_7>=1)&&(ORB_...102868
Reverse transition relation is NOT exact ! Due to transitions t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48...1871
Computing Next relation with stutter on 2700 deadlock states
Detected timeout of ITS tools.
[2022-05-18 06:50:26] [INFO ] Flatten gal took : 450 ms
[2022-05-18 06:50:38] [INFO ] Input system was already deterministic with 1262 transitions.
[2022-05-18 06:50:38] [INFO ] Transformed 718 places.
[2022-05-18 06:50:38] [INFO ] Transformed 1262 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 06:51:08] [INFO ] Time to serialize gal into /tmp/LTLFireability7068231485488628840.gal : 8 ms
[2022-05-18 06:51:08] [INFO ] Time to serialize properties into /tmp/LTLFireability6407225309194018596.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7068231485488628840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6407225309194018596.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(((!("(((((((((cBlockedTasks_0>=10)&&(PollingAbort_0>=1))&&((Abort_Check_Sources_E_7>=1)&&(ORB_Lock_0>=1)))&&(AbourtToModifySrc_1...72683
Formula 0 simplified : !(F((!"(((((((((cBlockedTasks_0>=10)&&(PollingAbort_0>=1))&&((Abort_Check_Sources_E_7>=1)&&(ORB_Lock_0>=1)))&&(AbourtToModifySrc_1>=...72538

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S02J04T10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J04T10, 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 r168-tall-165277016700460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T10.tgz
mv PolyORBLF-COL-S02J04T10 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 ;