About the Execution of LTSMin+red for PolyORBLF-COL-S02J06T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1811.531 | 679109.00 | 1603585.00 | 1541.30 | ?FFFFT?F???F?FFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950400380.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBLF-COL-S02J06T08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950400380
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 8.9K Feb 26 14:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 14:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 154K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679509323273
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J06T08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 18:22:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 18:22:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:22:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 18:22:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 18:22:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 825 ms
[2023-03-22 18:22:06] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 690 PT places and 1492.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 18:22:06] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2023-03-22 18:22:06] [INFO ] Skeletonized 15 HLPN properties in 2 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 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 199 ms. (steps per millisecond=50 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 18:22:06] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2023-03-22 18:22:06] [INFO ] Computed 26 place invariants in 13 ms
[2023-03-22 18:22:06] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-22 18:22:06] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-22 18:22:07] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-22 18:22:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 18:22:07] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-22 18:22:07] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-22 18:22:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-22 18:22:07] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 3 ms returned sat
[2023-03-22 18:22:07] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 18:22:07] [INFO ] After 56ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-22 18:22:07] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 18:22:07] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 1 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 24 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
[2023-03-22 18:22:07] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2023-03-22 18:22:07] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-22 18:22:07] [INFO ] Dead Transitions using invariants and state equation in 59 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 REACHABILITY 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.1 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 REACHABILITY mode , in 2 iterations and 87 ms. 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 2 atomic propositions for a total of 11 simplifications.
[2023-03-22 18:22:07] [INFO ] Flatten gal took : 32 ms
[2023-03-22 18:22:07] [INFO ] Flatten gal took : 9 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
[2023-03-22 18:22:07] [INFO ] Unfolded HLPN to a Petri net with 690 places and 1434 transitions 6564 arcs in 34 ms.
[2023-03-22 18:22:07] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 405 out of 690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 682 transition count 1298
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 682 transition count 1298
Applied a total of 16 rules in 49 ms. Remains 682 /690 variables (removed 8) and now considering 1298/1306 (removed 8) transitions.
[2023-03-22 18:22:07] [INFO ] Flow matrix only has 1282 transitions (discarded 16 similar events)
// Phase 1: matrix 1282 rows 682 cols
[2023-03-22 18:22:07] [INFO ] Computed 54 place invariants in 62 ms
[2023-03-22 18:22:08] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 88 transitions.
Found 88 dead transitions using SMT.
Drop transitions removed 88 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 88 transitions.
[2023-03-22 18:22:08] [INFO ] Flow matrix only has 1194 transitions (discarded 16 similar events)
// Phase 1: matrix 1194 rows 682 cols
[2023-03-22 18:22:08] [INFO ] Computed 54 place invariants in 37 ms
[2023-03-22 18:22:08] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-22 18:22:08] [INFO ] Flow matrix only has 1194 transitions (discarded 16 similar events)
[2023-03-22 18:22:08] [INFO ] Invariant cache hit.
[2023-03-22 18:22:09] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:22:12] [INFO ] Implicit Places using invariants and state equation in 3964 ms returned []
Implicit Place search using SMT with State Equation took 4296 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 682/690 places, 1210/1306 transitions.
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 680 transition count 1194
Reduce places removed 8 places and 16 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 10 place count 672 transition count 1178
Deduced a syphon composed of 8 places in 2 ms
Applied a total of 10 rules in 22 ms. Remains 672 /682 variables (removed 10) and now considering 1178/1210 (removed 32) transitions.
[2023-03-22 18:22:12] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
// Phase 1: matrix 1162 rows 672 cols
[2023-03-22 18:22:12] [INFO ] Computed 62 place invariants in 37 ms
[2023-03-22 18:22:13] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-22 18:22:13] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
[2023-03-22 18:22:13] [INFO ] Invariant cache hit.
[2023-03-22 18:22:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:22:16] [INFO ] Implicit Places using invariants and state equation in 3039 ms returned []
Implicit Place search using SMT with State Equation took 3331 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 672/690 places, 1178/1306 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8521 ms. Remains : 672/690 places, 1178/1306 transitions.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Support contains 397 out of 664 places after structural reductions.
[2023-03-22 18:22:16] [INFO ] Flatten gal took : 120 ms
[2023-03-22 18:22:16] [INFO ] Flatten gal took : 93 ms
[2023-03-22 18:22:16] [INFO ] Input system was already deterministic with 1178 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:22:16] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
// Phase 1: matrix 1162 rows 664 cols
[2023-03-22 18:22:16] [INFO ] Computed 54 place invariants in 23 ms
[2023-03-22 18:22:16] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-22 18:22:16] [INFO ] [Real]Absence check using 14 positive and 40 generalized place invariants in 31 ms returned sat
[2023-03-22 18:22:17] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F((p1||G(p2))))||p0))))'
Support contains 14 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 656 transition count 1170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 656 transition count 1170
Applied a total of 16 rules in 55 ms. Remains 656 /664 variables (removed 8) and now considering 1170/1178 (removed 8) transitions.
[2023-03-22 18:22:17] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 656 cols
[2023-03-22 18:22:17] [INFO ] Computed 54 place invariants in 23 ms
[2023-03-22 18:22:18] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
[2023-03-22 18:22:18] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:18] [INFO ] Invariant cache hit.
[2023-03-22 18:22:18] [INFO ] Implicit Places using invariants in 523 ms returned [514, 515, 516, 517, 518, 519, 520, 521]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 526 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 648/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 17 ms. Remains 648 /648 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1226 ms. Remains : 648/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (AND (GEQ s337 1) (GEQ s338 1) (GEQ s357 1) (GEQ s447 1)) (AND (GEQ s337 1) (GEQ s339 1) (GEQ s358 1) (GEQ s447 1))), p2:(AND (LT s534 1) (LT s535 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 206 reset in 451 ms.
Product exploration explored 100000 steps with 180 reset in 359 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 p2 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:22:20] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 648 cols
[2023-03-22 18:22:20] [INFO ] Computed 46 place invariants in 20 ms
[2023-03-22 18:22:20] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2)) p0))), (F (NOT (AND (NOT p1) p2 p0))), (F (OR (AND p1 p0) (AND (NOT p2) p0))), (F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 383 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 231 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Support contains 14 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1170/1170 transitions.
Applied a total of 0 rules in 18 ms. Remains 648 /648 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-22 18:22:21] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:21] [INFO ] Invariant cache hit.
[2023-03-22 18:22:22] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
[2023-03-22 18:22:22] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:22] [INFO ] Invariant cache hit.
[2023-03-22 18:22:22] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-22 18:22:22] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:22] [INFO ] Invariant cache hit.
[2023-03-22 18:22:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:22:29] [INFO ] Implicit Places using invariants and state equation in 6448 ms returned []
Implicit Place search using SMT with State Equation took 6915 ms to find 0 implicit places.
[2023-03-22 18:22:29] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:29] [INFO ] Invariant cache hit.
[2023-03-22 18:22:29] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8086 ms. Remains : 648/648 places, 1170/1170 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) p2 p0), (X (AND p0 (NOT p1) p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 472 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 18:22:30] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:30] [INFO ] Invariant cache hit.
[2023-03-22 18:22:30] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (AND p0 (NOT p1) p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR p1 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT p0))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND (NOT p1) p2 p0))), (F (OR (AND p1 p0) (AND (NOT p2) p0))), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 662 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 223 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 235 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Product exploration explored 100000 steps with 268 reset in 293 ms.
Product exploration explored 100000 steps with 231 reset in 309 ms.
Applying partial POR strategy [true, true, true, false, false, true]
Stuttering acceptance computed with spot in 240 ms :[false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), false, false]
Support contains 14 out of 648 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 648/648 places, 1170/1170 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 648 transition count 1170
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 32 place count 648 transition count 1258
Deduced a syphon composed of 120 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 120 place count 648 transition count 1258
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 136 place count 632 transition count 1242
Deduced a syphon composed of 104 places in 5 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 152 place count 632 transition count 1242
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 136 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 184 place count 632 transition count 1242
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 208 place count 608 transition count 1218
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 232 place count 608 transition count 1218
Deduced a syphon composed of 120 places in 1 ms
Applied a total of 232 rules in 154 ms. Remains 608 /648 variables (removed 40) and now considering 1218/1170 (removed -48) transitions.
[2023-03-22 18:22:33] [INFO ] Flow matrix only has 1202 transitions (discarded 16 similar events)
// Phase 1: matrix 1202 rows 608 cols
[2023-03-22 18:22:33] [INFO ] Computed 46 place invariants in 18 ms
[2023-03-22 18:22:33] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
[2023-03-22 18:22:33] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-22 18:22:33] [INFO ] Flow matrix only has 1202 transitions (discarded 16 similar events)
[2023-03-22 18:22:33] [INFO ] Invariant cache hit.
[2023-03-22 18:22:34] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 608/648 places, 1218/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1491 ms. Remains : 608/648 places, 1218/1170 transitions.
Support contains 14 out of 648 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 648/648 places, 1170/1170 transitions.
Applied a total of 0 rules in 17 ms. Remains 648 /648 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-22 18:22:34] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 648 cols
[2023-03-22 18:22:34] [INFO ] Computed 46 place invariants in 19 ms
[2023-03-22 18:22:34] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
[2023-03-22 18:22:34] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:34] [INFO ] Invariant cache hit.
[2023-03-22 18:22:35] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-22 18:22:35] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:35] [INFO ] Invariant cache hit.
[2023-03-22 18:22:35] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:22:42] [INFO ] Implicit Places using invariants and state equation in 6947 ms returned []
Implicit Place search using SMT with State Equation took 7422 ms to find 0 implicit places.
[2023-03-22 18:22:42] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:42] [INFO ] Invariant cache hit.
[2023-03-22 18:22:42] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8598 ms. Remains : 648/648 places, 1170/1170 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-00 finished in 25712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 19 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 662 transition count 1130
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 614 transition count 1122
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 606 transition count 1122
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 112 place count 606 transition count 1042
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 272 place count 526 transition count 1042
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 384 place count 470 transition count 986
Applied a total of 384 rules in 65 ms. Remains 470 /664 variables (removed 194) and now considering 986/1178 (removed 192) transitions.
[2023-03-22 18:22:43] [INFO ] Flow matrix only has 970 transitions (discarded 16 similar events)
// Phase 1: matrix 970 rows 470 cols
[2023-03-22 18:22:43] [INFO ] Computed 52 place invariants in 13 ms
[2023-03-22 18:22:43] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
[2023-03-22 18:22:43] [INFO ] Flow matrix only has 970 transitions (discarded 16 similar events)
[2023-03-22 18:22:43] [INFO ] Invariant cache hit.
[2023-03-22 18:22:44] [INFO ] Implicit Places using invariants in 433 ms returned [416, 417, 418, 419, 420, 421, 422, 423]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 435 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 462/664 places, 986/1178 transitions.
Applied a total of 0 rules in 21 ms. Remains 462 /462 variables (removed 0) and now considering 986/986 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1018 ms. Remains : 462/664 places, 986/1178 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s285 1) (LT s433 1)) (OR (LT s286 1) (LT s433 1)) (OR (LT s281 1) (LT s433 1)) (OR (LT s284 1) (LT s433 1)) (OR (LT s283 1) (LT s433 1)) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 29 reset in 602 ms.
Stack based approach found an accepted trace after 1098 steps with 1 reset with depth 702 and stack size 702 in 7 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-01 finished in 1690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 662 transition count 1122
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 606 transition count 1122
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 606 transition count 1042
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 272 place count 526 transition count 1042
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 416 place count 454 transition count 970
Applied a total of 416 rules in 53 ms. Remains 454 /664 variables (removed 210) and now considering 970/1178 (removed 208) transitions.
[2023-03-22 18:22:44] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
// Phase 1: matrix 954 rows 454 cols
[2023-03-22 18:22:44] [INFO ] Computed 52 place invariants in 15 ms
[2023-03-22 18:22:45] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
[2023-03-22 18:22:45] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:22:45] [INFO ] Invariant cache hit.
[2023-03-22 18:22:45] [INFO ] Implicit Places using invariants in 387 ms returned [408, 409, 410, 411, 412, 413, 414, 415]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 389 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 446/664 places, 970/1178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 438 transition count 962
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 438 transition count 962
Applied a total of 16 rules in 29 ms. Remains 438 /446 variables (removed 8) and now considering 962/970 (removed 8) transitions.
[2023-03-22 18:22:45] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
// Phase 1: matrix 946 rows 438 cols
[2023-03-22 18:22:45] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-22 18:22:46] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-22 18:22:46] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-22 18:22:46] [INFO ] Invariant cache hit.
[2023-03-22 18:22:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:22:50] [INFO ] Implicit Places using invariants and state equation in 3865 ms returned []
Implicit Place search using SMT with State Equation took 4256 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 438/664 places, 962/1178 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5235 ms. Remains : 438/664 places, 962/1178 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s185 1) (LT s248 1) (LT s251 1)) (OR (LT s185 1) (LT s248 1) (LT s253 1)) (OR (LT s190 1) (LT s248 1) (LT s252 1)) (OR (LT s190 1) (LT s24...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 52 reset in 811 ms.
Stack based approach found an accepted trace after 714 steps with 1 reset with depth 363 and stack size 363 in 7 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-02 finished in 6115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 27 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 662 transition count 1122
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 606 transition count 1122
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 112 place count 606 transition count 1058
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 240 place count 542 transition count 1058
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 368 place count 478 transition count 994
Applied a total of 368 rules in 41 ms. Remains 478 /664 variables (removed 186) and now considering 994/1178 (removed 184) transitions.
[2023-03-22 18:22:50] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
// Phase 1: matrix 978 rows 478 cols
[2023-03-22 18:22:50] [INFO ] Computed 52 place invariants in 16 ms
[2023-03-22 18:22:51] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
[2023-03-22 18:22:51] [INFO ] Flow matrix only has 978 transitions (discarded 16 similar events)
[2023-03-22 18:22:51] [INFO ] Invariant cache hit.
[2023-03-22 18:22:51] [INFO ] Implicit Places using invariants in 394 ms returned [424, 425, 426, 427, 428, 429, 430, 431]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 396 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 470/664 places, 994/1178 transitions.
Applied a total of 0 rules in 14 ms. Remains 470 /470 variables (removed 0) and now considering 994/994 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 944 ms. Remains : 470/664 places, 994/1178 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s172 1) (GEQ s173 1) (GEQ s174 1)) (AND (GEQ s172 1) (GEQ s173 1) (GEQ s182 1)) (AND (GEQ s172 1) (GEQ s173 1) (GEQ s181 1)) (AND (GEQ s1...], 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 432 steps with 0 reset in 5 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-03 finished in 1001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(G(p1)) U (p2&&X(G(p1)))))||p0)))'
Support contains 17 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 20 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-22 18:22:51] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-22 18:22:51] [INFO ] Computed 52 place invariants in 15 ms
[2023-03-22 18:22:52] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
[2023-03-22 18:22:52] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:52] [INFO ] Invariant cache hit.
[2023-03-22 18:22:53] [INFO ] Implicit Places using invariants in 525 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 527 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 7 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1160 ms. Remains : 646/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s351 1) (GEQ s357 1)) (AND (GEQ s346 1) (GEQ s357 1)) (AND (GEQ s347 1) (GEQ s357 1)) (AND (GEQ s349 1) (GEQ s357 1)) (AND (GEQ s348 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-04 finished in 1368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((p0&&F(p1)))))'
Support contains 24 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 23 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-22 18:22:53] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:53] [INFO ] Invariant cache hit.
[2023-03-22 18:22:53] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
[2023-03-22 18:22:53] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:22:53] [INFO ] Invariant cache hit.
[2023-03-22 18:22:54] [INFO ] Implicit Places using invariants in 492 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 494 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 6 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1073 ms. Remains : 646/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (GEQ s199 1) (GEQ s198 1) (GEQ s203 1) (GEQ s202 1) (GEQ s201 1) (GEQ s200 1) (GEQ s207 1) (GEQ s206 1) (GEQ s205 1) (GEQ s204 1) (GEQ s211 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1687 reset in 343 ms.
Product exploration explored 100000 steps with 1680 reset in 380 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 261 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 54 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-22 18:22:56] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 646 cols
[2023-03-22 18:22:56] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-22 18:22:56] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-22 18:22:56] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 83 ms returned sat
[2023-03-22 18:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:22:57] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2023-03-22 18:22:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:22:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-22 18:22:58] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 49 ms returned sat
[2023-03-22 18:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:23:00] [INFO ] [Nat]Absence check using state equation in 1584 ms returned sat
[2023-03-22 18:23:00] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:23:00] [INFO ] [Nat]Added 96 Read/Feed constraints in 183 ms returned sat
[2023-03-22 18:23:00] [INFO ] Deduced a trap composed of 121 places in 276 ms of which 1 ms to minimize.
[2023-03-22 18:23:00] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 1 ms to minimize.
[2023-03-22 18:23:01] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 0 ms to minimize.
[2023-03-22 18:23:01] [INFO ] Deduced a trap composed of 70 places in 147 ms of which 1 ms to minimize.
[2023-03-22 18:23:01] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 1 ms to minimize.
[2023-03-22 18:23:01] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 0 ms to minimize.
[2023-03-22 18:23:01] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 0 ms to minimize.
[2023-03-22 18:23:01] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 0 ms to minimize.
[2023-03-22 18:23:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1677 ms
[2023-03-22 18:23:02] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 92 ms.
[2023-03-22 18:23:13] [INFO ] Deduced a trap composed of 347 places in 330 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 18:23:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
[2023-03-22 18:23:13] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:23:13] [INFO ] Invariant cache hit.
[2023-03-22 18:23:13] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:23:13] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 101 ms returned sat
[2023-03-22 18:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:23:15] [INFO ] [Real]Absence check using state equation in 1209 ms returned sat
[2023-03-22 18:23:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:23:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-22 18:23:15] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 64 ms returned sat
[2023-03-22 18:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:23:17] [INFO ] [Nat]Absence check using state equation in 1685 ms returned sat
[2023-03-22 18:23:17] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:23:17] [INFO ] [Nat]Added 96 Read/Feed constraints in 275 ms returned sat
[2023-03-22 18:23:18] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 1 ms to minimize.
[2023-03-22 18:23:18] [INFO ] Deduced a trap composed of 316 places in 280 ms of which 1 ms to minimize.
[2023-03-22 18:23:18] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 0 ms to minimize.
[2023-03-22 18:23:18] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 1 ms to minimize.
[2023-03-22 18:23:19] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2023-03-22 18:23:19] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 0 ms to minimize.
[2023-03-22 18:23:19] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2023-03-22 18:23:19] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2023-03-22 18:23:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2034 ms
[2023-03-22 18:23:19] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 79 ms.
[2023-03-22 18:23:28] [INFO ] Added : 508 causal constraints over 102 iterations in 9054 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Applied a total of 0 rules in 10 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-22 18:23:28] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:23:28] [INFO ] Invariant cache hit.
[2023-03-22 18:23:29] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
[2023-03-22 18:23:29] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:23:29] [INFO ] Invariant cache hit.
[2023-03-22 18:23:29] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-22 18:23:29] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:23:29] [INFO ] Invariant cache hit.
[2023-03-22 18:23:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:23:36] [INFO ] Implicit Places using invariants and state equation in 6121 ms returned []
Implicit Place search using SMT with State Equation took 6605 ms to find 0 implicit places.
[2023-03-22 18:23:36] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:23:36] [INFO ] Invariant cache hit.
[2023-03-22 18:23:36] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7805 ms. Remains : 646/646 places, 1170/1170 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)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 189 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 61 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-22 18:23:37] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:23:37] [INFO ] Invariant cache hit.
[2023-03-22 18:23:38] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:23:38] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 90 ms returned sat
[2023-03-22 18:23:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:23:39] [INFO ] [Real]Absence check using state equation in 963 ms returned sat
[2023-03-22 18:23:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:23:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:23:39] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 66 ms returned sat
[2023-03-22 18:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:23:41] [INFO ] [Nat]Absence check using state equation in 1477 ms returned sat
[2023-03-22 18:23:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:23:41] [INFO ] [Nat]Added 96 Read/Feed constraints in 191 ms returned sat
[2023-03-22 18:23:41] [INFO ] Deduced a trap composed of 70 places in 242 ms of which 1 ms to minimize.
[2023-03-22 18:23:42] [INFO ] Deduced a trap composed of 70 places in 234 ms of which 1 ms to minimize.
[2023-03-22 18:23:42] [INFO ] Deduced a trap composed of 70 places in 235 ms of which 1 ms to minimize.
[2023-03-22 18:23:42] [INFO ] Deduced a trap composed of 147 places in 240 ms of which 1 ms to minimize.
[2023-03-22 18:23:42] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2023-03-22 18:23:42] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2023-03-22 18:23:43] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 0 ms to minimize.
[2023-03-22 18:23:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1732 ms
[2023-03-22 18:23:43] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 78 ms.
[2023-03-22 18:23:54] [INFO ] Deduced a trap composed of 347 places in 317 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 18:23:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
[2023-03-22 18:23:54] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:23:54] [INFO ] Invariant cache hit.
[2023-03-22 18:23:55] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:23:55] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 100 ms returned sat
[2023-03-22 18:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:23:56] [INFO ] [Real]Absence check using state equation in 1177 ms returned sat
[2023-03-22 18:23:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:23:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:23:56] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 62 ms returned sat
[2023-03-22 18:23:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:23:58] [INFO ] [Nat]Absence check using state equation in 1640 ms returned sat
[2023-03-22 18:23:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:23:58] [INFO ] [Nat]Added 96 Read/Feed constraints in 274 ms returned sat
[2023-03-22 18:23:59] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 0 ms to minimize.
[2023-03-22 18:23:59] [INFO ] Deduced a trap composed of 316 places in 273 ms of which 1 ms to minimize.
[2023-03-22 18:23:59] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 0 ms to minimize.
[2023-03-22 18:24:00] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2023-03-22 18:24:00] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2023-03-22 18:24:00] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 0 ms to minimize.
[2023-03-22 18:24:00] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2023-03-22 18:24:00] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 1 ms to minimize.
[2023-03-22 18:24:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1965 ms
[2023-03-22 18:24:00] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 71 ms.
[2023-03-22 18:24:09] [INFO ] Added : 508 causal constraints over 102 iterations in 9071 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1689 reset in 353 ms.
Product exploration explored 100000 steps with 1684 reset in 400 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 646 transition count 1170
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 40 place count 646 transition count 1258
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 128 place count 646 transition count 1258
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 168 place count 646 transition count 1258
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 192 place count 622 transition count 1234
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 216 place count 622 transition count 1234
Deduced a syphon composed of 152 places in 1 ms
Applied a total of 216 rules in 72 ms. Remains 622 /646 variables (removed 24) and now considering 1234/1170 (removed -64) transitions.
[2023-03-22 18:24:11] [INFO ] Flow matrix only has 1218 transitions (discarded 16 similar events)
// Phase 1: matrix 1218 rows 622 cols
[2023-03-22 18:24:11] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-22 18:24:11] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
[2023-03-22 18:24:11] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-22 18:24:11] [INFO ] Flow matrix only has 1218 transitions (discarded 16 similar events)
[2023-03-22 18:24:11] [INFO ] Invariant cache hit.
[2023-03-22 18:24:12] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 622/646 places, 1234/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1439 ms. Remains : 622/646 places, 1234/1170 transitions.
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Applied a total of 0 rules in 11 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-22 18:24:12] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 646 cols
[2023-03-22 18:24:12] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-22 18:24:13] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
[2023-03-22 18:24:13] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:24:13] [INFO ] Invariant cache hit.
[2023-03-22 18:24:13] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-22 18:24:13] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:24:13] [INFO ] Invariant cache hit.
[2023-03-22 18:24:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:24:19] [INFO ] Implicit Places using invariants and state equation in 6390 ms returned []
Implicit Place search using SMT with State Equation took 6844 ms to find 0 implicit places.
[2023-03-22 18:24:19] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:24:19] [INFO ] Invariant cache hit.
[2023-03-22 18:24:20] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8050 ms. Remains : 646/646 places, 1170/1170 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-06 finished in 87260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 9 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 15 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-22 18:24:20] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-22 18:24:20] [INFO ] Computed 52 place invariants in 18 ms
[2023-03-22 18:24:21] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
[2023-03-22 18:24:21] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:24:21] [INFO ] Invariant cache hit.
[2023-03-22 18:24:21] [INFO ] Implicit Places using invariants in 449 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 450 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 6 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1064 ms. Remains : 646/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s165 1) (GEQ s562 2)) (AND (GEQ s166 1) (GEQ s562 2)) (AND (GEQ s164 1) (GEQ s562 2)) (AND (GEQ s162 1) (GEQ s562 2)) (AND (GEQ s163 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3837 reset in 306 ms.
Product exploration explored 100000 steps with 3870 reset in 311 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-22 18:24:22] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 646 cols
[2023-03-22 18:24:22] [INFO ] Computed 44 place invariants in 23 ms
[2023-03-22 18:24:23] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-22 18:24:23] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 217 ms returned sat
[2023-03-22 18:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:24:28] [INFO ] [Real]Absence check using state equation in 5165 ms returned sat
[2023-03-22 18:24:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:24:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-22 18:24:29] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 58 ms returned sat
[2023-03-22 18:24:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:24:31] [INFO ] [Nat]Absence check using state equation in 1731 ms returned sat
[2023-03-22 18:24:31] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:24:31] [INFO ] [Nat]Added 96 Read/Feed constraints in 654 ms returned sat
[2023-03-22 18:24:32] [INFO ] Computed and/alt/rep : 824/3181/816 causal constraints (skipped 336 transitions) in 84 ms.
[2023-03-22 18:24:37] [INFO ] Added : 304 causal constraints over 61 iterations in 5346 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 646 transition count 1114
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 590 transition count 1114
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 590 transition count 1034
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 272 place count 510 transition count 1034
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 384 place count 454 transition count 978
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 392 place count 446 transition count 970
Iterating global reduction 2 with 8 rules applied. Total rules applied 400 place count 446 transition count 970
Applied a total of 400 rules in 38 ms. Remains 446 /646 variables (removed 200) and now considering 970/1170 (removed 200) transitions.
[2023-03-22 18:24:37] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
// Phase 1: matrix 954 rows 446 cols
[2023-03-22 18:24:37] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-22 18:24:37] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
[2023-03-22 18:24:37] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:24:37] [INFO ] Invariant cache hit.
[2023-03-22 18:24:38] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-22 18:24:38] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:24:38] [INFO ] Invariant cache hit.
[2023-03-22 18:24:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:24:43] [INFO ] Implicit Places using invariants and state equation in 5715 ms returned []
Implicit Place search using SMT with State Equation took 6119 ms to find 0 implicit places.
[2023-03-22 18:24:43] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 18:24:43] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:24:43] [INFO ] Invariant cache hit.
[2023-03-22 18:24:44] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 446/646 places, 970/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7149 ms. Remains : 446/646 places, 970/1170 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-22 18:24:44] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:24:44] [INFO ] Invariant cache hit.
[2023-03-22 18:24:45] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:24:45] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 89 ms returned sat
[2023-03-22 18:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:24:46] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2023-03-22 18:24:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:24:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:24:46] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 68 ms returned sat
[2023-03-22 18:24:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:24:47] [INFO ] [Nat]Absence check using state equation in 1071 ms returned sat
[2023-03-22 18:24:47] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:24:48] [INFO ] [Nat]Added 96 Read/Feed constraints in 354 ms returned sat
[2023-03-22 18:24:48] [INFO ] Computed and/alt/rep : 488/1637/480 causal constraints (skipped 472 transitions) in 64 ms.
[2023-03-22 18:24:49] [INFO ] Added : 125 causal constraints over 25 iterations in 1476 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4472 reset in 297 ms.
Product exploration explored 100000 steps with 4497 reset in 310 ms.
Support contains 9 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 970/970 transitions.
Applied a total of 0 rules in 15 ms. Remains 446 /446 variables (removed 0) and now considering 970/970 (removed 0) transitions.
[2023-03-22 18:24:50] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:24:50] [INFO ] Invariant cache hit.
[2023-03-22 18:24:50] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
[2023-03-22 18:24:50] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:24:50] [INFO ] Invariant cache hit.
[2023-03-22 18:24:51] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-22 18:24:51] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:24:51] [INFO ] Invariant cache hit.
[2023-03-22 18:24:51] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:24:57] [INFO ] Implicit Places using invariants and state equation in 6083 ms returned []
Implicit Place search using SMT with State Equation took 6485 ms to find 0 implicit places.
[2023-03-22 18:24:57] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 18:24:57] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:24:57] [INFO ] Invariant cache hit.
[2023-03-22 18:24:57] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7422 ms. Remains : 446/446 places, 970/970 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-08 finished in 37394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 73 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 662 transition count 1130
Reduce places removed 48 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 56 rules applied. Total rules applied 104 place count 614 transition count 1122
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 606 transition count 1122
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 112 place count 606 transition count 1042
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 272 place count 526 transition count 1042
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 416 place count 454 transition count 970
Applied a total of 416 rules in 41 ms. Remains 454 /664 variables (removed 210) and now considering 970/1178 (removed 208) transitions.
[2023-03-22 18:24:58] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
// Phase 1: matrix 954 rows 454 cols
[2023-03-22 18:24:58] [INFO ] Computed 52 place invariants in 11 ms
[2023-03-22 18:24:58] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
[2023-03-22 18:24:58] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:24:58] [INFO ] Invariant cache hit.
[2023-03-22 18:24:58] [INFO ] Implicit Places using invariants in 393 ms returned [408, 409, 410, 411, 412, 413, 414, 415]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 394 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 446/664 places, 970/1178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 438 transition count 962
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 438 transition count 962
Applied a total of 16 rules in 19 ms. Remains 438 /446 variables (removed 8) and now considering 962/970 (removed 8) transitions.
[2023-03-22 18:24:58] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
// Phase 1: matrix 946 rows 438 cols
[2023-03-22 18:24:58] [INFO ] Computed 44 place invariants in 12 ms
[2023-03-22 18:24:59] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-22 18:24:59] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-22 18:24:59] [INFO ] Invariant cache hit.
[2023-03-22 18:24:59] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:25:03] [INFO ] Implicit Places using invariants and state equation in 4510 ms returned []
Implicit Place search using SMT with State Equation took 4908 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 438/664 places, 962/1178 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5891 ms. Remains : 438/664 places, 962/1178 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s122 1) (LT s174 1)) (OR (LT s83 1) (LT s174 1)) (OR (LT s112 1) (LT s174 1)) (OR (LT s102 1) (LT s174 1)) (OR (LT s93 1) (LT s174 1)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1166 reset in 687 ms.
Product exploration explored 100000 steps with 1183 reset in 662 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)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 73 out of 438 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 438/438 places, 962/962 transitions.
Applied a total of 0 rules in 12 ms. Remains 438 /438 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-22 18:25:05] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-22 18:25:05] [INFO ] Invariant cache hit.
[2023-03-22 18:25:06] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
[2023-03-22 18:25:06] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-22 18:25:06] [INFO ] Invariant cache hit.
[2023-03-22 18:25:06] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-22 18:25:06] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-22 18:25:06] [INFO ] Invariant cache hit.
[2023-03-22 18:25:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:25:10] [INFO ] Implicit Places using invariants and state equation in 3421 ms returned []
Implicit Place search using SMT with State Equation took 3795 ms to find 0 implicit places.
[2023-03-22 18:25:10] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-22 18:25:10] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-22 18:25:10] [INFO ] Invariant cache hit.
[2023-03-22 18:25:10] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4793 ms. Remains : 438/438 places, 962/962 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1151 reset in 624 ms.
Product exploration explored 100000 steps with 1182 reset in 645 ms.
Support contains 73 out of 438 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 438/438 places, 962/962 transitions.
Applied a total of 0 rules in 11 ms. Remains 438 /438 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-22 18:25:12] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-22 18:25:12] [INFO ] Invariant cache hit.
[2023-03-22 18:25:13] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
[2023-03-22 18:25:13] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-22 18:25:13] [INFO ] Invariant cache hit.
[2023-03-22 18:25:13] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-22 18:25:13] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-22 18:25:13] [INFO ] Invariant cache hit.
[2023-03-22 18:25:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:25:17] [INFO ] Implicit Places using invariants and state equation in 3511 ms returned []
Implicit Place search using SMT with State Equation took 3873 ms to find 0 implicit places.
[2023-03-22 18:25:17] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 18:25:17] [INFO ] Flow matrix only has 946 transitions (discarded 16 similar events)
[2023-03-22 18:25:17] [INFO ] Invariant cache hit.
[2023-03-22 18:25:17] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4869 ms. Remains : 438/438 places, 962/962 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-09 finished in 19685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Support contains 24 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 24 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-22 18:25:17] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-22 18:25:17] [INFO ] Computed 52 place invariants in 33 ms
[2023-03-22 18:25:18] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
[2023-03-22 18:25:18] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:18] [INFO ] Invariant cache hit.
[2023-03-22 18:25:18] [INFO ] Implicit Places using invariants in 423 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 425 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 6 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1048 ms. Remains : 646/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s461 1) (GEQ s460 1) (GEQ s459 1) (GEQ s458 1) (GEQ s457 1) (GEQ s456 1) (GEQ s455 1) (GEQ s454 1)), p1:(AND (OR (LT s238 1) (LT s303 1) (LT s...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 5412 reset in 724 ms.
Product exploration explored 100000 steps with 5409 reset in 741 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 p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 25 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 204 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Applied a total of 0 rules in 9 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-22 18:25:21] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 646 cols
[2023-03-22 18:25:21] [INFO ] Computed 44 place invariants in 21 ms
[2023-03-22 18:25:21] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
[2023-03-22 18:25:21] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:21] [INFO ] Invariant cache hit.
[2023-03-22 18:25:22] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-22 18:25:22] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:22] [INFO ] Invariant cache hit.
[2023-03-22 18:25:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:25:28] [INFO ] Implicit Places using invariants and state equation in 6501 ms returned []
Implicit Place search using SMT with State Equation took 6879 ms to find 0 implicit places.
[2023-03-22 18:25:28] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:28] [INFO ] Invariant cache hit.
[2023-03-22 18:25:29] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8116 ms. Remains : 646/646 places, 1170/1170 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 p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 36 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5396 reset in 720 ms.
Product exploration explored 100000 steps with 5415 reset in 742 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 646 transition count 1170
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 40 place count 646 transition count 1258
Deduced a syphon composed of 128 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 128 place count 646 transition count 1258
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 144 place count 630 transition count 1242
Deduced a syphon composed of 112 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 160 place count 630 transition count 1242
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 216 place count 630 transition count 1242
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 248 place count 598 transition count 1210
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 280 place count 598 transition count 1210
Deduced a syphon composed of 144 places in 1 ms
Applied a total of 280 rules in 65 ms. Remains 598 /646 variables (removed 48) and now considering 1210/1170 (removed -40) transitions.
[2023-03-22 18:25:31] [INFO ] Flow matrix only has 1194 transitions (discarded 16 similar events)
// Phase 1: matrix 1194 rows 598 cols
[2023-03-22 18:25:31] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-22 18:25:32] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
[2023-03-22 18:25:32] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-22 18:25:32] [INFO ] Flow matrix only has 1194 transitions (discarded 16 similar events)
[2023-03-22 18:25:32] [INFO ] Invariant cache hit.
[2023-03-22 18:25:33] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 598/646 places, 1210/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1304 ms. Remains : 598/646 places, 1210/1170 transitions.
Support contains 24 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 1170/1170 transitions.
Applied a total of 0 rules in 6 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-22 18:25:33] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 646 cols
[2023-03-22 18:25:33] [INFO ] Computed 44 place invariants in 16 ms
[2023-03-22 18:25:33] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
[2023-03-22 18:25:33] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:33] [INFO ] Invariant cache hit.
[2023-03-22 18:25:34] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-22 18:25:34] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:34] [INFO ] Invariant cache hit.
[2023-03-22 18:25:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:25:39] [INFO ] Implicit Places using invariants and state equation in 5357 ms returned []
Implicit Place search using SMT with State Equation took 5780 ms to find 0 implicit places.
[2023-03-22 18:25:39] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:39] [INFO ] Invariant cache hit.
[2023-03-22 18:25:40] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6883 ms. Remains : 646/646 places, 1170/1170 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-10 finished in 22469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1&&F(p2)))&&p0)))'
Support contains 24 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Applied a total of 2 rules in 11 ms. Remains 662 /664 variables (removed 2) and now considering 1178/1178 (removed 0) transitions.
[2023-03-22 18:25:40] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
// Phase 1: matrix 1162 rows 662 cols
[2023-03-22 18:25:40] [INFO ] Computed 52 place invariants in 21 ms
[2023-03-22 18:25:40] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
[2023-03-22 18:25:40] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
[2023-03-22 18:25:40] [INFO ] Invariant cache hit.
[2023-03-22 18:25:41] [INFO ] Implicit Places using invariants in 506 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 508 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1178/1178 transitions.
Applied a total of 0 rules in 6 ms. Remains 654 /654 variables (removed 0) and now considering 1178/1178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1106 ms. Remains : 654/664 places, 1178/1178 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s512 1) (LT s513 1) (LT s514 1) (LT s515 1) (LT s516 1) (LT s517 1) (LT s518 1) (LT s519 1)), p1:(OR (AND (GEQ s11 1) (GEQ s167 1)) (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-11 finished in 1289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||(F(p1)&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))||p0))))'
Support contains 89 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 17 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-22 18:25:41] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-22 18:25:41] [INFO ] Computed 52 place invariants in 20 ms
[2023-03-22 18:25:42] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
[2023-03-22 18:25:42] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:42] [INFO ] Invariant cache hit.
[2023-03-22 18:25:42] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-22 18:25:42] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:42] [INFO ] Invariant cache hit.
[2023-03-22 18:25:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:25:44] [INFO ] Implicit Places using invariants and state equation in 2361 ms returned []
Implicit Place search using SMT with State Equation took 2814 ms to find 0 implicit places.
[2023-03-22 18:25:44] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:44] [INFO ] Invariant cache hit.
[2023-03-22 18:25:45] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1170/1178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3961 ms. Remains : 654/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s512 1) (GEQ s571 1)) (AND (GEQ s9 1) (GEQ s519 1) (GEQ s571 1)) (AND (GEQ s4 1) (GEQ s514 1) (GEQ s571 1)) (AND (GEQ s7 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3842 reset in 611 ms.
Product exploration explored 100000 steps with 3839 reset in 624 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 p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 609 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 18:25:48] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:48] [INFO ] Invariant cache hit.
[2023-03-22 18:25:48] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-22 18:25:48] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 28 ms returned sat
[2023-03-22 18:25:48] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-22 18:25:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-22 18:25:48] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-22 18:25:48] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (G (NOT (AND (NOT p0) p2 p3))), (G (NOT (AND (NOT p0) p2 p3 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p3)), (F (AND (NOT p0) p2 (NOT p3))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p3 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1))))]
Knowledge based reduction with 15 factoid took 1055 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
[2023-03-22 18:25:50] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:25:50] [INFO ] Invariant cache hit.
[2023-03-22 18:25:50] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-22 18:25:51] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 117 ms returned sat
[2023-03-22 18:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:25:52] [INFO ] [Real]Absence check using state equation in 1767 ms returned sat
[2023-03-22 18:25:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:25:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-22 18:25:53] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 126 ms returned sat
[2023-03-22 18:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:25:56] [INFO ] [Nat]Absence check using state equation in 2276 ms returned sat
[2023-03-22 18:25:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:25:56] [INFO ] [Nat]Added 96 Read/Feed constraints in 429 ms returned sat
[2023-03-22 18:25:56] [INFO ] Deduced a trap composed of 69 places in 320 ms of which 2 ms to minimize.
[2023-03-22 18:25:57] [INFO ] Deduced a trap composed of 69 places in 304 ms of which 0 ms to minimize.
[2023-03-22 18:25:57] [INFO ] Deduced a trap composed of 70 places in 303 ms of which 0 ms to minimize.
[2023-03-22 18:25:58] [INFO ] Deduced a trap composed of 320 places in 306 ms of which 1 ms to minimize.
[2023-03-22 18:25:58] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2023-03-22 18:25:58] [INFO ] Deduced a trap composed of 182 places in 218 ms of which 0 ms to minimize.
[2023-03-22 18:25:58] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2023-03-22 18:25:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2237 ms
[2023-03-22 18:25:58] [INFO ] Computed and/alt/rep : 824/3182/816 causal constraints (skipped 336 transitions) in 84 ms.
[2023-03-22 18:26:07] [INFO ] Added : 452 causal constraints over 91 iterations in 8504 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 89 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1170/1170 transitions.
Applied a total of 0 rules in 10 ms. Remains 654 /654 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-22 18:26:07] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:26:07] [INFO ] Invariant cache hit.
[2023-03-22 18:26:07] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
[2023-03-22 18:26:07] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:26:07] [INFO ] Invariant cache hit.
[2023-03-22 18:26:08] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-22 18:26:08] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:26:08] [INFO ] Invariant cache hit.
[2023-03-22 18:26:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:26:10] [INFO ] Implicit Places using invariants and state equation in 2352 ms returned []
Implicit Place search using SMT with State Equation took 2799 ms to find 0 implicit places.
[2023-03-22 18:26:10] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:26:10] [INFO ] Invariant cache hit.
[2023-03-22 18:26:11] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3942 ms. Remains : 654/654 places, 1170/1170 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 p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 475 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Finished random walk after 68 steps, including 0 resets, run visited all 9 properties in 6 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F (AND p3 (NOT p0) (NOT p2))), (F (AND (NOT p1) p3 (NOT p0))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0))))]
Knowledge based reduction with 11 factoid took 646 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
[2023-03-22 18:26:13] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:26:13] [INFO ] Invariant cache hit.
[2023-03-22 18:26:14] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-22 18:26:14] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 117 ms returned sat
[2023-03-22 18:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:26:16] [INFO ] [Real]Absence check using state equation in 1757 ms returned sat
[2023-03-22 18:26:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:26:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-22 18:26:17] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 119 ms returned sat
[2023-03-22 18:26:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:26:18] [INFO ] [Nat]Absence check using state equation in 1921 ms returned sat
[2023-03-22 18:26:18] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:26:19] [INFO ] [Nat]Added 96 Read/Feed constraints in 430 ms returned sat
[2023-03-22 18:26:19] [INFO ] Deduced a trap composed of 69 places in 283 ms of which 0 ms to minimize.
[2023-03-22 18:26:20] [INFO ] Deduced a trap composed of 69 places in 281 ms of which 0 ms to minimize.
[2023-03-22 18:26:20] [INFO ] Deduced a trap composed of 70 places in 290 ms of which 1 ms to minimize.
[2023-03-22 18:26:20] [INFO ] Deduced a trap composed of 320 places in 307 ms of which 0 ms to minimize.
[2023-03-22 18:26:20] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2023-03-22 18:26:21] [INFO ] Deduced a trap composed of 182 places in 201 ms of which 1 ms to minimize.
[2023-03-22 18:26:21] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2023-03-22 18:26:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2164 ms
[2023-03-22 18:26:21] [INFO ] Computed and/alt/rep : 824/3182/816 causal constraints (skipped 336 transitions) in 67 ms.
[2023-03-22 18:26:29] [INFO ] Added : 452 causal constraints over 91 iterations in 8381 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Product exploration explored 100000 steps with 3840 reset in 461 ms.
Product exploration explored 100000 steps with 3846 reset in 477 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Support contains 89 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 1170/1170 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 654 transition count 1170
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 40 place count 654 transition count 1202
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 72 place count 654 transition count 1202
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 88 place count 638 transition count 1186
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 104 place count 638 transition count 1186
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 144 place count 638 transition count 1186
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 160 place count 622 transition count 1170
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 176 place count 622 transition count 1170
Deduced a syphon composed of 80 places in 1 ms
Applied a total of 176 rules in 51 ms. Remains 622 /654 variables (removed 32) and now considering 1170/1170 (removed 0) transitions.
[2023-03-22 18:26:31] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 622 cols
[2023-03-22 18:26:31] [INFO ] Computed 52 place invariants in 19 ms
[2023-03-22 18:26:32] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
[2023-03-22 18:26:32] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 18:26:32] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:26:32] [INFO ] Invariant cache hit.
[2023-03-22 18:26:32] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 622/654 places, 1170/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1299 ms. Remains : 622/654 places, 1170/1170 transitions.
Support contains 89 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1170/1170 transitions.
Applied a total of 0 rules in 5 ms. Remains 654 /654 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2023-03-22 18:26:32] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-22 18:26:32] [INFO ] Computed 52 place invariants in 15 ms
[2023-03-22 18:26:33] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
[2023-03-22 18:26:33] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:26:33] [INFO ] Invariant cache hit.
[2023-03-22 18:26:33] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-22 18:26:33] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:26:33] [INFO ] Invariant cache hit.
[2023-03-22 18:26:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:26:36] [INFO ] Implicit Places using invariants and state equation in 2361 ms returned []
Implicit Place search using SMT with State Equation took 2802 ms to find 0 implicit places.
[2023-03-22 18:26:36] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:26:36] [INFO ] Invariant cache hit.
[2023-03-22 18:26:36] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4019 ms. Remains : 654/654 places, 1170/1170 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-12 finished in 55591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 64 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Applied a total of 2 rules in 9 ms. Remains 662 /664 variables (removed 2) and now considering 1178/1178 (removed 0) transitions.
[2023-03-22 18:26:37] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
// Phase 1: matrix 1162 rows 662 cols
[2023-03-22 18:26:37] [INFO ] Computed 52 place invariants in 17 ms
[2023-03-22 18:26:37] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
[2023-03-22 18:26:37] [INFO ] Flow matrix only has 1162 transitions (discarded 16 similar events)
[2023-03-22 18:26:37] [INFO ] Invariant cache hit.
[2023-03-22 18:26:38] [INFO ] Implicit Places using invariants in 463 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 467 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1178/1178 transitions.
Applied a total of 0 rules in 6 ms. Remains 654 /654 variables (removed 0) and now considering 1178/1178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1044 ms. Remains : 654/664 places, 1178/1178 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s493 1) (GEQ s492 1) (GEQ s491 1) (GEQ s490 1) (GEQ s489 1) (GEQ s488 1) (GEQ s487 1) (GEQ s486 1)), p1:(OR (GEQ s261 1) (GEQ s263 1) (GEQ s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 796 steps with 0 reset in 6 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-13 finished in 1138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0&&X(G((X((F(p2)||G(p3)))&&p1)))))))'
Support contains 95 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 662 transition count 1178
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 654 transition count 1170
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 654 transition count 1170
Applied a total of 18 rules in 11 ms. Remains 654 /664 variables (removed 10) and now considering 1170/1178 (removed 8) transitions.
[2023-03-22 18:26:38] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
// Phase 1: matrix 1154 rows 654 cols
[2023-03-22 18:26:38] [INFO ] Computed 52 place invariants in 21 ms
[2023-03-22 18:26:38] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
[2023-03-22 18:26:38] [INFO ] Flow matrix only has 1154 transitions (discarded 16 similar events)
[2023-03-22 18:26:38] [INFO ] Invariant cache hit.
[2023-03-22 18:26:39] [INFO ] Implicit Places using invariants in 376 ms returned [512, 513, 514, 515, 516, 517, 518, 519]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 377 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 646/664 places, 1170/1178 transitions.
Applied a total of 0 rules in 6 ms. Remains 646 /646 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 981 ms. Remains : 646/664 places, 1170/1178 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) p0 (AND (NOT p2) (NOT p3))), (OR (NOT p1) p0 (AND (NOT p2) (NOT p3))), (OR (NOT p1) p0 (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (LT s238 1) (LT s303 1) (LT s309 1)) (OR (LT s238 1) (LT s303 1) (LT s307 1)) (OR (LT s233 1) (LT s303 1) (LT s312 1)) (OR (LT s238 1) (LT s30...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S02J06T08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-14 finished in 1312 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F((p1||G(p2))))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((p0&&F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T08-LTLFireability-08
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 9 out of 664 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 662 transition count 1122
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 606 transition count 1122
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 112 place count 606 transition count 1042
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 272 place count 526 transition count 1042
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 462 transition count 978
Applied a total of 400 rules in 40 ms. Remains 462 /664 variables (removed 202) and now considering 978/1178 (removed 200) transitions.
[2023-03-22 18:26:39] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 462 cols
[2023-03-22 18:26:39] [INFO ] Computed 52 place invariants in 17 ms
[2023-03-22 18:26:40] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
[2023-03-22 18:26:40] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:26:40] [INFO ] Invariant cache hit.
[2023-03-22 18:26:40] [INFO ] Implicit Places using invariants in 432 ms returned [416, 417, 418, 419, 420, 421, 422, 423]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 433 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 454/664 places, 978/1178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 446 transition count 970
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 446 transition count 970
Applied a total of 16 rules in 16 ms. Remains 446 /454 variables (removed 8) and now considering 970/978 (removed 8) transitions.
[2023-03-22 18:26:40] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
// Phase 1: matrix 954 rows 446 cols
[2023-03-22 18:26:40] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-22 18:26:41] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-22 18:26:41] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:26:41] [INFO ] Invariant cache hit.
[2023-03-22 18:26:41] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:26:44] [INFO ] Implicit Places using invariants and state equation in 3046 ms returned []
Implicit Place search using SMT with State Equation took 3482 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 446/664 places, 970/1178 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4488 ms. Remains : 446/664 places, 970/1178 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s157 1) (GEQ s426 2)) (AND (GEQ s158 1) (GEQ s426 2)) (AND (GEQ s156 1) (GEQ s426 2)) (AND (GEQ s154 1) (GEQ s426 2)) (AND (GEQ s155 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4495 reset in 300 ms.
Product exploration explored 100000 steps with 4460 reset in 311 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-22 18:26:45] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:26:45] [INFO ] Invariant cache hit.
[2023-03-22 18:26:45] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:26:45] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 280 ms returned sat
[2023-03-22 18:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:26:46] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2023-03-22 18:26:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:26:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:26:47] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 84 ms returned sat
[2023-03-22 18:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:26:48] [INFO ] [Nat]Absence check using state equation in 1309 ms returned sat
[2023-03-22 18:26:48] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:26:49] [INFO ] [Nat]Added 96 Read/Feed constraints in 210 ms returned sat
[2023-03-22 18:26:49] [INFO ] Computed and/alt/rep : 488/1637/480 causal constraints (skipped 472 transitions) in 60 ms.
[2023-03-22 18:26:50] [INFO ] Added : 136 causal constraints over 28 iterations in 1673 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 970/970 transitions.
Applied a total of 0 rules in 15 ms. Remains 446 /446 variables (removed 0) and now considering 970/970 (removed 0) transitions.
[2023-03-22 18:26:50] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:26:50] [INFO ] Invariant cache hit.
[2023-03-22 18:26:51] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
[2023-03-22 18:26:51] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:26:51] [INFO ] Invariant cache hit.
[2023-03-22 18:26:51] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-22 18:26:51] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:26:51] [INFO ] Invariant cache hit.
[2023-03-22 18:26:52] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:26:56] [INFO ] Implicit Places using invariants and state equation in 5311 ms returned []
Implicit Place search using SMT with State Equation took 5683 ms to find 0 implicit places.
[2023-03-22 18:26:57] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 18:26:57] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:26:57] [INFO ] Invariant cache hit.
[2023-03-22 18:26:57] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6682 ms. Remains : 446/446 places, 970/970 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-22 18:26:57] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:26:57] [INFO ] Invariant cache hit.
[2023-03-22 18:26:58] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:26:58] [INFO ] [Real]Absence check using 13 positive and 31 generalized place invariants in 281 ms returned sat
[2023-03-22 18:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:26:59] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2023-03-22 18:26:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:27:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-22 18:27:00] [INFO ] [Nat]Absence check using 13 positive and 31 generalized place invariants in 81 ms returned sat
[2023-03-22 18:27:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:27:01] [INFO ] [Nat]Absence check using state equation in 1249 ms returned sat
[2023-03-22 18:27:01] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:27:01] [INFO ] [Nat]Added 96 Read/Feed constraints in 214 ms returned sat
[2023-03-22 18:27:01] [INFO ] Computed and/alt/rep : 488/1637/480 causal constraints (skipped 472 transitions) in 59 ms.
[2023-03-22 18:27:03] [INFO ] Added : 136 causal constraints over 28 iterations in 1691 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4491 reset in 303 ms.
Product exploration explored 100000 steps with 4515 reset in 317 ms.
Support contains 9 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 970/970 transitions.
Applied a total of 0 rules in 10 ms. Remains 446 /446 variables (removed 0) and now considering 970/970 (removed 0) transitions.
[2023-03-22 18:27:04] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:27:04] [INFO ] Invariant cache hit.
[2023-03-22 18:27:04] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
[2023-03-22 18:27:04] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:27:04] [INFO ] Invariant cache hit.
[2023-03-22 18:27:04] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-22 18:27:04] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:27:04] [INFO ] Invariant cache hit.
[2023-03-22 18:27:05] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:27:10] [INFO ] Implicit Places using invariants and state equation in 6047 ms returned []
Implicit Place search using SMT with State Equation took 6417 ms to find 0 implicit places.
[2023-03-22 18:27:10] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 18:27:10] [INFO ] Flow matrix only has 954 transitions (discarded 16 similar events)
[2023-03-22 18:27:10] [INFO ] Invariant cache hit.
[2023-03-22 18:27:11] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7338 ms. Remains : 446/446 places, 970/970 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-08 finished in 31830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Found a Lengthening insensitive property : PolyORBLF-COL-S02J06T08-LTLFireability-10
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 664 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 662 transition count 1130
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 614 transition count 1130
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 96 place count 614 transition count 1050
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 256 place count 534 transition count 1050
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 384 place count 470 transition count 986
Applied a total of 384 rules in 31 ms. Remains 470 /664 variables (removed 194) and now considering 986/1178 (removed 192) transitions.
[2023-03-22 18:27:11] [INFO ] Flow matrix only has 970 transitions (discarded 16 similar events)
// Phase 1: matrix 970 rows 470 cols
[2023-03-22 18:27:11] [INFO ] Computed 52 place invariants in 14 ms
[2023-03-22 18:27:12] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
[2023-03-22 18:27:12] [INFO ] Flow matrix only has 970 transitions (discarded 16 similar events)
[2023-03-22 18:27:12] [INFO ] Invariant cache hit.
[2023-03-22 18:27:12] [INFO ] Implicit Places using invariants in 358 ms returned [424, 425, 426, 427, 428, 429, 430, 431]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 359 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 462/664 places, 986/1178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 454 transition count 978
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 454 transition count 978
Applied a total of 16 rules in 13 ms. Remains 454 /462 variables (removed 8) and now considering 978/986 (removed 8) transitions.
[2023-03-22 18:27:12] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
// Phase 1: matrix 962 rows 454 cols
[2023-03-22 18:27:12] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-22 18:27:13] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-22 18:27:13] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:13] [INFO ] Invariant cache hit.
[2023-03-22 18:27:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:27:14] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2215 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 454/664 places, 978/1178 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3111 ms. Remains : 454/664 places, 978/1178 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GEQ s381 1) (GEQ s380 1) (GEQ s379 1) (GEQ s378 1) (GEQ s377 1) (GEQ s376 1) (GEQ s375 1) (GEQ s374 1)), p1:(AND (OR (LT s182 1) (LT s247 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6467 reset in 707 ms.
Product exploration explored 100000 steps with 6456 reset in 704 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 p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 20 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 978/978 transitions.
Applied a total of 0 rules in 7 ms. Remains 454 /454 variables (removed 0) and now considering 978/978 (removed 0) transitions.
[2023-03-22 18:27:17] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:17] [INFO ] Invariant cache hit.
[2023-03-22 18:27:17] [INFO ] Dead Transitions using invariants and state equation in 480 ms found 0 transitions.
[2023-03-22 18:27:17] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:17] [INFO ] Invariant cache hit.
[2023-03-22 18:27:18] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-22 18:27:18] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:18] [INFO ] Invariant cache hit.
[2023-03-22 18:27:18] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:27:20] [INFO ] Implicit Places using invariants and state equation in 2551 ms returned []
Implicit Place search using SMT with State Equation took 2953 ms to find 0 implicit places.
[2023-03-22 18:27:20] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:20] [INFO ] Invariant cache hit.
[2023-03-22 18:27:21] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3913 ms. Remains : 454/454 places, 978/978 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 p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 25 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6454 reset in 692 ms.
Product exploration explored 100000 steps with 6423 reset in 705 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 24 out of 454 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 454/454 places, 978/978 transitions.
Applied a total of 0 rules in 15 ms. Remains 454 /454 variables (removed 0) and now considering 978/978 (removed 0) transitions.
[2023-03-22 18:27:23] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:23] [INFO ] Invariant cache hit.
[2023-03-22 18:27:24] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
[2023-03-22 18:27:24] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 18:27:24] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:24] [INFO ] Invariant cache hit.
[2023-03-22 18:27:24] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 967 ms. Remains : 454/454 places, 978/978 transitions.
Support contains 24 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 978/978 transitions.
Applied a total of 0 rules in 3 ms. Remains 454 /454 variables (removed 0) and now considering 978/978 (removed 0) transitions.
[2023-03-22 18:27:24] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:24] [INFO ] Invariant cache hit.
[2023-03-22 18:27:25] [INFO ] Dead Transitions using invariants and state equation in 469 ms found 0 transitions.
[2023-03-22 18:27:25] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:25] [INFO ] Invariant cache hit.
[2023-03-22 18:27:25] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-22 18:27:25] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:25] [INFO ] Invariant cache hit.
[2023-03-22 18:27:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:27:28] [INFO ] Implicit Places using invariants and state equation in 2647 ms returned []
Implicit Place search using SMT with State Equation took 3015 ms to find 0 implicit places.
[2023-03-22 18:27:28] [INFO ] Flow matrix only has 962 transitions (discarded 16 similar events)
[2023-03-22 18:27:28] [INFO ] Invariant cache hit.
[2023-03-22 18:27:28] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3964 ms. Remains : 454/454 places, 978/978 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-10 finished in 17101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||(F(p1)&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))||p0))))'
Found a Shortening insensitive property : PolyORBLF-COL-S02J06T08-LTLFireability-12
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Support contains 89 out of 664 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 664/664 places, 1178/1178 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 662 transition count 1138
Reduce places removed 40 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 48 rules applied. Total rules applied 88 place count 622 transition count 1130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 96 place count 614 transition count 1130
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 96 place count 614 transition count 1106
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 144 place count 590 transition count 1106
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 240 place count 542 transition count 1058
Applied a total of 240 rules in 32 ms. Remains 542 /664 variables (removed 122) and now considering 1058/1178 (removed 120) transitions.
[2023-03-22 18:27:29] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
// Phase 1: matrix 1042 rows 542 cols
[2023-03-22 18:27:29] [INFO ] Computed 52 place invariants in 13 ms
[2023-03-22 18:27:29] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
[2023-03-22 18:27:29] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:27:29] [INFO ] Invariant cache hit.
[2023-03-22 18:27:29] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-22 18:27:29] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:27:29] [INFO ] Invariant cache hit.
[2023-03-22 18:27:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:27:33] [INFO ] Implicit Places using invariants and state equation in 4040 ms returned []
Implicit Place search using SMT with State Equation took 4446 ms to find 0 implicit places.
[2023-03-22 18:27:33] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:27:33] [INFO ] Invariant cache hit.
[2023-03-22 18:27:34] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 542/664 places, 1058/1178 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5508 ms. Remains : 542/664 places, 1058/1178 transitions.
Running random walk in product with property : PolyORBLF-COL-S02J06T08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p3 p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s416 1) (GEQ s459 1)) (AND (GEQ s9 1) (GEQ s423 1) (GEQ s459 1)) (AND (GEQ s4 1) (GEQ s418 1) (GEQ s459 1)) (AND (GEQ s7 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5127 reset in 621 ms.
Product exploration explored 100000 steps with 5129 reset in 638 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 p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 632 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 18:27:37] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:27:37] [INFO ] Invariant cache hit.
[2023-03-22 18:27:37] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 18:27:37] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 29 ms returned sat
[2023-03-22 18:27:37] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-22 18:27:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 18:27:37] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 21 ms returned sat
[2023-03-22 18:27:37] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (AND (NOT p0) (NOT p1))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p3 p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p3 p2)))), (G (NOT (AND (NOT p0) p2 p3))), (G (NOT (AND (NOT p0) p2 p3 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) p3)), (F (AND (NOT p0) p2 (NOT p3))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p3 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1))))]
Knowledge based reduction with 15 factoid took 922 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
[2023-03-22 18:27:38] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:27:38] [INFO ] Invariant cache hit.
[2023-03-22 18:27:39] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-22 18:27:39] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 171 ms returned sat
[2023-03-22 18:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:27:42] [INFO ] [Real]Absence check using state equation in 2765 ms returned sat
[2023-03-22 18:27:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:27:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-22 18:27:43] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 122 ms returned sat
[2023-03-22 18:27:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:27:45] [INFO ] [Nat]Absence check using state equation in 1921 ms returned sat
[2023-03-22 18:27:45] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:27:45] [INFO ] [Nat]Added 96 Read/Feed constraints in 313 ms returned sat
[2023-03-22 18:27:45] [INFO ] Deduced a trap composed of 56 places in 234 ms of which 1 ms to minimize.
[2023-03-22 18:27:46] [INFO ] Deduced a trap composed of 288 places in 236 ms of which 1 ms to minimize.
[2023-03-22 18:27:46] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 2 ms to minimize.
[2023-03-22 18:27:46] [INFO ] Deduced a trap composed of 55 places in 233 ms of which 0 ms to minimize.
[2023-03-22 18:27:47] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 1 ms to minimize.
[2023-03-22 18:27:47] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 1 ms to minimize.
[2023-03-22 18:27:47] [INFO ] Deduced a trap composed of 295 places in 232 ms of which 0 ms to minimize.
[2023-03-22 18:27:47] [INFO ] Deduced a trap composed of 298 places in 222 ms of which 1 ms to minimize.
[2023-03-22 18:27:48] [INFO ] Deduced a trap composed of 226 places in 246 ms of which 9 ms to minimize.
[2023-03-22 18:27:48] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 1 ms to minimize.
[2023-03-22 18:27:48] [INFO ] Deduced a trap composed of 310 places in 215 ms of which 1 ms to minimize.
[2023-03-22 18:27:49] [INFO ] Deduced a trap composed of 228 places in 191 ms of which 1 ms to minimize.
[2023-03-22 18:27:49] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3663 ms
[2023-03-22 18:27:49] [INFO ] Computed and/alt/rep : 640/2790/632 causal constraints (skipped 408 transitions) in 65 ms.
[2023-03-22 18:27:52] [INFO ] Added : 272 causal constraints over 55 iterations in 3612 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 89 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1058/1058 transitions.
Applied a total of 0 rules in 7 ms. Remains 542 /542 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2023-03-22 18:27:52] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:27:52] [INFO ] Invariant cache hit.
[2023-03-22 18:27:53] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
[2023-03-22 18:27:53] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:27:53] [INFO ] Invariant cache hit.
[2023-03-22 18:27:53] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-22 18:27:53] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:27:53] [INFO ] Invariant cache hit.
[2023-03-22 18:27:54] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:27:58] [INFO ] Implicit Places using invariants and state equation in 4466 ms returned []
Implicit Place search using SMT with State Equation took 4848 ms to find 0 implicit places.
[2023-03-22 18:27:58] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:27:58] [INFO ] Invariant cache hit.
[2023-03-22 18:27:58] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5850 ms. Remains : 542/542 places, 1058/1058 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 p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 545 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Finished random walk after 55 steps, including 0 resets, run visited all 9 properties in 5 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F (AND p3 (NOT p0) (NOT p2))), (F (AND (NOT p1) p3 (NOT p0))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p3) (NOT p0))))]
Knowledge based reduction with 11 factoid took 774 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
[2023-03-22 18:28:01] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:28:01] [INFO ] Invariant cache hit.
[2023-03-22 18:28:01] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-22 18:28:01] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 172 ms returned sat
[2023-03-22 18:28:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 18:28:04] [INFO ] [Real]Absence check using state equation in 2812 ms returned sat
[2023-03-22 18:28:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 18:28:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-22 18:28:05] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 125 ms returned sat
[2023-03-22 18:28:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 18:28:07] [INFO ] [Nat]Absence check using state equation in 1895 ms returned sat
[2023-03-22 18:28:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:28:07] [INFO ] [Nat]Added 96 Read/Feed constraints in 308 ms returned sat
[2023-03-22 18:28:08] [INFO ] Deduced a trap composed of 56 places in 223 ms of which 0 ms to minimize.
[2023-03-22 18:28:08] [INFO ] Deduced a trap composed of 288 places in 236 ms of which 1 ms to minimize.
[2023-03-22 18:28:08] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 1 ms to minimize.
[2023-03-22 18:28:08] [INFO ] Deduced a trap composed of 55 places in 240 ms of which 0 ms to minimize.
[2023-03-22 18:28:09] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 1 ms to minimize.
[2023-03-22 18:28:09] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 2 ms to minimize.
[2023-03-22 18:28:09] [INFO ] Deduced a trap composed of 295 places in 230 ms of which 0 ms to minimize.
[2023-03-22 18:28:10] [INFO ] Deduced a trap composed of 298 places in 225 ms of which 2 ms to minimize.
[2023-03-22 18:28:10] [INFO ] Deduced a trap composed of 226 places in 243 ms of which 3 ms to minimize.
[2023-03-22 18:28:10] [INFO ] Deduced a trap composed of 55 places in 236 ms of which 1 ms to minimize.
[2023-03-22 18:28:11] [INFO ] Deduced a trap composed of 310 places in 237 ms of which 1 ms to minimize.
[2023-03-22 18:28:11] [INFO ] Deduced a trap composed of 228 places in 230 ms of which 0 ms to minimize.
[2023-03-22 18:28:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3768 ms
[2023-03-22 18:28:11] [INFO ] Computed and/alt/rep : 640/2790/632 causal constraints (skipped 408 transitions) in 66 ms.
[2023-03-22 18:28:15] [INFO ] Added : 272 causal constraints over 55 iterations in 3679 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Product exploration explored 100000 steps with 5143 reset in 473 ms.
Product exploration explored 100000 steps with 5137 reset in 515 ms.
Applying partial POR strategy [false, false, true, false, false, true, false]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1) p3), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p3), (AND (NOT p0) (NOT p1) p3)]
Support contains 89 out of 542 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 1058/1058 transitions.
Applied a total of 0 rules in 19 ms. Remains 542 /542 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2023-03-22 18:28:16] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:28:16] [INFO ] Invariant cache hit.
[2023-03-22 18:28:17] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
[2023-03-22 18:28:17] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 18:28:17] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:28:17] [INFO ] Invariant cache hit.
[2023-03-22 18:28:17] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1017 ms. Remains : 542/542 places, 1058/1058 transitions.
Support contains 89 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 1058/1058 transitions.
Applied a total of 0 rules in 3 ms. Remains 542 /542 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2023-03-22 18:28:17] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:28:17] [INFO ] Invariant cache hit.
[2023-03-22 18:28:18] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
[2023-03-22 18:28:18] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:28:18] [INFO ] Invariant cache hit.
[2023-03-22 18:28:18] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-22 18:28:18] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:28:18] [INFO ] Invariant cache hit.
[2023-03-22 18:28:19] [INFO ] State equation strengthened by 96 read => feed constraints.
[2023-03-22 18:28:23] [INFO ] Implicit Places using invariants and state equation in 4833 ms returned []
Implicit Place search using SMT with State Equation took 5234 ms to find 0 implicit places.
[2023-03-22 18:28:23] [INFO ] Flow matrix only has 1042 transitions (discarded 16 similar events)
[2023-03-22 18:28:23] [INFO ] Invariant cache hit.
[2023-03-22 18:28:24] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6219 ms. Remains : 542/542 places, 1058/1058 transitions.
Treatment of property PolyORBLF-COL-S02J06T08-LTLFireability-12 finished in 55497 ms.
[2023-03-22 18:28:24] [INFO ] Flatten gal took : 57 ms
[2023-03-22 18:28:24] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-22 18:28:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1178 transitions and 5036 arcs took 6 ms.
Total runtime 379039 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3649/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3649/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3649/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3649/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3649/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3649/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-LTLFireability-00
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-LTLFireability-06
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-LTLFireability-08
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-LTLFireability-09
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-LTLFireability-10
Could not compute solution for formula : PolyORBLF-COL-S02J06T08-LTLFireability-12
BK_STOP 1679510002382
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PolyORBLF-COL-S02J06T08-LTLFireability-00
ltl formula formula --ltl=/tmp/3649/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1178 transitions and 5036 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.040 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3649/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3649/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3649/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3649/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name PolyORBLF-COL-S02J06T08-LTLFireability-06
ltl formula formula --ltl=/tmp/3649/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1178 transitions and 5036 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3649/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3649/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3649/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.400 real 0.060 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3649/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PolyORBLF-COL-S02J06T08-LTLFireability-08
ltl formula formula --ltl=/tmp/3649/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1178 transitions and 5036 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.450 real 0.080 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3649/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3649/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3649/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3649/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name PolyORBLF-COL-S02J06T08-LTLFireability-09
ltl formula formula --ltl=/tmp/3649/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1178 transitions and 5036 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.420 real 0.060 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3649/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3649/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3649/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3649/ltl_3_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name PolyORBLF-COL-S02J06T08-LTLFireability-10
ltl formula formula --ltl=/tmp/3649/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1178 transitions and 5036 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.050 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3649/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3649/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3649/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3649/ltl_4_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55e1fda993f4]
1: pnml2lts-mc(+0xa2496) [0x55e1fda99496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2397cb4140]
3: pnml2lts-mc(+0x405be5) [0x55e1fddfcbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55e1fdb623f9]
5: pnml2lts-mc(+0x164ac4) [0x55e1fdb5bac4]
6: pnml2lts-mc(+0x272e0a) [0x55e1fdc69e0a]
7: pnml2lts-mc(+0xb61f0) [0x55e1fdaad1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f2397b074d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f2397b0767a]
10: pnml2lts-mc(+0xa1581) [0x55e1fda98581]
11: pnml2lts-mc(+0xa1910) [0x55e1fda98910]
12: pnml2lts-mc(+0xa32a2) [0x55e1fda9a2a2]
13: pnml2lts-mc(+0xa50f4) [0x55e1fda9c0f4]
14: pnml2lts-mc(+0xa516b) [0x55e1fda9c16b]
15: pnml2lts-mc(+0x3f34b3) [0x55e1fddea4b3]
16: pnml2lts-mc(+0x7c63d) [0x55e1fda7363d]
17: pnml2lts-mc(+0x67d86) [0x55e1fda5ed86]
18: pnml2lts-mc(+0x60a8a) [0x55e1fda57a8a]
19: pnml2lts-mc(+0x5eb15) [0x55e1fda55b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f2397aefd0a]
21: pnml2lts-mc(+0x6075e) [0x55e1fda5775e]
ltl formula name PolyORBLF-COL-S02J06T08-LTLFireability-12
ltl formula formula --ltl=/tmp/3649/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 1178 transitions and 5036 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.040 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3649/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3649/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3649/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3649/ltl_5_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
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-S02J06T08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S02J06T08, 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 r297-tall-167873950400380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J06T08.tgz
mv PolyORBLF-COL-S02J06T08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;