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.r009-oct2-167813598400780.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BART-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598400780
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 1019K Feb 26 04:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 26 04:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 04:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.5M Feb 26 04:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 228K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 609K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 612K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6M Feb 26 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Feb 26 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Feb 26 05:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12M Feb 26 05:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.8M 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 BART-PT-020-LTLFireability-00
FORMULA_NAME BART-PT-020-LTLFireability-01
FORMULA_NAME BART-PT-020-LTLFireability-02
FORMULA_NAME BART-PT-020-LTLFireability-03
FORMULA_NAME BART-PT-020-LTLFireability-04
FORMULA_NAME BART-PT-020-LTLFireability-05
FORMULA_NAME BART-PT-020-LTLFireability-06
FORMULA_NAME BART-PT-020-LTLFireability-07
FORMULA_NAME BART-PT-020-LTLFireability-08
FORMULA_NAME BART-PT-020-LTLFireability-09
FORMULA_NAME BART-PT-020-LTLFireability-10
FORMULA_NAME BART-PT-020-LTLFireability-11
FORMULA_NAME BART-PT-020-LTLFireability-12
FORMULA_NAME BART-PT-020-LTLFireability-13
FORMULA_NAME BART-PT-020-LTLFireability-14
FORMULA_NAME BART-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678645762351

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:29:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 18:29:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:29:25] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2023-03-12 18:29:25] [INFO ] Transformed 2850 places.
[2023-03-12 18:29:25] [INFO ] Transformed 4040 transitions.
[2023-03-12 18:29:25] [INFO ] Found NUPN structural information;
[2023-03-12 18:29:25] [INFO ] Parsed PT model containing 2850 places and 4040 transitions and 32400 arcs in 535 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 88 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-020-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1581 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 217 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2023-03-12 18:29:26] [INFO ] Computed 20 place invariants in 113 ms
[2023-03-12 18:29:27] [INFO ] Implicit Places using invariants in 1158 ms returned []
[2023-03-12 18:29:27] [INFO ] Invariant cache hit.
[2023-03-12 18:29:28] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 2376 ms to find 0 implicit places.
[2023-03-12 18:29:28] [INFO ] Invariant cache hit.
[2023-03-12 18:29:31] [INFO ] Dead Transitions using invariants and state equation in 2855 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5469 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Support contains 1581 out of 2640 places after structural reductions.
[2023-03-12 18:29:32] [INFO ] Flatten gal took : 353 ms
[2023-03-12 18:29:32] [INFO ] Flatten gal took : 221 ms
[2023-03-12 18:29:33] [INFO ] Input system was already deterministic with 4040 transitions.
Finished random walk after 3149 steps, including 0 resets, run visited all 14 properties in 155 ms. (steps per millisecond=20 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||((G(F(!p0))||(F(!p0)&&F(!p1)))&&X(G(p2)))))))'
Support contains 200 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 460 places :
Symmetric choice reduction at 0 with 460 rule applications. Total rules 460 place count 2180 transition count 3580
Iterating global reduction 0 with 460 rules applied. Total rules applied 920 place count 2180 transition count 3580
Discarding 380 places :
Symmetric choice reduction at 0 with 380 rule applications. Total rules 1300 place count 1800 transition count 3200
Iterating global reduction 0 with 380 rules applied. Total rules applied 1680 place count 1800 transition count 3200
Applied a total of 1680 rules in 427 ms. Remains 1800 /2640 variables (removed 840) and now considering 3200/4040 (removed 840) transitions.
// Phase 1: matrix 3200 rows 1800 cols
[2023-03-12 18:29:34] [INFO ] Computed 20 place invariants in 14 ms
[2023-03-12 18:29:35] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-12 18:29:35] [INFO ] Invariant cache hit.
[2023-03-12 18:29:36] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2023-03-12 18:29:36] [INFO ] Invariant cache hit.
[2023-03-12 18:29:38] [INFO ] Dead Transitions using invariants and state equation in 1693 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1800/2640 places, 3200/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3625 ms. Remains : 1800/2640 places, 3200/4040 transitions.
Stuttering acceptance computed with spot in 627 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 p1), p0, (AND p1 p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s367 1) (EQ s140 1) (EQ s247 1) (EQ s307 1) (EQ s677 1) (EQ s300 1) (EQ s254 1) (EQ s670 1) (EQ s360 1) (EQ s615 1) (EQ s154 1) (EQ s498 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 38 reset in 1163 ms.
Product exploration explored 100000 steps with 39 reset in 934 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 865 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 p1), p0, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 18:29:45] [INFO ] Invariant cache hit.
[2023-03-12 18:29:45] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F p0), (F (AND p1 p0)), (F (AND p1 p2)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 9 factoid took 879 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 162 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Support contains 200 out of 1800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 3200/3200 transitions.
Applied a total of 0 rules in 69 ms. Remains 1800 /1800 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
[2023-03-12 18:29:47] [INFO ] Invariant cache hit.
[2023-03-12 18:29:47] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-12 18:29:47] [INFO ] Invariant cache hit.
[2023-03-12 18:29:48] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
[2023-03-12 18:29:48] [INFO ] Invariant cache hit.
[2023-03-12 18:29:49] [INFO ] Dead Transitions using invariants and state equation in 1369 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2880 ms. Remains : 1800/1800 places, 3200/3200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), p0]
Finished random walk after 3478 steps, including 1 resets, run visited all 2 properties in 44 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F p0)]
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), p0]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), p0]
Product exploration explored 100000 steps with 39 reset in 544 ms.
Product exploration explored 100000 steps with 26 reset in 603 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p2) p0), (AND (NOT p2) p0), p0]
Support contains 200 out of 1800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1800/1800 places, 3200/3200 transitions.
Performed 220 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 1800 transition count 3200
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 80 Pre rules applied. Total rules applied 220 place count 1800 transition count 3200
Deduced a syphon composed of 300 places in 13 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 300 place count 1800 transition count 3200
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 320 place count 1780 transition count 3180
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 340 place count 1780 transition count 3180
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 680 places in 2 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 740 place count 1780 transition count 3200
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 760 place count 1780 transition count 3180
Discarding 380 places :
Symmetric choice reduction at 2 with 380 rule applications. Total rules 1140 place count 1400 transition count 2800
Deduced a syphon composed of 300 places in 2 ms
Iterating global reduction 2 with 380 rules applied. Total rules applied 1520 place count 1400 transition count 2800
Performed 101 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 401 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1621 place count 1400 transition count 3208
Ensure Unique test removed 284 transitions
Reduce isomorphic transitions removed 284 transitions.
Iterating post reduction 2 with 284 rules applied. Total rules applied 1905 place count 1400 transition count 2924
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1945 place count 1360 transition count 2804
Deduced a syphon composed of 361 places in 1 ms
Iterating global reduction 3 with 40 rules applied. Total rules applied 1985 place count 1360 transition count 2804
Performed 101 Post agglomeration using F-continuation condition with reduction of 124 identical transitions.
Deduced a syphon composed of 462 places in 2 ms
Iterating global reduction 3 with 101 rules applied. Total rules applied 2086 place count 1360 transition count 3776
Ensure Unique test removed 628 transitions
Reduce isomorphic transitions removed 628 transitions.
Iterating post reduction 3 with 628 rules applied. Total rules applied 2714 place count 1360 transition count 3148
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 2776 place count 1298 transition count 2776
Deduced a syphon composed of 400 places in 1 ms
Iterating global reduction 4 with 62 rules applied. Total rules applied 2838 place count 1298 transition count 2776
Performed 101 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 501 places in 2 ms
Iterating global reduction 4 with 101 rules applied. Total rules applied 2939 place count 1298 transition count 4210
Ensure Unique test removed 781 transitions
Reduce isomorphic transitions removed 781 transitions.
Iterating post reduction 4 with 781 rules applied. Total rules applied 3720 place count 1298 transition count 3429
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 3741 place count 1277 transition count 3291
Deduced a syphon composed of 480 places in 1 ms
Iterating global reduction 5 with 21 rules applied. Total rules applied 3762 place count 1277 transition count 3291
Performed 101 Post agglomeration using F-continuation condition with reduction of 162 identical transitions.
Deduced a syphon composed of 581 places in 1 ms
Iterating global reduction 5 with 101 rules applied. Total rules applied 3863 place count 1277 transition count 5109
Ensure Unique test removed 1111 transitions
Reduce isomorphic transitions removed 1111 transitions.
Iterating post reduction 5 with 1111 rules applied. Total rules applied 4974 place count 1277 transition count 3998
Discarding 101 places :
Symmetric choice reduction at 6 with 101 rule applications. Total rules 5075 place count 1176 transition count 2988
Deduced a syphon composed of 480 places in 0 ms
Iterating global reduction 6 with 101 rules applied. Total rules applied 5176 place count 1176 transition count 2988
Performed 101 Post agglomeration using F-continuation condition with reduction of 162 identical transitions.
Deduced a syphon composed of 581 places in 0 ms
Iterating global reduction 6 with 101 rules applied. Total rules applied 5277 place count 1176 transition count 4806
Ensure Unique test removed 1111 transitions
Reduce isomorphic transitions removed 1111 transitions.
Iterating post reduction 6 with 1111 rules applied. Total rules applied 6388 place count 1176 transition count 3695
Discarding 101 places :
Symmetric choice reduction at 7 with 101 rule applications. Total rules 6489 place count 1075 transition count 2685
Deduced a syphon composed of 480 places in 1 ms
Iterating global reduction 7 with 101 rules applied. Total rules applied 6590 place count 1075 transition count 2685
Performed 101 Post agglomeration using F-continuation condition with reduction of 162 identical transitions.
Deduced a syphon composed of 581 places in 1 ms
Iterating global reduction 7 with 101 rules applied. Total rules applied 6691 place count 1075 transition count 4503
Ensure Unique test removed 1111 transitions
Reduce isomorphic transitions removed 1111 transitions.
Iterating post reduction 7 with 1111 rules applied. Total rules applied 7802 place count 1075 transition count 3392
Discarding 101 places :
Symmetric choice reduction at 8 with 101 rule applications. Total rules 7903 place count 974 transition count 2382
Deduced a syphon composed of 480 places in 0 ms
Iterating global reduction 8 with 101 rules applied. Total rules applied 8004 place count 974 transition count 2382
Performed 54 Post agglomeration using F-continuation condition with reduction of 68 identical transitions.
Deduced a syphon composed of 534 places in 1 ms
Iterating global reduction 8 with 54 rules applied. Total rules applied 8058 place count 974 transition count 3354
Ensure Unique test removed 594 transitions
Reduce isomorphic transitions removed 594 transitions.
Iterating post reduction 8 with 594 rules applied. Total rules applied 8652 place count 974 transition count 2760
Discarding 74 places :
Symmetric choice reduction at 9 with 74 rule applications. Total rules 8726 place count 900 transition count 2020
Deduced a syphon composed of 460 places in 0 ms
Iterating global reduction 9 with 74 rules applied. Total rules applied 8800 place count 900 transition count 2020
Deduced a syphon composed of 460 places in 0 ms
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 9 with 20 rules applied. Total rules applied 8820 place count 900 transition count 2000
Deduced a syphon composed of 460 places in 0 ms
Applied a total of 8820 rules in 1234 ms. Remains 900 /1800 variables (removed 900) and now considering 2000/3200 (removed 1200) transitions.
[2023-03-12 18:29:54] [INFO ] Redundant transitions in 149 ms returned []
// Phase 1: matrix 2000 rows 900 cols
[2023-03-12 18:29:54] [INFO ] Computed 20 place invariants in 14 ms
[2023-03-12 18:29:55] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 900/1800 places, 2000/3200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2180 ms. Remains : 900/1800 places, 2000/3200 transitions.
Support contains 200 out of 1800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1800/1800 places, 3200/3200 transitions.
Applied a total of 0 rules in 51 ms. Remains 1800 /1800 variables (removed 0) and now considering 3200/3200 (removed 0) transitions.
// Phase 1: matrix 3200 rows 1800 cols
[2023-03-12 18:29:55] [INFO ] Computed 20 place invariants in 11 ms
[2023-03-12 18:29:56] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-12 18:29:56] [INFO ] Invariant cache hit.
[2023-03-12 18:29:57] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1384 ms to find 0 implicit places.
[2023-03-12 18:29:57] [INFO ] Invariant cache hit.
[2023-03-12 18:29:58] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2959 ms. Remains : 1800/1800 places, 3200/3200 transitions.
Treatment of property BART-PT-020-LTLFireability-00 finished in 24845 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' '!((p0 U X(G((p1 U (G(p3)||p2))))))'
Support contains 1400 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 2580 transition count 3980
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 2580 transition count 3980
Applied a total of 120 rules in 129 ms. Remains 2580 /2640 variables (removed 60) and now considering 3980/4040 (removed 60) transitions.
// Phase 1: matrix 3980 rows 2580 cols
[2023-03-12 18:29:59] [INFO ] Computed 20 place invariants in 16 ms
[2023-03-12 18:29:59] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-12 18:29:59] [INFO ] Invariant cache hit.
[2023-03-12 18:30:01] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2023-03-12 18:30:01] [INFO ] Invariant cache hit.
[2023-03-12 18:30:03] [INFO ] Dead Transitions using invariants and state equation in 1886 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2580/2640 places, 3980/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3932 ms. Remains : 2580/2640 places, 3980/4040 transitions.
Stuttering acceptance computed with spot in 464 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BART-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p2 p3 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p3) (AND p0 p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p3 p1), acceptance={1} source=1 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3) p1), acceptance={0, 1} source=1 dest: 6}, { cond=(AND p0 (NOT p2) p3 (NOT p1)), acceptance={1} source=1 dest: 7}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p3 p1), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(OR (AND p2 (NOT p3)) (AND (NOT p3) p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR (AND p2 p3) (AND p3 p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2) p3 p1), acceptance={1} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3) p1), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 (NOT p2) p3 (NOT p1)), acceptance={1} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 (NOT p3) p1)), acceptance={0} source=7 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2) p3 p1), acceptance={1} source=7 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3) p1), acceptance={0, 1} source=7 dest: 6}, { cond=(OR (AND p0 p2 p3) (AND p0 p3 p1)), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p2) p3 (NOT p1)), acceptance={1} source=7 dest: 7}]], initial=1, aps=[p2:(OR (EQ s9 1) (EQ s8 1) (EQ s12 1) (EQ s7 1) (EQ s3 1) (EQ s13 1) (EQ s4 1) (EQ s18 1) (EQ s17 1) (EQ s2 1) (EQ s6 1) (EQ s0 1) (EQ s5 1) (EQ s16 1) (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 2 ms.
FORMULA BART-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-01 finished in 4459 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' '!((!p0 U (p0&&G(!p1))))'
Support contains 1540 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Iterating post reduction 0 with 480 rules applied. Total rules applied 480 place count 2640 transition count 3560
Reduce places removed 480 places and 0 transitions.
Iterating post reduction 1 with 480 rules applied. Total rules applied 960 place count 2160 transition count 3560
Applied a total of 960 rules in 211 ms. Remains 2160 /2640 variables (removed 480) and now considering 3560/4040 (removed 480) transitions.
// Phase 1: matrix 3560 rows 2160 cols
[2023-03-12 18:30:03] [INFO ] Computed 20 place invariants in 13 ms
[2023-03-12 18:30:04] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-12 18:30:04] [INFO ] Invariant cache hit.
[2023-03-12 18:30:05] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2023-03-12 18:30:05] [INFO ] Redundant transitions in 152 ms returned []
[2023-03-12 18:30:05] [INFO ] Invariant cache hit.
[2023-03-12 18:30:07] [INFO ] Dead Transitions using invariants and state equation in 1925 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2160/2640 places, 3560/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4184 ms. Remains : 2160/2640 places, 3560/4040 transitions.
Stuttering acceptance computed with spot in 176 ms :[p1, true, (OR (NOT p0) p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (EQ s185 1) (EQ s1508 1) (EQ s301 1) (EQ s901 1) (EQ s812 1) (EQ s2031 1) (EQ s273 1) (EQ s1439 1) (EQ s44 1) (EQ s1939 1) (EQ s1336 1) (EQ s1004 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 4 ms.
FORMULA BART-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-03 finished in 4417 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 1360 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2640 transition count 3980
Reduce places removed 60 places and 0 transitions.
Performed 540 Post agglomeration using F-continuation condition.Transition count delta: 540
Iterating post reduction 1 with 600 rules applied. Total rules applied 660 place count 2580 transition count 3440
Reduce places removed 540 places and 0 transitions.
Iterating post reduction 2 with 540 rules applied. Total rules applied 1200 place count 2040 transition count 3440
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1220 place count 2020 transition count 3420
Iterating global reduction 3 with 20 rules applied. Total rules applied 1240 place count 2020 transition count 3420
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1400 place count 1940 transition count 3340
Applied a total of 1400 rules in 391 ms. Remains 1940 /2640 variables (removed 700) and now considering 3340/4040 (removed 700) transitions.
// Phase 1: matrix 3340 rows 1940 cols
[2023-03-12 18:30:08] [INFO ] Computed 20 place invariants in 29 ms
[2023-03-12 18:30:08] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-12 18:30:08] [INFO ] Invariant cache hit.
[2023-03-12 18:30:10] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1546 ms to find 0 implicit places.
[2023-03-12 18:30:10] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-12 18:30:10] [INFO ] Invariant cache hit.
[2023-03-12 18:30:11] [INFO ] Dead Transitions using invariants and state equation in 1483 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1940/2640 places, 3340/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3506 ms. Remains : 1940/2640 places, 3340/4040 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s185 1) (EQ s1288 1) (EQ s261 1) (EQ s701 1) (EQ s632 1) (EQ s1811 1) (EQ s253 1) (EQ s1219 1) (EQ s44 1) (EQ s1719 1) (EQ s1116 1) (EQ s784 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1076 ms.
Product exploration explored 100000 steps with 0 reset in 1168 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 246 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 261 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
[2023-03-12 18:30:17] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 18:30:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1360 out of 1940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1940/1940 places, 3340/3340 transitions.
Applied a total of 0 rules in 41 ms. Remains 1940 /1940 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2023-03-12 18:30:32] [INFO ] Invariant cache hit.
[2023-03-12 18:30:32] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-12 18:30:32] [INFO ] Invariant cache hit.
[2023-03-12 18:30:34] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
[2023-03-12 18:30:34] [INFO ] Redundant transitions in 125 ms returned []
[2023-03-12 18:30:34] [INFO ] Invariant cache hit.
[2023-03-12 18:30:36] [INFO ] Dead Transitions using invariants and state equation in 1646 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3521 ms. Remains : 1940/1940 places, 3340/3340 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
[2023-03-12 18:30:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1221 ms.
Product exploration explored 100000 steps with 0 reset in 1124 ms.
Support contains 1360 out of 1940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1940/1940 places, 3340/3340 transitions.
Applied a total of 0 rules in 24 ms. Remains 1940 /1940 variables (removed 0) and now considering 3340/3340 (removed 0) transitions.
[2023-03-12 18:30:56] [INFO ] Invariant cache hit.
[2023-03-12 18:30:57] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-12 18:30:57] [INFO ] Invariant cache hit.
[2023-03-12 18:30:58] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
[2023-03-12 18:30:58] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-12 18:30:58] [INFO ] Invariant cache hit.
[2023-03-12 18:30:59] [INFO ] Dead Transitions using invariants and state equation in 1527 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3302 ms. Remains : 1940/1940 places, 3340/3340 transitions.
Treatment of property BART-PT-020-LTLFireability-05 finished in 51989 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 U X(X(p0)))) U p0)&&F(G(p1))))'
Support contains 1540 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 33 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2023-03-12 18:31:00] [INFO ] Computed 20 place invariants in 18 ms
[2023-03-12 18:31:00] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-12 18:31:00] [INFO ] Invariant cache hit.
[2023-03-12 18:31:01] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2023-03-12 18:31:01] [INFO ] Invariant cache hit.
[2023-03-12 18:31:04] [INFO ] Dead Transitions using invariants and state equation in 3386 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4525 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : BART-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s205 1) (EQ s1728 1) (EQ s321 1) (EQ s921 1) (EQ s832 1) (EQ s2431 1) (EQ s293 1) (EQ s1639 1) (EQ s64 1) (EQ s2299 1) (EQ s1496 1) (EQ s1064 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 630 ms.
Product exploration explored 100000 steps with 0 reset in 646 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 337 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (NOT p1)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 525 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
[2023-03-12 18:31:09] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-12 18:31:24] [INFO ] Invariant cache hit.
[2023-03-12 18:31:27] [INFO ] [Real]Absence check using 20 positive place invariants in 76 ms returned sat
[2023-03-12 18:31:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:31:39] [INFO ] [Real]Absence check using state equation in 12149 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1540 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 43 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2023-03-12 18:31:39] [INFO ] Invariant cache hit.
[2023-03-12 18:31:40] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-12 18:31:40] [INFO ] Invariant cache hit.
[2023-03-12 18:31:41] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2023-03-12 18:31:41] [INFO ] Invariant cache hit.
[2023-03-12 18:31:43] [INFO ] Dead Transitions using invariants and state equation in 2514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3904 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 236 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 82 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 313 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
[2023-03-12 18:31:47] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2023-03-12 18:32:02] [INFO ] Invariant cache hit.
[2023-03-12 18:32:04] [INFO ] [Real]Absence check using 20 positive place invariants in 40 ms returned sat
[2023-03-12 18:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 18:32:17] [INFO ] [Real]Absence check using state equation in 12344 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 1 reset in 703 ms.
Product exploration explored 100000 steps with 2 reset in 626 ms.
Applying partial POR strategy [false, true, false, false, true, true]
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1540 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 480 rules applied. Total rules applied 480 place count 2640 transition count 4040
Deduced a syphon composed of 480 places in 1 ms
Applied a total of 480 rules in 114 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2023-03-12 18:32:19] [INFO ] Redundant transitions in 102 ms returned []
// Phase 1: matrix 4040 rows 2640 cols
[2023-03-12 18:32:19] [INFO ] Computed 20 place invariants in 12 ms
[2023-03-12 18:32:21] [INFO ] Dead Transitions using invariants and state equation in 2176 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2640/2640 places, 4040/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2402 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Support contains 1540 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 36 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2023-03-12 18:32:21] [INFO ] Computed 20 place invariants in 30 ms
[2023-03-12 18:32:22] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-12 18:32:22] [INFO ] Invariant cache hit.
[2023-03-12 18:32:23] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
[2023-03-12 18:32:23] [INFO ] Invariant cache hit.
[2023-03-12 18:32:25] [INFO ] Dead Transitions using invariants and state equation in 2787 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4162 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Treatment of property BART-PT-020-LTLFireability-06 finished in 86037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U p1)&&F(p2))))))'
Support contains 3 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 639 places :
Symmetric choice reduction at 0 with 639 rule applications. Total rules 639 place count 2001 transition count 3401
Iterating global reduction 0 with 639 rules applied. Total rules applied 1278 place count 2001 transition count 3401
Discarding 539 places :
Symmetric choice reduction at 0 with 539 rule applications. Total rules 1817 place count 1462 transition count 2862
Iterating global reduction 0 with 539 rules applied. Total rules applied 2356 place count 1462 transition count 2862
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2436 place count 1382 transition count 2782
Iterating global reduction 0 with 80 rules applied. Total rules applied 2516 place count 1382 transition count 2782
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2576 place count 1322 transition count 2722
Iterating global reduction 0 with 60 rules applied. Total rules applied 2636 place count 1322 transition count 2722
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2696 place count 1262 transition count 2662
Iterating global reduction 0 with 60 rules applied. Total rules applied 2756 place count 1262 transition count 2662
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2816 place count 1202 transition count 2602
Iterating global reduction 0 with 60 rules applied. Total rules applied 2876 place count 1202 transition count 2602
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2936 place count 1142 transition count 2542
Iterating global reduction 0 with 60 rules applied. Total rules applied 2996 place count 1142 transition count 2542
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3056 place count 1082 transition count 2482
Iterating global reduction 0 with 60 rules applied. Total rules applied 3116 place count 1082 transition count 2482
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3156 place count 1042 transition count 2442
Iterating global reduction 0 with 40 rules applied. Total rules applied 3196 place count 1042 transition count 2442
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3236 place count 1002 transition count 2402
Iterating global reduction 0 with 40 rules applied. Total rules applied 3276 place count 1002 transition count 2402
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3296 place count 982 transition count 2382
Iterating global reduction 0 with 20 rules applied. Total rules applied 3316 place count 982 transition count 2382
Applied a total of 3316 rules in 404 ms. Remains 982 /2640 variables (removed 1658) and now considering 2382/4040 (removed 1658) transitions.
// Phase 1: matrix 2382 rows 982 cols
[2023-03-12 18:32:26] [INFO ] Computed 20 place invariants in 30 ms
[2023-03-12 18:32:26] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-12 18:32:26] [INFO ] Invariant cache hit.
[2023-03-12 18:32:27] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-03-12 18:32:27] [INFO ] Invariant cache hit.
[2023-03-12 18:32:28] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 982/2640 places, 2382/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2207 ms. Remains : 982/2640 places, 2382/4040 transitions.
Stuttering acceptance computed with spot in 341 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p2:(EQ s13 1), p1:(NEQ s35 1), p0:(NEQ s400 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2321 reset in 570 ms.
Product exploration explored 100000 steps with 2449 reset in 582 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 18:32:30] [INFO ] Invariant cache hit.
[2023-03-12 18:32:30] [INFO ] [Real]Absence check using 20 positive place invariants in 48 ms returned sat
[2023-03-12 18:32:31] [INFO ] After 669ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 18:32:31] [INFO ] After 812ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-12 18:32:31] [INFO ] After 1219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 343 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=114 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND p2 p1 p0), true]
False Knowledge obtained : [(F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 350 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 486 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 389 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 3 out of 982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 982/982 places, 2382/2382 transitions.
Applied a total of 0 rules in 31 ms. Remains 982 /982 variables (removed 0) and now considering 2382/2382 (removed 0) transitions.
[2023-03-12 18:32:33] [INFO ] Invariant cache hit.
[2023-03-12 18:32:33] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-12 18:32:33] [INFO ] Invariant cache hit.
[2023-03-12 18:32:34] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2023-03-12 18:32:34] [INFO ] Invariant cache hit.
[2023-03-12 18:32:35] [INFO ] Dead Transitions using invariants and state equation in 911 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2062 ms. Remains : 982/982 places, 2382/2382 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Finished random walk after 6781 steps, including 2 resets, run visited all 6 properties in 53 ms. (steps per millisecond=127 )
Knowledge obtained : [(AND p2 p0 p1), true]
False Knowledge obtained : [(F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 287 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 464 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Stuttering acceptance computed with spot in 403 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Product exploration explored 100000 steps with 2327 reset in 727 ms.
Product exploration explored 100000 steps with 2565 reset in 657 ms.
Applying partial POR strategy [true, true, true, false, false, false, true]
Stuttering acceptance computed with spot in 478 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true]
Support contains 3 out of 982 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 982/982 places, 2382/2382 transitions.
Graph (trivial) has 2341 edges and 982 vertex of which 882 / 982 are part of one of the 18 SCC in 8 ms
Free SCC test removed 864 places
Ensure Unique test removed 2123 transitions
Reduce isomorphic transitions removed 2123 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 101 transition count 243
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 20 place count 101 transition count 243
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 101 transition count 243
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 98 transition count 240
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 28 place count 98 transition count 240
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 48 place count 98 transition count 242
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 54 place count 98 transition count 236
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 70 place count 82 transition count 220
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 86 place count 82 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 82 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 82 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 80 transition count 214
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 80 transition count 214
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 80 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 102 place count 80 transition count 210
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 78 transition count 208
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 78 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 78 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 112 place count 78 transition count 204
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 114 place count 76 transition count 202
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 116 place count 76 transition count 202
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 76 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 122 place count 76 transition count 198
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 124 place count 74 transition count 196
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 126 place count 74 transition count 196
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 128 place count 74 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 132 place count 74 transition count 192
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 134 place count 72 transition count 190
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 136 place count 72 transition count 190
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 138 place count 72 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 142 place count 72 transition count 186
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 144 place count 70 transition count 184
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 146 place count 70 transition count 184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 148 place count 70 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 152 place count 70 transition count 180
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 154 place count 68 transition count 178
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 156 place count 68 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 158 place count 68 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 162 place count 68 transition count 174
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 164 place count 66 transition count 172
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 166 place count 66 transition count 172
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 168 place count 66 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 172 place count 66 transition count 168
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 174 place count 64 transition count 166
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 176 place count 64 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 178 place count 64 transition count 166
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 182 place count 64 transition count 162
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 184 place count 62 transition count 160
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 12 with 2 rules applied. Total rules applied 186 place count 62 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 12 with 2 rules applied. Total rules applied 188 place count 62 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 192 place count 62 transition count 156
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 194 place count 60 transition count 154
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 13 with 2 rules applied. Total rules applied 196 place count 60 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 13 with 2 rules applied. Total rules applied 198 place count 60 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 202 place count 60 transition count 150
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 204 place count 58 transition count 148
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 14 with 2 rules applied. Total rules applied 206 place count 58 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 14 with 2 rules applied. Total rules applied 208 place count 58 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 212 place count 58 transition count 144
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 214 place count 56 transition count 142
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 15 with 2 rules applied. Total rules applied 216 place count 56 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 15 with 2 rules applied. Total rules applied 218 place count 56 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 222 place count 56 transition count 138
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 224 place count 54 transition count 136
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 16 with 2 rules applied. Total rules applied 226 place count 54 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 16 with 2 rules applied. Total rules applied 228 place count 54 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 232 place count 54 transition count 132
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 234 place count 52 transition count 130
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 17 with 2 rules applied. Total rules applied 236 place count 52 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 17 with 2 rules applied. Total rules applied 238 place count 52 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 242 place count 52 transition count 126
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 244 place count 50 transition count 124
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 18 with 2 rules applied. Total rules applied 246 place count 50 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 18 with 2 rules applied. Total rules applied 248 place count 50 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 252 place count 50 transition count 120
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 254 place count 48 transition count 118
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 19 with 2 rules applied. Total rules applied 256 place count 48 transition count 118
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 19 with 2 rules applied. Total rules applied 258 place count 48 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 262 place count 48 transition count 114
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 264 place count 46 transition count 112
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 20 with 2 rules applied. Total rules applied 266 place count 46 transition count 112
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 20 with 2 rules applied. Total rules applied 268 place count 46 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 272 place count 46 transition count 108
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 274 place count 44 transition count 106
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 21 with 2 rules applied. Total rules applied 276 place count 44 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 21 with 2 rules applied. Total rules applied 278 place count 44 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 282 place count 44 transition count 102
Discarding 2 places :
Symmetric choice reduction at 22 with 2 rule applications. Total rules 284 place count 42 transition count 100
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 22 with 2 rules applied. Total rules applied 286 place count 42 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 22 with 2 rules applied. Total rules applied 288 place count 42 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 292 place count 42 transition count 96
Discarding 2 places :
Symmetric choice reduction at 23 with 2 rule applications. Total rules 294 place count 40 transition count 94
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 23 with 2 rules applied. Total rules applied 296 place count 40 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 23 with 2 rules applied. Total rules applied 298 place count 40 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 302 place count 40 transition count 90
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 304 place count 38 transition count 88
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 24 with 2 rules applied. Total rules applied 306 place count 38 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 24 with 2 rules applied. Total rules applied 308 place count 38 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 312 place count 38 transition count 84
Discarding 2 places :
Symmetric choice reduction at 25 with 2 rule applications. Total rules 314 place count 36 transition count 82
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 25 with 2 rules applied. Total rules applied 316 place count 36 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 25 with 2 rules applied. Total rules applied 318 place count 36 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 322 place count 36 transition count 78
Discarding 2 places :
Symmetric choice reduction at 26 with 2 rule applications. Total rules 324 place count 34 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 26 with 2 rules applied. Total rules applied 326 place count 34 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 26 with 2 rules applied. Total rules applied 328 place count 34 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 332 place count 34 transition count 72
Discarding 2 places :
Symmetric choice reduction at 27 with 2 rule applications. Total rules 334 place count 32 transition count 70
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 27 with 2 rules applied. Total rules applied 336 place count 32 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 27 with 2 rules applied. Total rules applied 338 place count 32 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 342 place count 32 transition count 66
Discarding 2 places :
Symmetric choice reduction at 28 with 2 rule applications. Total rules 344 place count 30 transition count 64
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 28 with 2 rules applied. Total rules applied 346 place count 30 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 28 with 2 rules applied. Total rules applied 348 place count 30 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 352 place count 30 transition count 60
Discarding 2 places :
Symmetric choice reduction at 29 with 2 rule applications. Total rules 354 place count 28 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 29 with 2 rules applied. Total rules applied 356 place count 28 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 29 with 2 rules applied. Total rules applied 358 place count 28 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 362 place count 28 transition count 54
Discarding 2 places :
Symmetric choice reduction at 30 with 2 rule applications. Total rules 364 place count 26 transition count 52
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 30 with 2 rules applied. Total rules applied 366 place count 26 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 30 with 2 rules applied. Total rules applied 368 place count 26 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 372 place count 26 transition count 48
Discarding 2 places :
Symmetric choice reduction at 31 with 2 rule applications. Total rules 374 place count 24 transition count 46
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 31 with 2 rules applied. Total rules applied 376 place count 24 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 31 with 2 rules applied. Total rules applied 378 place count 24 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 382 place count 24 transition count 42
Discarding 2 places :
Symmetric choice reduction at 32 with 2 rule applications. Total rules 384 place count 22 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 32 with 2 rules applied. Total rules applied 386 place count 22 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 32 with 2 rules applied. Total rules applied 388 place count 22 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 392 place count 22 transition count 36
Discarding 2 places :
Symmetric choice reduction at 33 with 2 rule applications. Total rules 394 place count 20 transition count 34
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 33 with 2 rules applied. Total rules applied 396 place count 20 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 33 with 2 rules applied. Total rules applied 398 place count 20 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 402 place count 20 transition count 30
Discarding 2 places :
Symmetric choice reduction at 34 with 2 rule applications. Total rules 404 place count 18 transition count 28
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 34 with 2 rules applied. Total rules applied 406 place count 18 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 34 with 2 rules applied. Total rules applied 408 place count 18 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 412 place count 18 transition count 24
Discarding 2 places :
Symmetric choice reduction at 35 with 2 rule applications. Total rules 414 place count 16 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 35 with 2 rules applied. Total rules applied 416 place count 16 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 35 with 2 rules applied. Total rules applied 418 place count 16 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 422 place count 16 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 422 place count 16 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 423 place count 16 transition count 18
Discarding 6 places :
Symmetric choice reduction at 36 with 6 rule applications. Total rules 429 place count 10 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 36 with 6 rules applied. Total rules applied 435 place count 10 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 436 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 1 Pre rules applied. Total rules applied 436 place count 10 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 437 place count 10 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 437 rules in 122 ms. Remains 10 /982 variables (removed 972) and now considering 11/2382 (removed 2371) transitions.
[2023-03-12 18:32:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2023-03-12 18:32:39] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 18:32:39] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/982 places, 11/2382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 10/982 places, 11/2382 transitions.
Support contains 3 out of 982 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 982/982 places, 2382/2382 transitions.
Applied a total of 0 rules in 22 ms. Remains 982 /982 variables (removed 0) and now considering 2382/2382 (removed 0) transitions.
// Phase 1: matrix 2382 rows 982 cols
[2023-03-12 18:32:39] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-12 18:32:39] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-12 18:32:39] [INFO ] Invariant cache hit.
[2023-03-12 18:32:40] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2023-03-12 18:32:40] [INFO ] Invariant cache hit.
[2023-03-12 18:32:41] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1865 ms. Remains : 982/982 places, 2382/2382 transitions.
Treatment of property BART-PT-020-LTLFireability-08 finished in 15474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X(p0) U p1)))))'
Support contains 2 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 415 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2023-03-12 18:32:42] [INFO ] Computed 20 place invariants in 15 ms
[2023-03-12 18:32:42] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-12 18:32:42] [INFO ] Invariant cache hit.
[2023-03-12 18:32:42] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2023-03-12 18:32:42] [INFO ] Invariant cache hit.
[2023-03-12 18:32:43] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2266 ms. Remains : 980/2640 places, 2380/4040 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s30 1), p0:(EQ s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 45 reset in 440 ms.
Product exploration explored 100000 steps with 45 reset in 339 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 419 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1)]
Finished random walk after 349 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 446 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1)]
[2023-03-12 18:32:46] [INFO ] Invariant cache hit.
[2023-03-12 18:32:46] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-020-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-09 finished in 5695 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' '!(((p0&&F(p1)) U (G((G(p0)||(p0&&F(p1))))||(!p1&&(G(p0)||(p0&&F(p1)))))))'
Support contains 2 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 4034 edges and 2640 vertex of which 2505 / 2640 are part of one of the 19 SCC in 1 ms
Free SCC test removed 2486 places
Ensure Unique test removed 3814 transitions
Reduce isomorphic transitions removed 3814 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 136 transition count 144
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 149 place count 71 transition count 143
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 151 place count 70 transition count 142
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 151 place count 70 transition count 138
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 159 place count 66 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 165 place count 60 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 171 place count 60 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 172 place count 60 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 176 place count 56 transition count 127
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 56 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 183 place count 53 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 186 place count 53 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 189 place count 50 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 192 place count 50 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 194 place count 48 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 48 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 46 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 46 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 201 place count 45 transition count 116
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 45 transition count 116
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 216 place count 38 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 220 place count 38 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 36 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 228 place count 36 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 34 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 236 place count 34 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 240 place count 32 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 244 place count 32 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 248 place count 30 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 252 place count 30 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 256 place count 28 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 260 place count 28 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 264 place count 26 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 268 place count 26 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 272 place count 24 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 276 place count 24 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 280 place count 22 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 284 place count 22 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 288 place count 20 transition count 55
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 292 place count 20 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 296 place count 18 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 300 place count 18 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 304 place count 16 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 308 place count 16 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 312 place count 14 transition count 37
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 316 place count 14 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 320 place count 12 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 324 place count 12 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 328 place count 10 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 332 place count 10 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 336 place count 8 transition count 19
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 340 place count 8 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 344 place count 6 transition count 13
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 20 with 5 rules applied. Total rules applied 349 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 351 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 22 with 1 Pre rules applied. Total rules applied 351 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 353 place count 4 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 354 place count 4 transition count 5
Applied a total of 354 rules in 51 ms. Remains 4 /2640 variables (removed 2636) and now considering 5/4040 (removed 4035) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-12 18:32:47] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-12 18:32:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 18:32:47] [INFO ] Invariant cache hit.
[2023-03-12 18:32:47] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-12 18:32:47] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-12 18:32:47] [INFO ] Invariant cache hit.
[2023-03-12 18:32:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2640 places, 5/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 4/2640 places, 5/4040 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s2 1), p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 2 reset in 0 ms.
FORMULA BART-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-13 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 388 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2023-03-12 18:32:48] [INFO ] Computed 20 place invariants in 8 ms
[2023-03-12 18:32:48] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-12 18:32:48] [INFO ] Invariant cache hit.
[2023-03-12 18:32:49] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
[2023-03-12 18:32:49] [INFO ] Invariant cache hit.
[2023-03-12 18:32:50] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2441 ms. Remains : 980/2640 places, 2380/4040 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-14 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:(EQ s777 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 BART-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-14 finished in 2594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||((G(F(!p0))||(F(!p0)&&F(!p1)))&&X(G(p2)))))))'
Found a Shortening insensitive property : BART-PT-020-LTLFireability-00
Stuttering acceptance computed with spot in 444 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 p1), p0, (AND p1 p0)]
Support contains 200 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions removed 1140 transitions
Trivial Post-agglo rules discarded 1140 transitions
Performed 1140 trivial Post agglomeration. Transition count delta: 1140
Iterating post reduction 0 with 1140 rules applied. Total rules applied 1140 place count 2640 transition count 2900
Reduce places removed 1140 places and 0 transitions.
Iterating post reduction 1 with 1140 rules applied. Total rules applied 2280 place count 1500 transition count 2900
Discarding 100 places :
Symmetric choice reduction at 2 with 100 rule applications. Total rules 2380 place count 1400 transition count 2800
Iterating global reduction 2 with 100 rules applied. Total rules applied 2480 place count 1400 transition count 2800
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 300
Deduced a syphon composed of 300 places in 0 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 3080 place count 1100 transition count 2500
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 3100 place count 1100 transition count 2480
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 3140 place count 1080 transition count 2460
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 3160 place count 1080 transition count 2440
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 3200 place count 1060 transition count 2420
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 3220 place count 1060 transition count 2400
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 3260 place count 1040 transition count 2380
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 3280 place count 1040 transition count 2360
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 3320 place count 1020 transition count 2340
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 3360 place count 1020 transition count 2300
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 3400 place count 1000 transition count 2280
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 3440 place count 1000 transition count 2240
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 3480 place count 980 transition count 2220
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 3520 place count 980 transition count 2180
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 3560 place count 960 transition count 2160
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 9 with 40 rules applied. Total rules applied 3600 place count 960 transition count 2120
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 3640 place count 940 transition count 2100
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 10 with 40 rules applied. Total rules applied 3680 place count 940 transition count 2060
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 40 rules applied. Total rules applied 3720 place count 920 transition count 2040
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 11 with 40 rules applied. Total rules applied 3760 place count 920 transition count 2000
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 12 with 40 rules applied. Total rules applied 3800 place count 900 transition count 1980
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 12 with 40 rules applied. Total rules applied 3840 place count 900 transition count 1940
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 13 with 40 rules applied. Total rules applied 3880 place count 880 transition count 1920
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 13 with 40 rules applied. Total rules applied 3920 place count 880 transition count 1880
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 14 with 40 rules applied. Total rules applied 3960 place count 860 transition count 1860
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 14 with 40 rules applied. Total rules applied 4000 place count 860 transition count 1820
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 15 with 40 rules applied. Total rules applied 4040 place count 840 transition count 1800
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 15 with 40 rules applied. Total rules applied 4080 place count 840 transition count 1760
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 16 with 40 rules applied. Total rules applied 4120 place count 820 transition count 1740
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 16 with 40 rules applied. Total rules applied 4160 place count 820 transition count 1700
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 17 with 40 rules applied. Total rules applied 4200 place count 800 transition count 1680
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 17 with 40 rules applied. Total rules applied 4240 place count 800 transition count 1640
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 18 with 40 rules applied. Total rules applied 4280 place count 780 transition count 1620
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 18 with 40 rules applied. Total rules applied 4320 place count 780 transition count 1580
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 19 with 40 rules applied. Total rules applied 4360 place count 760 transition count 1560
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 19 with 40 rules applied. Total rules applied 4400 place count 760 transition count 1520
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 20 with 40 rules applied. Total rules applied 4440 place count 740 transition count 1500
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 20 with 40 rules applied. Total rules applied 4480 place count 740 transition count 1460
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 21 with 40 rules applied. Total rules applied 4520 place count 720 transition count 1440
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 21 with 40 rules applied. Total rules applied 4560 place count 720 transition count 1400
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 22 with 40 rules applied. Total rules applied 4600 place count 700 transition count 1380
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 22 with 40 rules applied. Total rules applied 4640 place count 700 transition count 1340
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 23 with 40 rules applied. Total rules applied 4680 place count 680 transition count 1320
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 23 with 40 rules applied. Total rules applied 4720 place count 680 transition count 1280
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 24 with 40 rules applied. Total rules applied 4760 place count 660 transition count 1260
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 24 with 40 rules applied. Total rules applied 4800 place count 660 transition count 1220
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 25 with 40 rules applied. Total rules applied 4840 place count 640 transition count 1200
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 25 with 20 rules applied. Total rules applied 4860 place count 640 transition count 1180
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 26 with 40 rules applied. Total rules applied 4900 place count 620 transition count 1160
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 26 with 20 rules applied. Total rules applied 4920 place count 620 transition count 1140
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 27 with 40 rules applied. Total rules applied 4960 place count 600 transition count 1120
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 27 with 20 rules applied. Total rules applied 4980 place count 600 transition count 1100
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 28 with 40 rules applied. Total rules applied 5020 place count 580 transition count 1080
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 28 with 40 rules applied. Total rules applied 5060 place count 580 transition count 1040
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 29 with 40 rules applied. Total rules applied 5100 place count 560 transition count 1020
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 29 with 40 rules applied. Total rules applied 5140 place count 560 transition count 980
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 30 with 40 rules applied. Total rules applied 5180 place count 540 transition count 960
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 30 with 40 rules applied. Total rules applied 5220 place count 540 transition count 920
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 31 with 40 rules applied. Total rules applied 5260 place count 520 transition count 900
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 31 with 40 rules applied. Total rules applied 5300 place count 520 transition count 860
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 32 with 40 rules applied. Total rules applied 5340 place count 500 transition count 840
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 32 with 20 rules applied. Total rules applied 5360 place count 500 transition count 820
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 33 with 40 rules applied. Total rules applied 5400 place count 480 transition count 800
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 33 with 20 rules applied. Total rules applied 5420 place count 480 transition count 780
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 34 with 40 rules applied. Total rules applied 5460 place count 460 transition count 760
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 34 with 40 rules applied. Total rules applied 5500 place count 460 transition count 720
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 35 with 40 rules applied. Total rules applied 5540 place count 440 transition count 700
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 35 with 40 rules applied. Total rules applied 5580 place count 440 transition count 660
Partial Post-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 36 with 20 rules applied. Total rules applied 5600 place count 440 transition count 660
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 36 with 20 rules applied. Total rules applied 5620 place count 440 transition count 640
Discarding 20 places :
Symmetric choice reduction at 37 with 20 rule applications. Total rules 5640 place count 420 transition count 620
Iterating global reduction 37 with 20 rules applied. Total rules applied 5660 place count 420 transition count 620
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 37 with 20 rules applied. Total rules applied 5680 place count 420 transition count 600
Applied a total of 5680 rules in 610 ms. Remains 420 /2640 variables (removed 2220) and now considering 600/4040 (removed 3440) transitions.
// Phase 1: matrix 600 rows 420 cols
[2023-03-12 18:32:51] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-12 18:32:51] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-12 18:32:51] [INFO ] Invariant cache hit.
[2023-03-12 18:32:51] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-12 18:32:51] [INFO ] Invariant cache hit.
[2023-03-12 18:32:52] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 420/2640 places, 600/4040 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1203 ms. Remains : 420/2640 places, 600/4040 transitions.
Running random walk in product with property : BART-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s187 1) (EQ s80 1) (EQ s147 1) (EQ s167 1) (EQ s337 1) (EQ s160 1) (EQ s154 1) (EQ s330 1) (EQ s180 1) (EQ s315 1) (EQ s94 1) (EQ s278 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 476 ms.
Product exploration explored 100000 steps with 3 reset in 549 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 760 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 p1), p0, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 18:32:54] [INFO ] Invariant cache hit.
[2023-03-12 18:32:54] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F p0), (F (AND p0 p1)), (F (AND p2 p1)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 7 factoid took 862 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 166 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Support contains 200 out of 420 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 600/600 transitions.
Applied a total of 0 rules in 2 ms. Remains 420 /420 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-12 18:32:56] [INFO ] Invariant cache hit.
[2023-03-12 18:32:56] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 18:32:56] [INFO ] Invariant cache hit.
[2023-03-12 18:32:56] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-12 18:32:56] [INFO ] Invariant cache hit.
[2023-03-12 18:32:56] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 735 ms. Remains : 420/420 places, 600/600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 326 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p2)))), true]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p2))), (F p0)]
Knowledge based reduction with 3 factoid took 376 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 200 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 156 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Product exploration explored 100000 steps with 1 reset in 301 ms.
Product exploration explored 100000 steps with 2 reset in 323 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 164 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0]
Support contains 200 out of 420 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 420/420 places, 600/600 transitions.
Applied a total of 0 rules in 6 ms. Remains 420 /420 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-12 18:32:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 18:32:59] [INFO ] Invariant cache hit.
[2023-03-12 18:32:59] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 376 ms. Remains : 420/420 places, 600/600 transitions.
Support contains 200 out of 420 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 600/600 transitions.
Applied a total of 0 rules in 2 ms. Remains 420 /420 variables (removed 0) and now considering 600/600 (removed 0) transitions.
[2023-03-12 18:32:59] [INFO ] Invariant cache hit.
[2023-03-12 18:32:59] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-12 18:32:59] [INFO ] Invariant cache hit.
[2023-03-12 18:32:59] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-12 18:32:59] [INFO ] Invariant cache hit.
[2023-03-12 18:33:00] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 420/420 places, 600/600 transitions.
Treatment of property BART-PT-020-LTLFireability-00 finished in 10066 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)))'
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 U X(X(p0)))) U p0)&&F(G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U p1)&&F(p2))))))'
[2023-03-12 18:33:00] [INFO ] Flatten gal took : 106 ms
[2023-03-12 18:33:00] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 19 ms.
[2023-03-12 18:33:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2640 places, 4040 transitions and 8080 arcs took 9 ms.
Total runtime 215937 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2182/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393220 kB
MemFree: 151424 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16294668 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2182/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393220 kB
MemFree: 4871724 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16263868 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2182/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393220 kB
MemFree: 4709112 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16253788 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2182/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BART-PT-020-LTLFireability-00
Could not compute solution for formula : BART-PT-020-LTLFireability-05
Could not compute solution for formula : BART-PT-020-LTLFireability-06
Could not compute solution for formula : BART-PT-020-LTLFireability-08

BK_STOP 1678648662631

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BART-PT-020-LTLFireability-00
ltl formula formula --ltl=/tmp/2182/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2640 places, 4040 transitions and 8080 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.680 real 0.220 user 0.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2182/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2182/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2182/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2182/ltl_0_
Killing (15) : 2188 2189 2190 2191 2192
Killing (9) : 2188 2189 2190 2191 2192
ltl formula name BART-PT-020-LTLFireability-05
ltl formula formula --ltl=/tmp/2182/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2640 places, 4040 transitions and 8080 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.740 real 0.190 user 0.310 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2182/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2182/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2182/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2182/ltl_1_
Killing (15) : 2209 2210 2211 2212 2213
Killing (9) : 2209 2210 2211 2212 2213
ltl formula name BART-PT-020-LTLFireability-06
ltl formula formula --ltl=/tmp/2182/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2640 places, 4040 transitions and 8080 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.720 real 0.240 user 0.270 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2182/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2182/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2182/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2182/ltl_2_
Killing (15) : 2226 2227 2228 2229 2230
Killing (9) : 2226 2227 2228 2229 2230
ltl formula name BART-PT-020-LTLFireability-08
ltl formula formula --ltl=/tmp/2182/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2640 places, 4040 transitions and 8080 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.700 real 0.220 user 0.300 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2182/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2182/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2182/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2182/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BART-PT-020, 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 r009-oct2-167813598400780"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-020.tgz
mv BART-PT-020 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 ;