fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r229-tall-167856413400540
Last Updated
May 14, 2023

About the Execution of ITS-Tools for LeafsetExtension-PT-S64C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3037.724 214145.00 260212.00 863.60 FFFFFTFFFFFFFFFF 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.r229-tall-167856413400540.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 itstools
Input is LeafsetExtension-PT-S64C4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413400540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Feb 25 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 25 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679504800997

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-22 17:06:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 17:06:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:06:43] [INFO ] Load time of PNML (sax parser for PT used): 510 ms
[2023-03-22 17:06:43] [INFO ] Transformed 21462 places.
[2023-03-22 17:06:43] [INFO ] Transformed 21129 transitions.
[2023-03-22 17:06:43] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 658 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4229 places and 0 transitions.
Iterating post reduction 0 with 4229 rules applied. Total rules applied 4229 place count 17233 transition count 21129
Applied a total of 4229 rules in 305 ms. Remains 17233 /21462 variables (removed 4229) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-22 17:06:45] [INFO ] Computed 198 place invariants in 1823 ms
[2023-03-22 17:06:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:06:47] [INFO ] Implicit Places using invariants in 3519 ms returned []
Implicit Place search using SMT only with invariants took 3545 ms to find 0 implicit places.
[2023-03-22 17:06:47] [INFO ] Invariant cache hit.
[2023-03-22 17:06:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:06:48] [INFO ] Dead Transitions using invariants and state equation in 1613 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17233/21462 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5480 ms. Remains : 17233/21462 places, 21129/21129 transitions.
Support contains 47 out of 17233 places after structural reductions.
[2023-03-22 17:06:50] [INFO ] Flatten gal took : 902 ms
[2023-03-22 17:06:50] [INFO ] Flatten gal took : 570 ms
[2023-03-22 17:06:51] [INFO ] Input system was already deterministic with 21129 transitions.
Incomplete random walk after 10000 steps, including 300 resets, run finished after 715 ms. (steps per millisecond=13 ) properties (out of 29) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-22 17:06:52] [INFO ] Invariant cache hit.
[2023-03-22 17:06:58] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 427 ms returned sat
[2023-03-22 17:07:17] [INFO ] After 16015ms SMT Verify possible using state equation in real domain returned unsat :0 sat :15
[2023-03-22 17:07:17] [INFO ] After 16053ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 17:07:17] [INFO ] After 25069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :15
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 24 out of 17233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 38156 edges and 17233 vertex of which 909 are kept as prefixes of interest. Removing 16324 places using SCC suffix rule.31 ms
Discarding 16324 places :
Also discarding 12145 output transitions
Drop transitions removed 12145 transitions
Drop transitions removed 4056 transitions
Reduce isomorphic transitions removed 4056 transitions.
Drop transitions removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 4270 rules applied. Total rules applied 4271 place count 909 transition count 4714
Reduce places removed 216 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 220 rules applied. Total rules applied 4491 place count 693 transition count 4710
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 4502 place count 689 transition count 4703
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 4509 place count 682 transition count 4703
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 4509 place count 682 transition count 4696
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 4523 place count 675 transition count 4696
Discarding 205 places :
Symmetric choice reduction at 4 with 205 rule applications. Total rules 4728 place count 470 transition count 4491
Iterating global reduction 4 with 205 rules applied. Total rules applied 4933 place count 470 transition count 4491
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4936 place count 470 transition count 4488
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 4939 place count 467 transition count 4488
Partial Free-agglomeration rule applied 91 times.
Drop transitions removed 91 transitions
Iterating global reduction 5 with 91 rules applied. Total rules applied 5030 place count 467 transition count 4488
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 5031 place count 466 transition count 4488
Applied a total of 5031 rules in 725 ms. Remains 466 /17233 variables (removed 16767) and now considering 4488/21129 (removed 16641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 726 ms. Remains : 466/17233 places, 4488/21129 transitions.
Incomplete random walk after 10000 steps, including 724 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-22 17:07:19] [INFO ] Flow matrix only has 628 transitions (discarded 3860 similar events)
// Phase 1: matrix 628 rows 466 cols
[2023-03-22 17:07:19] [INFO ] Computed 7 place invariants in 13 ms
[2023-03-22 17:07:19] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-22 17:07:19] [INFO ] After 180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 17:07:19] [INFO ] After 226ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-22 17:07:19] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 4488/4488 transitions.
Graph (complete) has 1525 edges and 466 vertex of which 71 are kept as prefixes of interest. Removing 395 places using SCC suffix rule.1 ms
Discarding 395 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Drop transitions removed 4098 transitions
Reduce isomorphic transitions removed 4098 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 4099 rules applied. Total rules applied 4100 place count 70 transition count 133
Reduce places removed 62 places and 0 transitions.
Drop transitions removed 61 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 1 with 184 rules applied. Total rules applied 4284 place count 8 transition count 11
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 4286 place count 8 transition count 9
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4287 place count 8 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4288 place count 7 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 4290 place count 7 transition count 6
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4291 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4292 place count 6 transition count 5
Applied a total of 4292 rules in 14 ms. Remains 6 /466 variables (removed 460) and now considering 5/4488 (removed 4483) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 6/466 places, 5/4488 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&X(F((p2&&F(p1)))))))'
Support contains 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 88 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-22 17:07:21] [INFO ] Computed 198 place invariants in 1757 ms
[2023-03-22 17:07:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:23] [INFO ] Implicit Places using invariants in 3385 ms returned []
Implicit Place search using SMT only with invariants took 3390 ms to find 0 implicit places.
[2023-03-22 17:07:23] [INFO ] Invariant cache hit.
[2023-03-22 17:07:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:24] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5002 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s9385 1), p0:(GEQ s9247 1), p2:(LT s8917 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-00 finished in 5484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((F(G(p2))&&p1))&&p0))))'
Support contains 5 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 68 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 17:07:25] [INFO ] Invariant cache hit.
[2023-03-22 17:07:26] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:27] [INFO ] Implicit Places using invariants in 1643 ms returned []
Implicit Place search using SMT only with invariants took 1646 ms to find 0 implicit places.
[2023-03-22 17:07:27] [INFO ] Invariant cache hit.
[2023-03-22 17:07:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:28] [INFO ] Dead Transitions using invariants and state equation in 1640 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3361 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s5726 1) (GEQ s5261 1) (GEQ s7889 1)), p1:(AND (GEQ s5261 1) (GEQ s7889 1)), p2:(AND (GEQ s2631 1) (GEQ s12098 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-01 finished in 3639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&X((F(!p1)&&p2)))))'
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 75 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 17:07:29] [INFO ] Invariant cache hit.
[2023-03-22 17:07:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:30] [INFO ] Implicit Places using invariants in 1563 ms returned []
Implicit Place search using SMT only with invariants took 1564 ms to find 0 implicit places.
[2023-03-22 17:07:30] [INFO ] Invariant cache hit.
[2023-03-22 17:07:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:32] [INFO ] Dead Transitions using invariants and state equation in 1632 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3274 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 438 ms :[(NOT p0), (NOT p1), (OR (NOT p2) p1), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1, (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s5524 1) (GEQ s10783 1)), p1:(AND (GEQ s1 1) (GEQ s15780 1)), p2:(AND (GEQ s5524 1) (GEQ s10783 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 1 reset in 5 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-02 finished in 3792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&F(p1)) U (G((p0&&F(p1)))||(p0&&F(p1)&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2)))))))))'
Support contains 6 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 73 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 17:07:32] [INFO ] Invariant cache hit.
[2023-03-22 17:07:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:34] [INFO ] Implicit Places using invariants in 1614 ms returned []
Implicit Place search using SMT only with invariants took 1617 ms to find 0 implicit places.
[2023-03-22 17:07:34] [INFO ] Invariant cache hit.
[2023-03-22 17:07:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:36] [INFO ] Dead Transitions using invariants and state equation in 1618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3315 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2 p3) (AND (NOT p0) p2)), p2, p2, (AND (NOT p1) p3 p2)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p3 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p3), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=5 dest: 8}], [{ cond=p2, acceptance={} source=6 dest: 2}], [{ cond=true, acceptance={} source=7 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p3 p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p3 p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(GEQ s10787 1), p1:(GEQ s9279 1), p3:(AND (GEQ s13534 1) (GEQ s13673 1)), p2:(AND (GEQ s15722 1) (GEQ s15779 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-04 finished in 3796 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 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.58 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8319 transitions
Trivial Post-agglo rules discarded 8319 transitions
Performed 8319 trivial Post agglomeration. Transition count delta: 8319
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8320 place count 17231 transition count 12808
Reduce places removed 8319 places and 0 transitions.
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12678
Deduced a syphon composed of 130 places in 5 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16899 place count 8782 transition count 12678
Discarding 4029 places :
Symmetric choice reduction at 2 with 4029 rule applications. Total rules 20928 place count 4753 transition count 8649
Iterating global reduction 2 with 4029 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24957 place count 4753 transition count 8648
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24959 place count 4752 transition count 8648
Applied a total of 24959 rules in 2336 ms. Remains 4752 /17233 variables (removed 12481) and now considering 8648/21129 (removed 12481) transitions.
// Phase 1: matrix 8648 rows 4752 cols
[2023-03-22 17:07:39] [INFO ] Computed 198 place invariants in 111 ms
[2023-03-22 17:07:39] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:42] [INFO ] Implicit Places using invariants in 3395 ms returned [391, 426, 2451, 3343, 3660]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3401 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4747/17233 places, 8648/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4745 transition count 8646
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4745 transition count 8646
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4743 transition count 8644
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4743 transition count 8644
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 53 place count 4698 transition count 8599
Iterating global reduction 0 with 45 rules applied. Total rules applied 98 place count 4698 transition count 8599
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 0 with 130 rules applied. Total rules applied 228 place count 4633 transition count 8534
Applied a total of 228 rules in 2561 ms. Remains 4633 /4747 variables (removed 114) and now considering 8534/8648 (removed 114) transitions.
[2023-03-22 17:07:44] [INFO ] Flow matrix only has 8489 transitions (discarded 45 similar events)
// Phase 1: matrix 8489 rows 4633 cols
[2023-03-22 17:07:44] [INFO ] Computed 193 place invariants in 92 ms
[2023-03-22 17:07:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:48] [INFO ] Implicit Places using invariants in 3398 ms returned [1472, 2873, 3472, 3977, 4085]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3407 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4628/17233 places, 8534/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4624 transition count 8530
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4624 transition count 8530
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 4620 transition count 8526
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 4620 transition count 8526
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 125 place count 4511 transition count 8417
Iterating global reduction 0 with 109 rules applied. Total rules applied 234 place count 4511 transition count 8417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 236 place count 4510 transition count 8416
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 237 place count 4509 transition count 8415
Iterating global reduction 0 with 1 rules applied. Total rules applied 238 place count 4509 transition count 8415
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 269 place count 4478 transition count 8384
Iterating global reduction 0 with 31 rules applied. Total rules applied 300 place count 4478 transition count 8384
Applied a total of 300 rules in 3473 ms. Remains 4478 /4628 variables (removed 150) and now considering 8384/8534 (removed 150) transitions.
[2023-03-22 17:07:51] [INFO ] Flow matrix only has 8196 transitions (discarded 188 similar events)
// Phase 1: matrix 8196 rows 4478 cols
[2023-03-22 17:07:51] [INFO ] Computed 188 place invariants in 89 ms
[2023-03-22 17:07:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:07:54] [INFO ] Implicit Places using invariants in 3178 ms returned [702, 1611, 1821, 3162, 4037]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3185 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4473/17233 places, 8384/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4469 transition count 8380
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4469 transition count 8380
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 4466 transition count 8377
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 4466 transition count 8377
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 89 place count 4391 transition count 8302
Iterating global reduction 0 with 75 rules applied. Total rules applied 164 place count 4391 transition count 8302
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 284 place count 4331 transition count 8242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 285 place count 4330 transition count 8241
Iterating global reduction 0 with 1 rules applied. Total rules applied 286 place count 4330 transition count 8241
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 322 place count 4294 transition count 8205
Iterating global reduction 0 with 36 rules applied. Total rules applied 358 place count 4294 transition count 8205
Applied a total of 358 rules in 3403 ms. Remains 4294 /4473 variables (removed 179) and now considering 8205/8384 (removed 179) transitions.
[2023-03-22 17:07:58] [INFO ] Flow matrix only has 7902 transitions (discarded 303 similar events)
// Phase 1: matrix 7902 rows 4294 cols
[2023-03-22 17:07:58] [INFO ] Computed 183 place invariants in 80 ms
[2023-03-22 17:07:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:08:01] [INFO ] Implicit Places using invariants in 3147 ms returned [1529, 2193, 2335, 2645, 2680]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3152 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4289/17233 places, 8205/21129 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 4258 transition count 8174
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 4258 transition count 8174
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 4255 transition count 8171
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 4255 transition count 8171
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 159 place count 4164 transition count 8080
Iterating global reduction 0 with 91 rules applied. Total rules applied 250 place count 4164 transition count 8080
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 0 with 172 rules applied. Total rules applied 422 place count 4078 transition count 7994
Applied a total of 422 rules in 2110 ms. Remains 4078 /4289 variables (removed 211) and now considering 7994/8205 (removed 211) transitions.
[2023-03-22 17:08:03] [INFO ] Flow matrix only has 7594 transitions (discarded 400 similar events)
// Phase 1: matrix 7594 rows 4078 cols
[2023-03-22 17:08:03] [INFO ] Computed 178 place invariants in 88 ms
[2023-03-22 17:08:06] [INFO ] Implicit Places using invariants in 2839 ms returned [502, 1729, 3177, 3761]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2844 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 4074/17233 places, 7994/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4071 transition count 7991
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4071 transition count 7991
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4068 transition count 7988
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4068 transition count 7988
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 103 place count 3977 transition count 7897
Iterating global reduction 0 with 91 rules applied. Total rules applied 194 place count 3977 transition count 7897
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 196 place count 3976 transition count 7896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 3975 transition count 7895
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 3975 transition count 7895
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 229 place count 3944 transition count 7864
Iterating global reduction 0 with 31 rules applied. Total rules applied 260 place count 3944 transition count 7864
Applied a total of 260 rules in 2642 ms. Remains 3944 /4074 variables (removed 130) and now considering 7864/7994 (removed 130) transitions.
[2023-03-22 17:08:09] [INFO ] Flow matrix only has 7336 transitions (discarded 528 similar events)
// Phase 1: matrix 7336 rows 3944 cols
[2023-03-22 17:08:09] [INFO ] Computed 174 place invariants in 88 ms
[2023-03-22 17:08:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:08:11] [INFO ] Implicit Places using invariants in 2621 ms returned [435, 1491, 2379, 3112]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2627 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3940/17233 places, 7864/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3937 transition count 7861
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3937 transition count 7861
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 3935 transition count 7859
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 3935 transition count 7859
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 69 place count 3876 transition count 7800
Iterating global reduction 0 with 59 rules applied. Total rules applied 128 place count 3876 transition count 7800
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 0 with 116 rules applied. Total rules applied 244 place count 3818 transition count 7742
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 245 place count 3817 transition count 7741
Iterating global reduction 0 with 1 rules applied. Total rules applied 246 place count 3817 transition count 7741
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 276 place count 3787 transition count 7711
Iterating global reduction 0 with 30 rules applied. Total rules applied 306 place count 3787 transition count 7711
Applied a total of 306 rules in 2505 ms. Remains 3787 /3940 variables (removed 153) and now considering 7711/7864 (removed 153) transitions.
[2023-03-22 17:08:14] [INFO ] Flow matrix only has 7086 transitions (discarded 625 similar events)
// Phase 1: matrix 7086 rows 3787 cols
[2023-03-22 17:08:14] [INFO ] Computed 170 place invariants in 71 ms
[2023-03-22 17:08:16] [INFO ] Implicit Places using invariants in 2626 ms returned [1089, 1605, 1672, 2039, 2624]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2631 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 3782/17233 places, 7711/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3778 transition count 7707
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3778 transition count 7707
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3775 transition count 7704
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3775 transition count 7704
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 104 place count 3685 transition count 7614
Iterating global reduction 0 with 90 rules applied. Total rules applied 194 place count 3685 transition count 7614
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 0 with 112 rules applied. Total rules applied 306 place count 3629 transition count 7558
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 307 place count 3628 transition count 7557
Iterating global reduction 0 with 1 rules applied. Total rules applied 308 place count 3628 transition count 7557
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 337 place count 3599 transition count 7528
Iterating global reduction 0 with 29 rules applied. Total rules applied 366 place count 3599 transition count 7528
Applied a total of 366 rules in 2376 ms. Remains 3599 /3782 variables (removed 183) and now considering 7528/7711 (removed 183) transitions.
[2023-03-22 17:08:19] [INFO ] Flow matrix only has 6774 transitions (discarded 754 similar events)
// Phase 1: matrix 6774 rows 3599 cols
[2023-03-22 17:08:19] [INFO ] Computed 165 place invariants in 55 ms
[2023-03-22 17:08:21] [INFO ] Implicit Places using invariants in 2546 ms returned [130, 649, 1072, 3191, 3393]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2560 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 3594/17233 places, 7528/21129 transitions.
Discarding 108 places :
Symmetric choice reduction at 0 with 108 rule applications. Total rules 108 place count 3486 transition count 7420
Iterating global reduction 0 with 108 rules applied. Total rules applied 216 place count 3486 transition count 7420
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 217 place count 3485 transition count 7419
Iterating global reduction 0 with 1 rules applied. Total rules applied 218 place count 3485 transition count 7419
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 244 place count 3459 transition count 7393
Iterating global reduction 0 with 26 rules applied. Total rules applied 270 place count 3459 transition count 7393
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 0 with 208 rules applied. Total rules applied 478 place count 3355 transition count 7289
Applied a total of 478 rules in 1496 ms. Remains 3355 /3594 variables (removed 239) and now considering 7289/7528 (removed 239) transitions.
[2023-03-22 17:08:23] [INFO ] Flow matrix only has 6504 transitions (discarded 785 similar events)
// Phase 1: matrix 6504 rows 3355 cols
[2023-03-22 17:08:23] [INFO ] Computed 160 place invariants in 57 ms
[2023-03-22 17:08:26] [INFO ] Implicit Places using invariants in 3599 ms returned [2, 29, 61, 64, 91, 125, 151, 183, 186, 212, 244, 247, 273, 305, 308, 368, 395, 398, 425, 428, 454, 486, 489, 515, 547, 576, 610, 636, 668, 671, 697, 729, 732, 758, 790, 793, 819, 851, 854, 880, 912, 915, 941, 973, 976, 1006, 1032, 1064, 1067, 1093, 1125, 1128, 1154, 1186, 1198, 1229, 1232, 1259, 1264, 1297, 1323, 1355, 1358, 1384, 1416, 1421, 1454, 1481, 1484, 1511, 1514, 1540, 1572, 1575, 1601, 1633, 1636, 1662, 1694, 1696, 1698, 1725, 1759, 1785, 1817, 1826, 1829, 1858, 1861, 1887, 1919, 1922, 1948, 1980, 1983, 2009, 2041, 2043, 2077, 2109, 2112, 2141, 2144, 2170, 2202, 2205, 2231, 2263, 2294, 2326, 2328, 2362, 2388, 2420, 2422, 2453, 2456, 2482, 2514, 2517, 2543, 2575, 2577, 2608, 2611, 2648, 2652, 2655, 2681, 2713, 2716, 2742, 2774, 2777, 2803, 2835, 2838, 2864, 2896, 2899, 2932, 2935, 2961, 2995, 3026, 3029, 3059, 3062, 3088, 3120, 3122, 3153, 3156, 3187, 3190, 3216, 3248]
Discarding 157 places :
Implicit Place search using SMT only with invariants took 3605 ms to find 157 implicit places.
Starting structural reductions in SI_LTL mode, iteration 9 : 3198/17233 places, 7289/21129 transitions.
Discarding 2850 places :
Symmetric choice reduction at 0 with 2850 rule applications. Total rules 2850 place count 348 transition count 4439
Iterating global reduction 0 with 2850 rules applied. Total rules applied 5700 place count 348 transition count 4439
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 5800 place count 248 transition count 4339
Iterating global reduction 0 with 100 rules applied. Total rules applied 5900 place count 248 transition count 4339
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 6000 place count 148 transition count 4239
Iterating global reduction 0 with 100 rules applied. Total rules applied 6100 place count 148 transition count 4239
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 6110 place count 143 transition count 4234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6111 place count 142 transition count 4233
Iterating global reduction 0 with 1 rules applied. Total rules applied 6112 place count 142 transition count 4233
Applied a total of 6112 rules in 167 ms. Remains 142 /3198 variables (removed 3056) and now considering 4233/7289 (removed 3056) transitions.
[2023-03-22 17:08:27] [INFO ] Flow matrix only has 171 transitions (discarded 4062 similar events)
// Phase 1: matrix 171 rows 142 cols
[2023-03-22 17:08:27] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-22 17:08:27] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-22 17:08:27] [INFO ] Flow matrix only has 171 transitions (discarded 4062 similar events)
[2023-03-22 17:08:27] [INFO ] Invariant cache hit.
[2023-03-22 17:08:27] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 10 : 142/17233 places, 4233/21129 transitions.
Finished structural reductions in SI_LTL mode , in 10 iterations and 51212 ms. Remains : 142/17233 places, 4233/21129 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-05 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:(LT s94 1), p1:(AND (GEQ s27 1) (GEQ s134 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 6954 reset in 678 ms.
Product exploration explored 100000 steps with 6956 reset in 648 ms.
Computed a total of 142 stabilizing places and 4233 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 142 transition count 4233
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-05 finished in 53319 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((X(p0)||G(p1))) U (p2 U p3)))'
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8316 transitions
Trivial Post-agglo rules discarded 8316 transitions
Performed 8316 trivial Post agglomeration. Transition count delta: 8316
Iterating post reduction 0 with 8316 rules applied. Total rules applied 8317 place count 17231 transition count 12811
Reduce places removed 8316 places and 0 transitions.
Iterating post reduction 1 with 8316 rules applied. Total rules applied 16633 place count 8915 transition count 12811
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16633 place count 8915 transition count 12681
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16893 place count 8785 transition count 12681
Discarding 4030 places :
Symmetric choice reduction at 2 with 4030 rule applications. Total rules 20923 place count 4755 transition count 8651
Iterating global reduction 2 with 4030 rules applied. Total rules applied 24953 place count 4755 transition count 8651
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 24953 place count 4755 transition count 8649
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Applied a total of 24957 rules in 2181 ms. Remains 4753 /17233 variables (removed 12480) and now considering 8649/21129 (removed 12480) transitions.
// Phase 1: matrix 8649 rows 4753 cols
[2023-03-22 17:08:32] [INFO ] Computed 198 place invariants in 97 ms
[2023-03-22 17:08:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:08:35] [INFO ] Implicit Places using invariants in 3551 ms returned [320, 710, 994, 1846, 4230]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3559 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4748/17233 places, 8649/21129 transitions.
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 128 place count 4620 transition count 8521
Iterating global reduction 0 with 128 rules applied. Total rules applied 256 place count 4620 transition count 8521
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 257 place count 4619 transition count 8520
Iterating global reduction 0 with 1 rules applied. Total rules applied 258 place count 4619 transition count 8520
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 263 place count 4614 transition count 8515
Iterating global reduction 0 with 5 rules applied. Total rules applied 268 place count 4614 transition count 8515
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 0 with 130 rules applied. Total rules applied 398 place count 4549 transition count 8450
Applied a total of 398 rules in 2823 ms. Remains 4549 /4748 variables (removed 199) and now considering 8450/8649 (removed 199) transitions.
[2023-03-22 17:08:38] [INFO ] Flow matrix only has 8445 transitions (discarded 5 similar events)
// Phase 1: matrix 8445 rows 4549 cols
[2023-03-22 17:08:38] [INFO ] Computed 193 place invariants in 89 ms
[2023-03-22 17:08:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:08:41] [INFO ] Implicit Places using invariants in 3320 ms returned [1291, 1362, 1702, 2588, 4352]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3329 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4544/17233 places, 8450/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4541 transition count 8447
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4541 transition count 8447
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4538 transition count 8444
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4538 transition count 8444
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 89 place count 4461 transition count 8367
Iterating global reduction 0 with 77 rules applied. Total rules applied 166 place count 4461 transition count 8367
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 288 place count 4400 transition count 8306
Applied a total of 288 rules in 2523 ms. Remains 4400 /4544 variables (removed 144) and now considering 8306/8450 (removed 144) transitions.
[2023-03-22 17:08:44] [INFO ] Flow matrix only has 8216 transitions (discarded 90 similar events)
// Phase 1: matrix 8216 rows 4400 cols
[2023-03-22 17:08:44] [INFO ] Computed 188 place invariants in 90 ms
[2023-03-22 17:08:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:08:47] [INFO ] Implicit Places using invariants in 3369 ms returned [1681, 1915, 2252, 2633, 3235]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3375 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4395/17233 places, 8306/21129 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 4328 transition count 8239
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 4328 transition count 8239
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 136 place count 4326 transition count 8237
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 4326 transition count 8237
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 197 place count 4267 transition count 8178
Iterating global reduction 0 with 59 rules applied. Total rules applied 256 place count 4267 transition count 8178
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 0 with 246 rules applied. Total rules applied 502 place count 4144 transition count 8055
Applied a total of 502 rules in 2266 ms. Remains 4144 /4395 variables (removed 251) and now considering 8055/8306 (removed 251) transitions.
[2023-03-22 17:08:49] [INFO ] Flow matrix only has 7898 transitions (discarded 157 similar events)
// Phase 1: matrix 7898 rows 4144 cols
[2023-03-22 17:08:50] [INFO ] Computed 183 place invariants in 83 ms
[2023-03-22 17:08:52] [INFO ] Implicit Places using invariants in 2929 ms returned [1218, 2247, 2517, 2931, 3156]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2950 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4139/17233 places, 8055/21129 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 4073 transition count 7989
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 4073 transition count 7989
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 4070 transition count 7986
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 4070 transition count 7986
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 220 place count 3988 transition count 7904
Iterating global reduction 0 with 82 rules applied. Total rules applied 302 place count 3988 transition count 7904
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 0 with 124 rules applied. Total rules applied 426 place count 3926 transition count 7842
Applied a total of 426 rules in 2459 ms. Remains 3926 /4139 variables (removed 213) and now considering 7842/8055 (removed 213) transitions.
[2023-03-22 17:08:55] [INFO ] Flow matrix only has 7588 transitions (discarded 254 similar events)
// Phase 1: matrix 7588 rows 3926 cols
[2023-03-22 17:08:55] [INFO ] Computed 178 place invariants in 77 ms
[2023-03-22 17:08:57] [INFO ] Implicit Places using invariants in 2620 ms returned [189, 2532, 3047, 3261, 3482]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2626 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 3921/17233 places, 7842/21129 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3916 transition count 7837
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3916 transition count 7837
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 3911 transition count 7832
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 3911 transition count 7832
Discarding 123 places :
Symmetric choice reduction at 0 with 123 rule applications. Total rules 143 place count 3788 transition count 7709
Iterating global reduction 0 with 123 rules applied. Total rules applied 266 place count 3788 transition count 7709
Applied a total of 266 rules in 1640 ms. Remains 3788 /3921 variables (removed 133) and now considering 7709/7842 (removed 133) transitions.
[2023-03-22 17:08:59] [INFO ] Flow matrix only has 7309 transitions (discarded 400 similar events)
// Phase 1: matrix 7309 rows 3788 cols
[2023-03-22 17:08:59] [INFO ] Computed 173 place invariants in 76 ms
[2023-03-22 17:09:02] [INFO ] Implicit Places using invariants in 2708 ms returned [869, 1114, 2295, 2717, 3574]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2713 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3783/17233 places, 7709/21129 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 3721 transition count 7647
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 3721 transition count 7647
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 3719 transition count 7645
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 3719 transition count 7645
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 3665 transition count 7591
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 3665 transition count 7591
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 0 with 226 rules applied. Total rules applied 462 place count 3552 transition count 7478
Applied a total of 462 rules in 1869 ms. Remains 3552 /3783 variables (removed 231) and now considering 7478/7709 (removed 231) transitions.
[2023-03-22 17:09:04] [INFO ] Flow matrix only has 7012 transitions (discarded 466 similar events)
// Phase 1: matrix 7012 rows 3552 cols
[2023-03-22 17:09:04] [INFO ] Computed 168 place invariants in 65 ms
[2023-03-22 17:09:08] [INFO ] Implicit Places using invariants in 3838 ms returned [3, 29, 59, 62, 88, 118, 121, 147, 177, 205, 235, 238, 293, 296, 322, 352, 355, 381, 411, 414, 440, 470, 473, 499, 529, 532, 559, 591, 617, 647, 650, 676, 706, 709, 735, 765, 768, 795, 835, 864, 867, 893, 923, 926, 952, 982, 985, 1012, 1044, 1071, 1105, 1134, 1137, 1166, 1169, 1195, 1225, 1228, 1254, 1284, 1287, 1313, 1343, 1346, 1372, 1402, 1412, 1438, 1468, 1471, 1497, 1527, 1530, 1557, 1589, 1616, 1646, 1649, 1675, 1705, 1708, 1734, 1764, 1766, 1768, 1794, 1824, 1827, 1854, 1886, 1913, 1942, 1945, 1972, 2004, 2031, 2060, 2063, 2090, 2119, 2127, 2158, 2185, 2214, 2217, 2245, 2248, 2276, 2279, 2306, 2335, 2338, 2374, 2377, 2404, 2433, 2436, 2464, 2493, 2496, 2523, 2553, 2560, 2563, 2590, 2622, 2649, 2678, 2681, 2708, 2740, 2767, 2796, 2799, 2827, 2830, 2857, 2886, 2889, 2916, 2945, 2948, 2984, 2987, 3014, 3043, 3046, 3073, 3102, 3105, 3132, 3161, 3168, 3171, 3198, 3227, 3230, 3257, 3286, 3289, 3316, 3348, 3375, 3404, 3407, 3435]
Discarding 166 places :
Implicit Place search using SMT only with invariants took 3844 ms to find 166 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 3386/17233 places, 7478/21129 transitions.
Discarding 3015 places :
Symmetric choice reduction at 0 with 3015 rule applications. Total rules 3015 place count 371 transition count 4463
Iterating global reduction 0 with 3015 rules applied. Total rules applied 6030 place count 371 transition count 4463
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 6142 place count 259 transition count 4351
Iterating global reduction 0 with 112 rules applied. Total rules applied 6254 place count 259 transition count 4351
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 6366 place count 147 transition count 4239
Iterating global reduction 0 with 112 rules applied. Total rules applied 6478 place count 147 transition count 4239
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6482 place count 145 transition count 4237
Applied a total of 6482 rules in 154 ms. Remains 145 /3386 variables (removed 3241) and now considering 4237/7478 (removed 3241) transitions.
[2023-03-22 17:09:08] [INFO ] Flow matrix only has 147 transitions (discarded 4090 similar events)
// Phase 1: matrix 147 rows 145 cols
[2023-03-22 17:09:08] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-22 17:09:08] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-22 17:09:08] [INFO ] Flow matrix only has 147 transitions (discarded 4090 similar events)
[2023-03-22 17:09:08] [INFO ] Invariant cache hit.
[2023-03-22 17:09:08] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 145/17233 places, 4237/21129 transitions.
Finished structural reductions in SI_LTL mode , in 8 iterations and 39052 ms. Remains : 145/17233 places, 4237/21129 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p3), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(GEQ s101 1), p2:(GEQ s97 1), p1:(LT s121 1), p0:(LT s63 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8918 steps with 2968 reset in 63 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-06 finished in 39232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 63 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-22 17:09:10] [INFO ] Computed 198 place invariants in 1531 ms
[2023-03-22 17:09:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:12] [INFO ] Implicit Places using invariants in 3115 ms returned []
Implicit Place search using SMT only with invariants took 3116 ms to find 0 implicit places.
[2023-03-22 17:09:12] [INFO ] Invariant cache hit.
[2023-03-22 17:09:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:13] [INFO ] Dead Transitions using invariants and state equation in 1576 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4759 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s2816 1) (GEQ s12625 1) (GEQ s2170 1) (GEQ s4734 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-07 finished in 4920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 3 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 75 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 17:09:14] [INFO ] Invariant cache hit.
[2023-03-22 17:09:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:15] [INFO ] Implicit Places using invariants in 1579 ms returned []
Implicit Place search using SMT only with invariants took 1583 ms to find 0 implicit places.
[2023-03-22 17:09:15] [INFO ] Invariant cache hit.
[2023-03-22 17:09:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:17] [INFO ] Dead Transitions using invariants and state equation in 1444 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3108 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s10487 1), p0:(OR (LT s10521 1) (LT s14624 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11600 steps with 349 reset in 237 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-08 finished in 3573 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)&&F(p1))))'
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 65 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 17:09:17] [INFO ] Invariant cache hit.
[2023-03-22 17:09:18] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:19] [INFO ] Implicit Places using invariants in 1420 ms returned []
Implicit Place search using SMT only with invariants took 1422 ms to find 0 implicit places.
[2023-03-22 17:09:19] [INFO ] Invariant cache hit.
[2023-03-22 17:09:20] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:20] [INFO ] Dead Transitions using invariants and state equation in 1619 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3109 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s6806 1), p0:(AND (LT s12555 1) (OR (LT s6199 1) (LT s10258 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7304 steps with 2434 reset in 592 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-09 finished in 3946 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 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 71 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 17:09:21] [INFO ] Invariant cache hit.
[2023-03-22 17:09:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:23] [INFO ] Implicit Places using invariants in 1638 ms returned []
Implicit Place search using SMT only with invariants took 1640 ms to find 0 implicit places.
[2023-03-22 17:09:23] [INFO ] Invariant cache hit.
[2023-03-22 17:09:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:24] [INFO ] Dead Transitions using invariants and state equation in 1622 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3335 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-10 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 s3419 1) (GEQ s13727 1)) (AND (GEQ s6143 1) (GEQ s6575 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]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-10 finished in 3465 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 2 out of 17233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Graph (complete) has 42513 edges and 17233 vertex of which 17231 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8256 transitions
Trivial Post-agglo rules discarded 8256 transitions
Performed 8256 trivial Post agglomeration. Transition count delta: 8256
Iterating post reduction 0 with 8256 rules applied. Total rules applied 8257 place count 17231 transition count 12871
Reduce places removed 8256 places and 0 transitions.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 1 with 8320 rules applied. Total rules applied 16577 place count 8975 transition count 12807
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 16641 place count 8911 transition count 12807
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 16641 place count 8911 transition count 12677
Deduced a syphon composed of 130 places in 3 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 16901 place count 8781 transition count 12677
Discarding 4030 places :
Symmetric choice reduction at 3 with 4030 rule applications. Total rules 20931 place count 4751 transition count 8647
Iterating global reduction 3 with 4030 rules applied. Total rules applied 24961 place count 4751 transition count 8647
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24961 place count 4751 transition count 8645
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24965 place count 4749 transition count 8645
Applied a total of 24965 rules in 2329 ms. Remains 4749 /17233 variables (removed 12484) and now considering 8645/21129 (removed 12484) transitions.
// Phase 1: matrix 8645 rows 4749 cols
[2023-03-22 17:09:27] [INFO ] Computed 198 place invariants in 95 ms
[2023-03-22 17:09:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:30] [INFO ] Implicit Places using invariants in 3636 ms returned [145, 462, 2522, 2557, 2773]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3645 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4744/17233 places, 8645/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4742 transition count 8643
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4742 transition count 8643
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4740 transition count 8641
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4740 transition count 8641
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 39 place count 4709 transition count 8610
Iterating global reduction 0 with 31 rules applied. Total rules applied 70 place count 4709 transition count 8610
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 0 with 128 rules applied. Total rules applied 198 place count 4645 transition count 8546
Applied a total of 198 rules in 3126 ms. Remains 4645 /4744 variables (removed 99) and now considering 8546/8645 (removed 99) transitions.
[2023-03-22 17:09:34] [INFO ] Flow matrix only has 8515 transitions (discarded 31 similar events)
// Phase 1: matrix 8515 rows 4645 cols
[2023-03-22 17:09:34] [INFO ] Computed 193 place invariants in 89 ms
[2023-03-22 17:09:34] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:37] [INFO ] Implicit Places using invariants in 3428 ms returned [911, 1258, 1644, 1854, 3957]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3434 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4640/17233 places, 8546/21129 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 4635 transition count 8541
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 4635 transition count 8541
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 4631 transition count 8537
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 4631 transition count 8537
Discarding 126 places :
Symmetric choice reduction at 0 with 126 rule applications. Total rules 144 place count 4505 transition count 8411
Iterating global reduction 0 with 126 rules applied. Total rules applied 270 place count 4505 transition count 8411
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 392 place count 4444 transition count 8350
Applied a total of 392 rules in 2888 ms. Remains 4444 /4640 variables (removed 196) and now considering 8350/8546 (removed 196) transitions.
[2023-03-22 17:09:40] [INFO ] Flow matrix only has 8190 transitions (discarded 160 similar events)
// Phase 1: matrix 8190 rows 4444 cols
[2023-03-22 17:09:40] [INFO ] Computed 188 place invariants in 87 ms
[2023-03-22 17:09:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:43] [INFO ] Implicit Places using invariants in 3255 ms returned [1253, 2188, 2329, 3281, 3315]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3275 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4439/17233 places, 8350/21129 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 4405 transition count 8316
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 4405 transition count 8316
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 4402 transition count 8313
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 4402 transition count 8313
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 154 place count 4322 transition count 8233
Iterating global reduction 0 with 80 rules applied. Total rules applied 234 place count 4322 transition count 8233
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 0 with 182 rules applied. Total rules applied 416 place count 4231 transition count 8142
Applied a total of 416 rules in 2656 ms. Remains 4231 /4439 variables (removed 208) and now considering 8142/8350 (removed 208) transitions.
[2023-03-22 17:09:46] [INFO ] Flow matrix only has 7899 transitions (discarded 243 similar events)
// Phase 1: matrix 7899 rows 4231 cols
[2023-03-22 17:09:46] [INFO ] Computed 183 place invariants in 82 ms
[2023-03-22 17:09:46] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:09:49] [INFO ] Implicit Places using invariants in 2991 ms returned [270, 668, 2227, 2319, 2752]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2999 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4226/17233 places, 8142/21129 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 4163 transition count 8079
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 4163 transition count 8079
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 4161 transition count 8077
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 4161 transition count 8077
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 191 place count 4100 transition count 8016
Iterating global reduction 0 with 61 rules applied. Total rules applied 252 place count 4100 transition count 8016
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 2 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 0 with 236 rules applied. Total rules applied 488 place count 3982 transition count 7898
Applied a total of 488 rules in 2415 ms. Remains 3982 /4226 variables (removed 244) and now considering 7898/8142 (removed 244) transitions.
[2023-03-22 17:09:51] [INFO ] Flow matrix only has 7588 transitions (discarded 310 similar events)
// Phase 1: matrix 7588 rows 3982 cols
[2023-03-22 17:09:51] [INFO ] Computed 178 place invariants in 74 ms
[2023-03-22 17:09:54] [INFO ] Implicit Places using invariants in 2645 ms returned [579, 939, 1357, 1906, 1939]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2650 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 3977/17233 places, 7898/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3973 transition count 7894
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3973 transition count 7894
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 3969 transition count 7890
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 3969 transition count 7890
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 128 place count 3857 transition count 7778
Iterating global reduction 0 with 112 rules applied. Total rules applied 240 place count 3857 transition count 7778
Applied a total of 240 rules in 1695 ms. Remains 3857 /3977 variables (removed 120) and now considering 7778/7898 (removed 120) transitions.
[2023-03-22 17:09:56] [INFO ] Flow matrix only has 7340 transitions (discarded 438 similar events)
// Phase 1: matrix 7340 rows 3857 cols
[2023-03-22 17:09:56] [INFO ] Computed 173 place invariants in 71 ms
[2023-03-22 17:09:58] [INFO ] Implicit Places using invariants in 2791 ms returned [354, 1298, 2875, 2939, 3006]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2796 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3852/17233 places, 7778/21129 transitions.
Discarding 114 places :
Symmetric choice reduction at 0 with 114 rule applications. Total rules 114 place count 3738 transition count 7664
Iterating global reduction 0 with 114 rules applied. Total rules applied 228 place count 3738 transition count 7664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 229 place count 3737 transition count 7663
Iterating global reduction 0 with 1 rules applied. Total rules applied 230 place count 3737 transition count 7663
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 259 place count 3708 transition count 7634
Iterating global reduction 0 with 29 rules applied. Total rules applied 288 place count 3708 transition count 7634
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 0 with 228 rules applied. Total rules applied 516 place count 3594 transition count 7520
Applied a total of 516 rules in 1920 ms. Remains 3594 /3852 variables (removed 258) and now considering 7520/7778 (removed 258) transitions.
[2023-03-22 17:10:00] [INFO ] Flow matrix only has 7048 transitions (discarded 472 similar events)
// Phase 1: matrix 7048 rows 3594 cols
[2023-03-22 17:10:00] [INFO ] Computed 168 place invariants in 70 ms
[2023-03-22 17:10:04] [INFO ] Implicit Places using invariants in 4022 ms returned [3, 31, 60, 63, 91, 120, 150, 179, 182, 210, 239, 244, 272, 275, 304, 335, 391, 394, 422, 451, 454, 482, 514, 546, 574, 603, 606, 634, 663, 666, 694, 723, 733, 761, 764, 792, 821, 824, 853, 856, 884, 913, 916, 945, 976, 1005, 1008, 1036, 1065, 1068, 1096, 1125, 1128, 1156, 1185, 1188, 1220, 1249, 1252, 1280, 1309, 1312, 1340, 1369, 1372, 1401, 1404, 1432, 1461, 1464, 1492, 1521, 1524, 1552, 1581, 1584, 1612, 1641, 1644, 1672, 1701, 1704, 1736, 1764, 1793, 1796, 1824, 1876, 1904, 1933, 1935, 1963, 1966, 1994, 2023, 2025, 2053, 2056, 2084, 2113, 2116, 2144, 2173, 2176, 2204, 2233, 2236, 2264, 2296, 2324, 2353, 2356, 2384, 2413, 2416, 2444, 2473, 2476, 2504, 2533, 2536, 2564, 2593, 2596, 2640, 2668, 2700, 2728, 2760, 2788, 2817, 2819, 2847, 2850, 2878, 2907, 2910, 2938, 2967, 2970, 2998, 3027, 3029, 3057, 3060, 3088, 3117, 3120, 3148, 3177, 3180, 3208, 3237, 3240, 3268, 3297, 3300, 3328, 3357, 3360, 3388, 3417, 3420, 3448, 3477]
Discarding 165 places :
Implicit Place search using SMT only with invariants took 4035 ms to find 165 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 3429/17233 places, 7520/21129 transitions.
Discarding 3007 places :
Symmetric choice reduction at 0 with 3007 rule applications. Total rules 3007 place count 422 transition count 4513
Iterating global reduction 0 with 3007 rules applied. Total rules applied 6014 place count 422 transition count 4513
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 6126 place count 310 transition count 4401
Iterating global reduction 0 with 112 rules applied. Total rules applied 6238 place count 310 transition count 4401
Discarding 167 places :
Symmetric choice reduction at 0 with 167 rule applications. Total rules 6405 place count 143 transition count 4234
Iterating global reduction 0 with 167 rules applied. Total rules applied 6572 place count 143 transition count 4234
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6576 place count 141 transition count 4232
Applied a total of 6576 rules in 159 ms. Remains 141 /3429 variables (removed 3288) and now considering 4232/7520 (removed 3288) transitions.
[2023-03-22 17:10:05] [INFO ] Flow matrix only has 140 transitions (discarded 4092 similar events)
// Phase 1: matrix 140 rows 141 cols
[2023-03-22 17:10:05] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 17:10:05] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-22 17:10:05] [INFO ] Flow matrix only has 140 transitions (discarded 4092 similar events)
[2023-03-22 17:10:05] [INFO ] Invariant cache hit.
[2023-03-22 17:10:05] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 141/17233 places, 4232/21129 transitions.
Finished structural reductions in SI_LTL mode , in 8 iterations and 40680 ms. Remains : 141/17233 places, 4232/21129 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-12 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 (GEQ s22 1) (GEQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-12 finished in 40761 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 1 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 65 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2023-03-22 17:10:07] [INFO ] Computed 198 place invariants in 1594 ms
[2023-03-22 17:10:08] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:10:08] [INFO ] Implicit Places using invariants in 3014 ms returned []
Implicit Place search using SMT only with invariants took 3022 ms to find 0 implicit places.
[2023-03-22 17:10:08] [INFO ] Invariant cache hit.
[2023-03-22 17:10:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:10:10] [INFO ] Dead Transitions using invariants and state equation in 1604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4694 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s5925 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]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-13 finished in 4839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U X(p1)))))'
Support contains 4 out of 17233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17233/17233 places, 21129/21129 transitions.
Applied a total of 0 rules in 67 ms. Remains 17233 /17233 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
[2023-03-22 17:10:10] [INFO ] Invariant cache hit.
[2023-03-22 17:10:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:10:12] [INFO ] Implicit Places using invariants in 1617 ms returned []
Implicit Place search using SMT only with invariants took 1619 ms to find 0 implicit places.
[2023-03-22 17:10:12] [INFO ] Invariant cache hit.
[2023-03-22 17:10:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-22 17:10:13] [INFO ] Dead Transitions using invariants and state equation in 1563 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3250 ms. Remains : 17233/17233 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S64C4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s263 1) (GEQ s15520 1)), p1:(AND (GEQ s13351 1) (GEQ s13412 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C4-LTLFireability-14 finished in 3456 ms.
All properties solved by simple procedures.
Total runtime 211641 ms.

BK_STOP 1679505015142

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S64C4, 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 r229-tall-167856413400540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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