Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r575-smll-171734919600108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919600108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 17K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 46K Jun 2 16:33 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 MedleyA-PT-14-LTLFireability-00
FORMULA_NAME MedleyA-PT-14-LTLFireability-01
FORMULA_NAME MedleyA-PT-14-LTLFireability-02
FORMULA_NAME MedleyA-PT-14-LTLFireability-03
FORMULA_NAME MedleyA-PT-14-LTLFireability-04
FORMULA_NAME MedleyA-PT-14-LTLFireability-05
FORMULA_NAME MedleyA-PT-14-LTLFireability-06
FORMULA_NAME MedleyA-PT-14-LTLFireability-07
FORMULA_NAME MedleyA-PT-14-LTLFireability-08
FORMULA_NAME MedleyA-PT-14-LTLFireability-09
FORMULA_NAME MedleyA-PT-14-LTLFireability-10
FORMULA_NAME MedleyA-PT-14-LTLFireability-11
FORMULA_NAME MedleyA-PT-14-LTLFireability-12
FORMULA_NAME MedleyA-PT-14-LTLFireability-13
FORMULA_NAME MedleyA-PT-14-LTLFireability-14
FORMULA_NAME MedleyA-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717364453368

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:40:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:40:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:40:55] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-06-02 21:40:55] [INFO ] Transformed 184 places.
[2024-06-02 21:40:55] [INFO ] Transformed 178 transitions.
[2024-06-02 21:40:55] [INFO ] Found NUPN structural information;
[2024-06-02 21:40:55] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyA-PT-14-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 178/178 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 150 transition count 144
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 150 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 145 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 145 transition count 139
Applied a total of 78 rules in 65 ms. Remains 145 /184 variables (removed 39) and now considering 139/178 (removed 39) transitions.
// Phase 1: matrix 139 rows 145 cols
[2024-06-02 21:40:55] [INFO ] Computed 24 invariants in 26 ms
[2024-06-02 21:40:56] [INFO ] Implicit Places using invariants in 387 ms returned [38, 75, 114]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 448 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/184 places, 139/178 transitions.
Applied a total of 0 rules in 10 ms. Remains 142 /142 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 550 ms. Remains : 142/184 places, 139/178 transitions.
Support contains 27 out of 142 places after structural reductions.
[2024-06-02 21:40:56] [INFO ] Flatten gal took : 76 ms
[2024-06-02 21:40:56] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:40:56] [INFO ] Input system was already deterministic with 139 transitions.
RANDOM walk for 40000 steps (8 resets) in 2408 ms. (16 steps per ms) remains 1/21 properties
BEST_FIRST walk for 20989 steps (4 resets) in 106 ms. (196 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-14-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA MedleyA-PT-14-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 21 stabilizing places and 21 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 141 transition count 131
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 134 transition count 131
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 14 place count 134 transition count 110
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 56 place count 113 transition count 110
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 107 transition count 104
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 107 transition count 104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 68 place count 107 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 105 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 104 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 104 transition count 101
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 2 with 40 rules applied. Total rules applied 114 place count 84 transition count 81
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 138 place count 72 transition count 99
Applied a total of 138 rules in 104 ms. Remains 72 /142 variables (removed 70) and now considering 99/139 (removed 40) transitions.
// Phase 1: matrix 99 rows 72 cols
[2024-06-02 21:40:58] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 21:40:58] [INFO ] Implicit Places using invariants in 162 ms returned [6, 10, 26, 30, 46, 50]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 165 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/142 places, 99/139 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 66 transition count 96
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 57 transition count 98
Applied a total of 18 rules in 13 ms. Remains 57 /66 variables (removed 9) and now considering 98/99 (removed 1) transitions.
// Phase 1: matrix 98 rows 57 cols
[2024-06-02 21:40:58] [INFO ] Computed 15 invariants in 6 ms
[2024-06-02 21:40:58] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 21:40:58] [INFO ] Invariant cache hit.
[2024-06-02 21:40:58] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 21:40:58] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [11, 27, 41]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 297 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/142 places, 98/139 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 97
Applied a total of 2 rules in 9 ms. Remains 53 /54 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 53 cols
[2024-06-02 21:40:58] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 21:40:58] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 21:40:58] [INFO ] Invariant cache hit.
[2024-06-02 21:40:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 21:40:58] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 53/142 places, 97/139 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 837 ms. Remains : 53/142 places, 97/139 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 339 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-01 finished in 1496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 141 transition count 130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 133 transition count 130
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 16 place count 133 transition count 111
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 54 place count 114 transition count 111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 108 transition count 105
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 108 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 66 place count 108 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 106 transition count 103
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 108 place count 87 transition count 84
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 132 place count 75 transition count 107
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 75 transition count 107
Applied a total of 133 rules in 29 ms. Remains 75 /142 variables (removed 67) and now considering 107/139 (removed 32) transitions.
// Phase 1: matrix 107 rows 75 cols
[2024-06-02 21:40:59] [INFO ] Computed 21 invariants in 4 ms
[2024-06-02 21:40:59] [INFO ] Implicit Places using invariants in 125 ms returned [6, 10, 25, 29, 46, 50]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 126 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/142 places, 107/139 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 69 transition count 104
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 104
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 62 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 60 transition count 104
Applied a total of 18 rules in 10 ms. Remains 60 /69 variables (removed 9) and now considering 104/107 (removed 3) transitions.
// Phase 1: matrix 104 rows 60 cols
[2024-06-02 21:40:59] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:40:59] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 21:40:59] [INFO ] Invariant cache hit.
[2024-06-02 21:40:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 21:40:59] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/142 places, 104/139 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 359 ms. Remains : 60/142 places, 104/139 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 293 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-02 finished in 844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 141 transition count 130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 133 transition count 130
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 16 place count 133 transition count 111
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 54 place count 114 transition count 111
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 109 transition count 106
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 109 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 109 transition count 105
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 108 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 107 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 107 transition count 104
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 2 with 40 rules applied. Total rules applied 108 place count 87 transition count 84
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 134 place count 74 transition count 108
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 74 transition count 108
Applied a total of 135 rules in 51 ms. Remains 74 /142 variables (removed 68) and now considering 108/139 (removed 31) transitions.
// Phase 1: matrix 108 rows 74 cols
[2024-06-02 21:41:00] [INFO ] Computed 21 invariants in 4 ms
[2024-06-02 21:41:00] [INFO ] Implicit Places using invariants in 112 ms returned [6, 10, 26, 30, 46, 50]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 114 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/142 places, 108/139 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 68 transition count 105
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 105
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 59 transition count 107
Applied a total of 18 rules in 14 ms. Remains 59 /68 variables (removed 9) and now considering 107/108 (removed 1) transitions.
// Phase 1: matrix 107 rows 59 cols
[2024-06-02 21:41:00] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:41:00] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:41:00] [INFO ] Invariant cache hit.
[2024-06-02 21:41:00] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 21:41:00] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [11, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 234 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/142 places, 107/139 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 419 ms. Remains : 57/142 places, 107/139 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 211 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-03 finished in 751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 141 transition count 130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 133 transition count 130
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 16 place count 133 transition count 110
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 56 place count 113 transition count 110
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 61 place count 108 transition count 105
Iterating global reduction 2 with 5 rules applied. Total rules applied 66 place count 108 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 66 place count 108 transition count 103
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 106 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 105 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 105 transition count 102
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 114 place count 84 transition count 81
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 140 place count 71 transition count 106
Applied a total of 140 rules in 21 ms. Remains 71 /142 variables (removed 71) and now considering 106/139 (removed 33) transitions.
// Phase 1: matrix 106 rows 71 cols
[2024-06-02 21:41:01] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 21:41:01] [INFO ] Implicit Places using invariants in 97 ms returned [6, 10, 25, 29, 44, 48]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 100 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/142 places, 106/139 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 65 transition count 103
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 62 transition count 103
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 59 transition count 100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 56 transition count 106
Applied a total of 18 rules in 9 ms. Remains 56 /65 variables (removed 9) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 56 cols
[2024-06-02 21:41:01] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:41:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 21:41:01] [INFO ] Invariant cache hit.
[2024-06-02 21:41:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 21:41:01] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [11, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 197 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/142 places, 106/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 331 ms. Remains : 54/142 places, 106/139 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-04
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-14-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-04 finished in 496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0) U p1))||G(F(p2)))))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 141 transition count 130
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 133 transition count 130
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 16 place count 133 transition count 109
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 58 place count 112 transition count 109
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 108 transition count 105
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 108 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 107 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 107 transition count 104
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 112 place count 85 transition count 82
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 138 place count 72 transition count 106
Applied a total of 138 rules in 26 ms. Remains 72 /142 variables (removed 70) and now considering 106/139 (removed 33) transitions.
// Phase 1: matrix 106 rows 72 cols
[2024-06-02 21:41:01] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 21:41:01] [INFO ] Implicit Places using invariants in 99 ms returned [6, 11, 27, 31, 46, 50]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 102 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/142 places, 106/139 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 66 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 103
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 60 transition count 100
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 57 transition count 105
Applied a total of 18 rules in 10 ms. Remains 57 /66 variables (removed 9) and now considering 105/106 (removed 1) transitions.
// Phase 1: matrix 105 rows 57 cols
[2024-06-02 21:41:01] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:41:01] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 21:41:01] [INFO ] Invariant cache hit.
[2024-06-02 21:41:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 21:41:01] [INFO ] Implicit Places using invariants and state equation in 167 ms returned [12, 27, 41]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 246 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/142 places, 105/139 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 104
Applied a total of 2 rules in 6 ms. Remains 53 /54 variables (removed 1) and now considering 104/105 (removed 1) transitions.
// Phase 1: matrix 104 rows 53 cols
[2024-06-02 21:41:01] [INFO ] Computed 12 invariants in 3 ms
[2024-06-02 21:41:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:41:02] [INFO ] Invariant cache hit.
[2024-06-02 21:41:02] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:41:02] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 53/142 places, 104/139 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 624 ms. Remains : 53/142 places, 104/139 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 147 ms.
Product exploration explored 100000 steps with 0 reset in 313 ms.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 189 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 457 ms. (87 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 233 ms. (170 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 190 ms. (209 steps per ms) remains 5/5 properties
[2024-06-02 21:41:03] [INFO ] Invariant cache hit.
[2024-06-02 21:41:03] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/30 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 91/121 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 29/150 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 22/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1/151 variables, 5/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/151 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/151 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3/154 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 2/156 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/156 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/156 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1/157 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/157 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/157 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 94 constraints, problems are : Problem set: 0 solved, 5 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/30 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 91/121 variables, 30/35 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 29/150 variables, 19/54 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 22/76 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 2/78 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/151 variables, 5/83 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/151 variables, 1/84 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-02 21:41:04] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/151 variables, 1/85 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/151 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 3/154 variables, 2/87 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/154 variables, 1/88 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/154 variables, 1/89 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/154 variables, 0/89 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/156 variables, 2/91 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/156 variables, 6/97 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/156 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 1/157 variables, 1/98 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/157 variables, 0/98 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/157 variables, 0/98 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 98 constraints, problems are : Problem set: 2 solved, 3 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 795ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 104/104 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 53 transition count 103
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 53 transition count 101
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 51 transition count 100
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 51 transition count 100
Applied a total of 9 rules in 9 ms. Remains 51 /53 variables (removed 2) and now considering 100/104 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 51/53 places, 100/104 transitions.
RANDOM walk for 1200 steps (151 resets) in 20 ms. (57 steps per ms) remains 0/3 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p2 p0 (NOT p1))), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT p2)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 15 factoid took 253 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-06-02 21:41:04] [INFO ] Invariant cache hit.
[2024-06-02 21:41:04] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:41:04] [INFO ] Invariant cache hit.
[2024-06-02 21:41:05] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:41:05] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-02 21:41:05] [INFO ] Redundant transitions in 4 ms returned []
Running 96 sub problems to find dead transitions.
[2024-06-02 21:41:05] [INFO ] Invariant cache hit.
[2024-06-02 21:41:05] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 21:41:06] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
[2024-06-02 21:41:06] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-02 21:41:06] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 3 ms to minimize.
[2024-06-02 21:41:06] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-06-02 21:41:06] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-06-02 21:41:06] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 6/18 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 103/156 variables, 53/71 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 28/99 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/99 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/100 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/100 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/100 constraints. Problems are: Problem set: 12 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 100 constraints, problems are : Problem set: 12 solved, 84 unsolved in 4103 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 12 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/5 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/7 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/7 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 4/53 variables, 7/14 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 4/18 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 103/156 variables, 53/71 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 28/99 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 84/183 constraints. Problems are: Problem set: 12 solved, 84 unsolved
[2024-06-02 21:41:10] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 1/184 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 0/184 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 1/157 variables, 1/185 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 0/185 constraints. Problems are: Problem set: 12 solved, 84 unsolved
At refinement iteration 14 (OVERLAPS) 0/157 variables, 0/185 constraints. Problems are: Problem set: 12 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 185 constraints, problems are : Problem set: 12 solved, 84 unsolved in 3875 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 84/96 constraints, Known Traps: 7/7 constraints]
After SMT, in 8118ms problems are : Problem set: 12 solved, 84 unsolved
Search for dead transitions found 12 dead transitions in 8125ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 53/53 places, 92/104 transitions.
Graph (complete) has 200 edges and 53 vertex of which 50 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 50 /53 variables (removed 3) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 50 cols
[2024-06-02 21:41:13] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 21:41:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 21:41:13] [INFO ] Invariant cache hit.
[2024-06-02 21:41:13] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:41:13] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/53 places, 92/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8655 ms. Remains : 50/53 places, 92/104 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 211 ms. (188 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
[2024-06-02 21:41:13] [INFO ] Invariant cache hit.
[2024-06-02 21:41:13] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/30 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 79/109 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/135 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/136 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/136 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/139 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/139 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/139 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/141 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/141 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/141 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/142 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/142 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/142 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/24 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/30 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 79/109 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/135 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/136 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/136 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/136 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/139 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/139 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/139 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/139 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/141 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/141 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/141 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/142 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/142 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/142 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 129 ms.
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 92/92 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 91
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 50 transition count 89
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 48 transition count 88
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 48 transition count 88
Applied a total of 9 rules in 8 ms. Remains 48 /50 variables (removed 2) and now considering 88/92 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 48/50 places, 88/92 transitions.
RANDOM walk for 3878 steps (498 resets) in 31 ms. (121 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 7 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 110 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-02 21:41:15] [INFO ] Invariant cache hit.
[2024-06-02 21:41:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:41:15] [INFO ] Invariant cache hit.
[2024-06-02 21:41:15] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:41:15] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 21:41:15] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2024-06-02 21:41:15] [INFO ] Invariant cache hit.
[2024-06-02 21:41:15] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 91/141 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 28/87 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 88 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2220 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 1/50 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 91/141 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 28/87 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 84/171 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 21:41:18] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 1/142 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 173 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3748 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints]
After SMT, in 6024ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 6026ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6217 ms. Remains : 50/50 places, 92/92 transitions.
Treatment of property MedleyA-PT-14-LTLFireability-05 finished in 20042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 139/139 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 136 transition count 133
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 136 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 135 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 135 transition count 132
Applied a total of 14 rules in 6 ms. Remains 135 /142 variables (removed 7) and now considering 132/139 (removed 7) transitions.
// Phase 1: matrix 132 rows 135 cols
[2024-06-02 21:41:21] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 21:41:21] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 21:41:21] [INFO ] Invariant cache hit.
[2024-06-02 21:41:21] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:41:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:41:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 3 ms to minimize.
[2024-06-02 21:41:23] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 21:41:23] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-02 21:41:24] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-02 21:41:24] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:41:24] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:41:24] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 3 ms to minimize.
[2024-06-02 21:41:24] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:41:24] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-06-02 21:41:24] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-06-02 21:41:24] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 6 ms to minimize.
Problem TDEAD125 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 11/32 constraints. Problems are: Problem set: 3 solved, 128 unsolved
[2024-06-02 21:41:25] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 132/267 variables, 135/168 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 168 constraints, problems are : Problem set: 3 solved, 128 unsolved in 7663 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 4/135 variables, 15/17 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 4/21 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 12/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 132/267 variables, 135/168 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 128/296 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/296 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/296 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 296 constraints, problems are : Problem set: 3 solved, 128 unsolved in 5566 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 128/131 constraints, Known Traps: 12/12 constraints]
After SMT, in 13266ms problems are : Problem set: 3 solved, 128 unsolved
Search for dead transitions found 3 dead transitions in 13269ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 135/142 places, 129/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 129
Applied a total of 3 rules in 2 ms. Remains 132 /135 variables (removed 3) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 132 cols
[2024-06-02 21:41:35] [INFO ] Computed 18 invariants in 3 ms
[2024-06-02 21:41:35] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 21:41:35] [INFO ] Invariant cache hit.
[2024-06-02 21:41:35] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 132/142 places, 129/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13818 ms. Remains : 132/142 places, 129/139 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 91 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 0 ms.
FORMULA MedleyA-PT-14-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-06 finished in 14065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 139/139 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 137 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 137 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 136 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 136 transition count 133
Applied a total of 12 rules in 5 ms. Remains 136 /142 variables (removed 6) and now considering 133/139 (removed 6) transitions.
// Phase 1: matrix 133 rows 136 cols
[2024-06-02 21:41:35] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 21:41:35] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 21:41:35] [INFO ] Invariant cache hit.
[2024-06-02 21:41:35] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-02 21:41:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 21:41:37] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-02 21:41:37] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:41:37] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-02 21:41:37] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:41:38] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:41:38] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:41:38] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:41:38] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
[2024-06-02 21:41:38] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-06-02 21:41:38] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-06-02 21:41:38] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 11/32 constraints. Problems are: Problem set: 3 solved, 129 unsolved
[2024-06-02 21:41:39] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/33 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 133/269 variables, 136/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 169 constraints, problems are : Problem set: 3 solved, 129 unsolved in 7784 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 3/21 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 12/33 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 133/269 variables, 136/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 129/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
[2024-06-02 21:41:46] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/299 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 299 constraints, problems are : Problem set: 3 solved, 129 unsolved in 8153 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 129/132 constraints, Known Traps: 13/13 constraints]
After SMT, in 15957ms problems are : Problem set: 3 solved, 129 unsolved
Search for dead transitions found 3 dead transitions in 15960ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/142 places, 130/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 133 transition count 130
Applied a total of 3 rules in 1 ms. Remains 133 /136 variables (removed 3) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 133 cols
[2024-06-02 21:41:51] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 21:41:51] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:41:51] [INFO ] Invariant cache hit.
[2024-06-02 21:41:52] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/142 places, 130/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16479 ms. Remains : 133/142 places, 130/139 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-14-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLFireability-08 finished in 16622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 139/139 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 137 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 137 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 136 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 136 transition count 133
Applied a total of 12 rules in 6 ms. Remains 136 /142 variables (removed 6) and now considering 133/139 (removed 6) transitions.
// Phase 1: matrix 133 rows 136 cols
[2024-06-02 21:41:52] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 21:41:52] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 21:41:52] [INFO ] Invariant cache hit.
[2024-06-02 21:41:52] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-02 21:41:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-06-02 21:41:54] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:41:54] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:41:54] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
[2024-06-02 21:41:54] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 3 ms to minimize.
[2024-06-02 21:41:54] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:41:54] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 3 ms to minimize.
[2024-06-02 21:41:55] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-06-02 21:41:55] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-02 21:41:55] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-06-02 21:41:55] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 10/31 constraints. Problems are: Problem set: 3 solved, 129 unsolved
[2024-06-02 21:41:55] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 3 ms to minimize.
[2024-06-02 21:41:55] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 2/33 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 133/269 variables, 136/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 169 constraints, problems are : Problem set: 3 solved, 129 unsolved in 7512 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 3/21 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 12/33 constraints. Problems are: Problem set: 3 solved, 129 unsolved
[2024-06-02 21:42:01] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/34 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 133/269 variables, 136/170 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 129/299 constraints. Problems are: Problem set: 3 solved, 129 unsolved
[2024-06-02 21:42:03] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/300 constraints. Problems are: Problem set: 3 solved, 129 unsolved
[2024-06-02 21:42:04] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 3 ms to minimize.
[2024-06-02 21:42:05] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 2/302 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 12 (OVERLAPS) 0/269 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 302 constraints, problems are : Problem set: 3 solved, 129 unsolved in 11117 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 129/132 constraints, Known Traps: 16/16 constraints]
After SMT, in 18659ms problems are : Problem set: 3 solved, 129 unsolved
Search for dead transitions found 3 dead transitions in 18663ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/142 places, 130/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 133 transition count 130
Applied a total of 3 rules in 2 ms. Remains 133 /136 variables (removed 3) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 133 cols
[2024-06-02 21:42:11] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 21:42:11] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 21:42:11] [INFO ] Invariant cache hit.
[2024-06-02 21:42:11] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/142 places, 130/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19325 ms. Remains : 133/142 places, 130/139 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 137 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 1 ms.
FORMULA MedleyA-PT-14-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLFireability-10 finished in 19632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p1)&&(p2||F(G(p0)))))))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 139/139 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 137 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 137 transition count 134
Applied a total of 10 rules in 4 ms. Remains 137 /142 variables (removed 5) and now considering 134/139 (removed 5) transitions.
// Phase 1: matrix 134 rows 137 cols
[2024-06-02 21:42:11] [INFO ] Computed 21 invariants in 1 ms
[2024-06-02 21:42:12] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-02 21:42:12] [INFO ] Invariant cache hit.
[2024-06-02 21:42:12] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-06-02 21:42:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 21:42:14] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 3 ms to minimize.
[2024-06-02 21:42:14] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-02 21:42:14] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:42:14] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:42:15] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 3 ms to minimize.
[2024-06-02 21:42:15] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
[2024-06-02 21:42:15] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 5 ms to minimize.
[2024-06-02 21:42:15] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:42:16] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-02 21:42:16] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-06-02 21:42:16] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-06-02 21:42:16] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 12/33 constraints. Problems are: Problem set: 3 solved, 130 unsolved
[2024-06-02 21:42:16] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/34 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 134/271 variables, 137/171 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/171 constraints. Problems are: Problem set: 3 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 171 constraints, problems are : Problem set: 3 solved, 130 unsolved in 9760 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 3 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 4/137 variables, 15/17 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 4/21 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 13/34 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 134/271 variables, 137/171 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 130/301 constraints. Problems are: Problem set: 3 solved, 130 unsolved
[2024-06-02 21:42:25] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-06-02 21:42:25] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/303 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/303 constraints. Problems are: Problem set: 3 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/303 constraints. Problems are: Problem set: 3 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 303 constraints, problems are : Problem set: 3 solved, 130 unsolved in 10059 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 130/133 constraints, Known Traps: 15/15 constraints]
After SMT, in 19849ms problems are : Problem set: 3 solved, 130 unsolved
Search for dead transitions found 3 dead transitions in 19852ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 137/142 places, 131/139 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 134 transition count 131
Applied a total of 3 rules in 3 ms. Remains 134 /137 variables (removed 3) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 134 cols
[2024-06-02 21:42:32] [INFO ] Computed 18 invariants in 1 ms
[2024-06-02 21:42:32] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-02 21:42:32] [INFO ] Invariant cache hit.
[2024-06-02 21:42:32] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 134/142 places, 131/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20628 ms. Remains : 134/142 places, 131/139 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Detected a total of 19/134 stabilizing places and 19/131 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-14-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-14-LTLFireability-15 finished in 21502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0) U p1))||G(F(p2)))))'
[2024-06-02 21:42:33] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:42:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 21:42:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 142 places, 139 transitions and 398 arcs took 7 ms.
Total runtime 98578 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-14

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 142
TRANSITIONS: 139
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.003s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1201
MODEL NAME: /home/mcc/execution/411/model
142 places, 139 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-14-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717364556263

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="MedleyA-PT-14"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-14, 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 r575-smll-171734919600108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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