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.r597-smll-171734926500083.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 gold2023
Input is MedleyA-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 175K 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-17-LTLFireability-00
FORMULA_NAME MedleyA-PT-17-LTLFireability-01
FORMULA_NAME MedleyA-PT-17-LTLFireability-02
FORMULA_NAME MedleyA-PT-17-LTLFireability-03
FORMULA_NAME MedleyA-PT-17-LTLFireability-04
FORMULA_NAME MedleyA-PT-17-LTLFireability-05
FORMULA_NAME MedleyA-PT-17-LTLFireability-06
FORMULA_NAME MedleyA-PT-17-LTLFireability-07
FORMULA_NAME MedleyA-PT-17-LTLFireability-08
FORMULA_NAME MedleyA-PT-17-LTLFireability-09
FORMULA_NAME MedleyA-PT-17-LTLFireability-10
FORMULA_NAME MedleyA-PT-17-LTLFireability-11
FORMULA_NAME MedleyA-PT-17-LTLFireability-12
FORMULA_NAME MedleyA-PT-17-LTLFireability-13
FORMULA_NAME MedleyA-PT-17-LTLFireability-14
FORMULA_NAME MedleyA-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717363117721

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 21:18:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:18:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:18:41] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2024-06-02 21:18:41] [INFO ] Transformed 248 places.
[2024-06-02 21:18:41] [INFO ] Transformed 591 transitions.
[2024-06-02 21:18:41] [INFO ] Found NUPN structural information;
[2024-06-02 21:18:41] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-17-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 589/589 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 199 transition count 509
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 199 transition count 509
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 132 place count 199 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 197 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 197 transition count 471
Applied a total of 136 rules in 73 ms. Remains 197 /248 variables (removed 51) and now considering 471/589 (removed 118) transitions.
// Phase 1: matrix 471 rows 197 cols
[2024-06-02 21:18:41] [INFO ] Computed 7 invariants in 28 ms
[2024-06-02 21:18:41] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-06-02 21:18:41] [INFO ] Invariant cache hit.
[2024-06-02 21:18:42] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2024-06-02 21:18:42] [INFO ] Invariant cache hit.
[2024-06-02 21:18:42] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/248 places, 471/589 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1360 ms. Remains : 197/248 places, 471/589 transitions.
Support contains 43 out of 197 places after structural reductions.
[2024-06-02 21:18:43] [INFO ] Flatten gal took : 120 ms
[2024-06-02 21:18:43] [INFO ] Flatten gal took : 67 ms
[2024-06-02 21:18:43] [INFO ] Input system was already deterministic with 471 transitions.
Support contains 39 out of 197 places (down from 43) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 344 resets, run finished after 727 ms. (steps per millisecond=13 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 368097 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{4=1, 5=1, 11=1, 15=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1}
Probabilistic random walk after 368097 steps, saw 67540 distinct states, run finished after 3002 ms. (steps per millisecond=122 ) properties seen :11
Running SMT prover for 14 properties.
[2024-06-02 21:18:47] [INFO ] Invariant cache hit.
[2024-06-02 21:18:47] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:18:47] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-06-02 21:18:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:18:49] [INFO ] After 1004ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 8 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-06-02 21:18:49] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-02 21:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-06-02 21:18:50] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 1 ms to minimize.
[2024-06-02 21:18:50] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 1 ms to minimize.
[2024-06-02 21:18:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 495 ms
[2024-06-02 21:18:50] [INFO ] After 2803ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 545 ms.
[2024-06-02 21:18:51] [INFO ] After 3619ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 330 ms.
Support contains 23 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 144 edges and 197 vertex of which 6 / 197 are part of one of the 2 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 193 transition count 440
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 168 transition count 438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 166 transition count 438
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 55 place count 166 transition count 423
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 151 transition count 423
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 147 transition count 415
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 147 transition count 415
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 146 transition count 399
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 146 transition count 399
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 137 place count 125 transition count 378
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 120 transition count 390
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 158 place count 120 transition count 379
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 166 place count 116 transition count 375
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 178 place count 110 transition count 415
Free-agglomeration rule applied 27 times.
Iterating global reduction 3 with 27 rules applied. Total rules applied 205 place count 110 transition count 388
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 252 place count 83 transition count 368
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 257 place count 83 transition count 363
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 262 place count 83 transition count 370
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 275 place count 78 transition count 362
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 77 transition count 361
Applied a total of 276 rules in 208 ms. Remains 77 /197 variables (removed 120) and now considering 361/471 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 77/197 places, 361/471 transitions.
Incomplete random walk after 10000 steps, including 1588 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 507 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 536 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Finished probabilistic random walk after 237303 steps, run visited all 11 properties in 1060 ms. (steps per millisecond=223 )
Probabilistic random walk after 237303 steps, saw 43458 distinct states, run finished after 1060 ms. (steps per millisecond=223 ) properties seen :11
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-17-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-17-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
FORMULA MedleyA-PT-17-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 197 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 190 transition count 439
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 165 transition count 437
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 163 transition count 437
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 55 place count 163 transition count 422
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 85 place count 148 transition count 422
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 93 place count 140 transition count 407
Iterating global reduction 3 with 8 rules applied. Total rules applied 101 place count 140 transition count 407
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 139 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 139 transition count 391
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 149 place count 116 transition count 368
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 115 transition count 356
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 115 transition count 356
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 197 place count 92 transition count 444
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 201 place count 92 transition count 440
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 203 place count 90 transition count 424
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 90 transition count 424
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 213 place count 90 transition count 416
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 89 transition count 431
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 237 place count 89 transition count 409
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 245 place count 85 transition count 405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 84 transition count 404
Applied a total of 246 rules in 125 ms. Remains 84 /197 variables (removed 113) and now considering 404/471 (removed 67) transitions.
[2024-06-02 21:18:55] [INFO ] Flow matrix only has 372 transitions (discarded 32 similar events)
// Phase 1: matrix 372 rows 84 cols
[2024-06-02 21:18:55] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:18:55] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 21:18:55] [INFO ] Flow matrix only has 372 transitions (discarded 32 similar events)
[2024-06-02 21:18:55] [INFO ] Invariant cache hit.
[2024-06-02 21:18:55] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-06-02 21:18:55] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-06-02 21:18:55] [INFO ] Redundant transitions in 35 ms returned []
[2024-06-02 21:18:55] [INFO ] Flow matrix only has 372 transitions (discarded 32 similar events)
[2024-06-02 21:18:55] [INFO ] Invariant cache hit.
[2024-06-02 21:18:56] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/197 places, 404/471 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 860 ms. Remains : 84/197 places, 404/471 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 212 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-03 finished in 1154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(G((X(p1) U p2)))))'
Support contains 10 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 458
Applied a total of 14 rules in 8 ms. Remains 190 /197 variables (removed 7) and now considering 458/471 (removed 13) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-02 21:18:56] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:18:56] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 21:18:56] [INFO ] Invariant cache hit.
[2024-06-02 21:18:56] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-06-02 21:18:56] [INFO ] Invariant cache hit.
[2024-06-02 21:18:57] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 458/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 190/197 places, 458/471 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s47 1), p2:(AND (EQ s37 1) (EQ s77 1) (EQ s129 1) (EQ s186 1)), p1:(AND (EQ s19 1) (EQ s36 1) (EQ s46 1) (EQ s66 1) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-05 finished in 999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (p1||G(!p0))) U (F(p2) U p3)))'
Support contains 7 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 175 edges and 197 vertex of which 6 / 197 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 192 transition count 439
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 165 transition count 439
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 55 place count 165 transition count 422
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 89 place count 148 transition count 422
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 142 transition count 411
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 142 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 141 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 141 transition count 395
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 149 place count 118 transition count 372
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 118 transition count 371
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 117 transition count 359
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 117 transition count 359
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 176 place count 105 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 178 place count 105 transition count 410
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 104 transition count 425
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 197 place count 104 transition count 408
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 205 place count 100 transition count 404
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 209 place count 98 transition count 413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 210 place count 97 transition count 412
Applied a total of 210 rules in 126 ms. Remains 97 /197 variables (removed 100) and now considering 412/471 (removed 59) transitions.
[2024-06-02 21:18:57] [INFO ] Flow matrix only has 397 transitions (discarded 15 similar events)
// Phase 1: matrix 397 rows 97 cols
[2024-06-02 21:18:57] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:18:57] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 21:18:57] [INFO ] Flow matrix only has 397 transitions (discarded 15 similar events)
[2024-06-02 21:18:57] [INFO ] Invariant cache hit.
[2024-06-02 21:18:57] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 21:18:57] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-06-02 21:18:57] [INFO ] Redundant transitions in 10 ms returned []
[2024-06-02 21:18:57] [INFO ] Flow matrix only has 397 transitions (discarded 15 similar events)
[2024-06-02 21:18:57] [INFO ] Invariant cache hit.
[2024-06-02 21:18:58] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/197 places, 412/471 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 765 ms. Remains : 97/197 places, 412/471 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) (NOT p0))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s9 1) (EQ s45 1) (EQ s92 1) (EQ s95 1)), p1:(AND (NEQ s3 1) (NOT (OR (EQ s3 1) (AND (EQ s9 1) (EQ s45 1) (EQ s92 1) (EQ s95 1))))), p0:(OR (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-07 finished in 1008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 189 transition count 456
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 189 transition count 456
Applied a total of 16 rules in 9 ms. Remains 189 /197 variables (removed 8) and now considering 456/471 (removed 15) transitions.
// Phase 1: matrix 456 rows 189 cols
[2024-06-02 21:18:58] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:18:58] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 21:18:58] [INFO ] Invariant cache hit.
[2024-06-02 21:18:58] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-06-02 21:18:58] [INFO ] Invariant cache hit.
[2024-06-02 21:18:59] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/197 places, 456/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 189/197 places, 456/471 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s36 1) (EQ s56 1) (EQ s65 1) (EQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 4 ms.
FORMULA MedleyA-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-09 finished in 959 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 191 transition count 459
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 191 transition count 459
Applied a total of 12 rules in 7 ms. Remains 191 /197 variables (removed 6) and now considering 459/471 (removed 12) transitions.
// Phase 1: matrix 459 rows 191 cols
[2024-06-02 21:18:59] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:18:59] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-02 21:18:59] [INFO ] Invariant cache hit.
[2024-06-02 21:19:00] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-06-02 21:19:00] [INFO ] Invariant cache hit.
[2024-06-02 21:19:00] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/197 places, 459/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1054 ms. Remains : 191/197 places, 459/471 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s41 0), p1:(EQ s164 1), p2:(AND (EQ s91 1) (EQ s45 1) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3448 reset in 323 ms.
Product exploration explored 100000 steps with 3447 reset in 304 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 160 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 344 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 541753 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{3=1}
Probabilistic random walk after 541753 steps, saw 100253 distinct states, run finished after 3004 ms. (steps per millisecond=180 ) properties seen :1
Running SMT prover for 4 properties.
[2024-06-02 21:19:05] [INFO ] Invariant cache hit.
[2024-06-02 21:19:05] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 21:19:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-06-02 21:19:06] [INFO ] After 905ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 21:19:07] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2024-06-02 21:19:08] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 2 ms to minimize.
[2024-06-02 21:19:08] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2024-06-02 21:19:08] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2024-06-02 21:19:08] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2024-06-02 21:19:08] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2024-06-02 21:19:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1030 ms
[2024-06-02 21:19:08] [INFO ] After 3369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 582 ms.
[2024-06-02 21:19:09] [INFO ] After 4060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 186 ms.
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 459/459 transitions.
Graph (trivial) has 184 edges and 191 vertex of which 9 / 191 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 185 transition count 423
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 158 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 157 transition count 422
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 57 place count 157 transition count 408
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 85 place count 143 transition count 408
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 133 place count 119 transition count 384
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 117 transition count 356
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 117 transition count 356
Performed 24 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 185 place count 93 transition count 473
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 203 place count 93 transition count 455
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 205 place count 91 transition count 439
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 91 transition count 439
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 211 place count 91 transition count 435
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 91 transition count 431
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 223 place count 87 transition count 427
Free-agglomeration rule applied 30 times.
Iterating global reduction 5 with 30 rules applied. Total rules applied 253 place count 87 transition count 397
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 82 rules applied. Total rules applied 335 place count 57 transition count 345
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 369 place count 57 transition count 311
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 373 place count 57 transition count 307
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 377 place count 53 transition count 307
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 7 with 32 rules applied. Total rules applied 409 place count 53 transition count 275
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 413 place count 51 transition count 305
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 416 place count 51 transition count 302
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 418 place count 51 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 420 place count 49 transition count 330
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 421 place count 48 transition count 329
Applied a total of 421 rules in 145 ms. Remains 48 /191 variables (removed 143) and now considering 329/459 (removed 130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 48/191 places, 329/459 transitions.
Incomplete random walk after 10000 steps, including 243 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :3
Finished Best-First random walk after 4349 steps, including 61 resets, run visited all 1 properties in 9 ms. (steps per millisecond=483 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 340 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 191 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 191/191 places, 459/459 transitions.
Graph (trivial) has 184 edges and 191 vertex of which 9 / 191 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 184 transition count 426
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 158 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 157 transition count 425
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 55 place count 157 transition count 411
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 83 place count 143 transition count 411
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 131 place count 119 transition count 387
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 117 transition count 359
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 117 transition count 359
Performed 22 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 179 place count 95 transition count 442
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 183 place count 95 transition count 438
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 93 transition count 422
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 93 transition count 422
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 191 place count 93 transition count 418
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 195 place count 91 transition count 448
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 221 place count 91 transition count 422
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 5 with 8 rules applied. Total rules applied 229 place count 87 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 86 transition count 417
Applied a total of 230 rules in 72 ms. Remains 86 /191 variables (removed 105) and now considering 417/459 (removed 42) transitions.
[2024-06-02 21:19:10] [INFO ] Flow matrix only has 389 transitions (discarded 28 similar events)
// Phase 1: matrix 389 rows 86 cols
[2024-06-02 21:19:10] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:19:10] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 21:19:10] [INFO ] Flow matrix only has 389 transitions (discarded 28 similar events)
[2024-06-02 21:19:10] [INFO ] Invariant cache hit.
[2024-06-02 21:19:10] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 21:19:11] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2024-06-02 21:19:11] [INFO ] Redundant transitions in 38 ms returned []
[2024-06-02 21:19:11] [INFO ] Flow matrix only has 389 transitions (discarded 28 similar events)
[2024-06-02 21:19:11] [INFO ] Invariant cache hit.
[2024-06-02 21:19:11] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/191 places, 417/459 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 883 ms. Remains : 86/191 places, 417/459 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 156 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1866 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 345 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 341 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 349 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 342 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 349 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Finished probabilistic random walk after 246224 steps, run visited all 5 properties in 1594 ms. (steps per millisecond=154 )
Probabilistic random walk after 246224 steps, saw 56948 distinct states, run finished after 1595 ms. (steps per millisecond=154 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F p2), (F p1), (F (NOT p0)), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 12 factoid took 341 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 18186 reset in 399 ms.
Product exploration explored 100000 steps with 18227 reset in 453 ms.
Built C files in :
/tmp/ltsmin2799716735913813672
[2024-06-02 21:19:15] [INFO ] Computing symmetric may disable matrix : 417 transitions.
[2024-06-02 21:19:15] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:19:15] [INFO ] Computing symmetric may enable matrix : 417 transitions.
[2024-06-02 21:19:15] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:19:15] [INFO ] Computing Do-Not-Accords matrix : 417 transitions.
[2024-06-02 21:19:15] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:19:15] [INFO ] Built C files in 177ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2799716735913813672
Running compilation step : cd /tmp/ltsmin2799716735913813672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1690 ms.
Running link step : cd /tmp/ltsmin2799716735913813672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin2799716735913813672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased287188810286815519.hoa' '--buchi-type=spotba'
LTSmin run took 1826 ms.
FORMULA MedleyA-PT-17-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLFireability-10 finished in 20098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 458
Applied a total of 14 rules in 5 ms. Remains 190 /197 variables (removed 7) and now considering 458/471 (removed 13) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-02 21:19:19] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:19:19] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-02 21:19:19] [INFO ] Invariant cache hit.
[2024-06-02 21:19:20] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-06-02 21:19:20] [INFO ] Invariant cache hit.
[2024-06-02 21:19:20] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 458/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 928 ms. Remains : 190/197 places, 458/471 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s62 1), p1:(AND (OR (EQ s14 0) (EQ s101 0)) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-17-LTLFireability-12 finished in 1143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(p1)&&X(X(G(p0)))))))'
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 190 transition count 458
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 190 transition count 458
Applied a total of 14 rules in 5 ms. Remains 190 /197 variables (removed 7) and now considering 458/471 (removed 13) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-02 21:19:20] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:19:20] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-02 21:19:20] [INFO ] Invariant cache hit.
[2024-06-02 21:19:21] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-06-02 21:19:21] [INFO ] Invariant cache hit.
[2024-06-02 21:19:21] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/197 places, 458/471 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 923 ms. Remains : 190/197 places, 458/471 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s85 0), p1:(EQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3448 reset in 225 ms.
Product exploration explored 100000 steps with 3447 reset in 197 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 344 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Finished probabilistic random walk after 163532 steps, run visited all 3 properties in 1090 ms. (steps per millisecond=150 )
Probabilistic random walk after 163532 steps, saw 30106 distinct states, run finished after 1090 ms. (steps per millisecond=150 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 458/458 transitions.
Applied a total of 0 rules in 2 ms. Remains 190 /190 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2024-06-02 21:19:24] [INFO ] Invariant cache hit.
[2024-06-02 21:19:24] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 21:19:24] [INFO ] Invariant cache hit.
[2024-06-02 21:19:24] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-06-02 21:19:24] [INFO ] Invariant cache hit.
[2024-06-02 21:19:25] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 190/190 places, 458/458 transitions.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 344 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Finished probabilistic random walk after 163532 steps, run visited all 3 properties in 993 ms. (steps per millisecond=164 )
Probabilistic random walk after 163532 steps, saw 30106 distinct states, run finished after 993 ms. (steps per millisecond=164 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 3448 reset in 147 ms.
Product exploration explored 100000 steps with 3448 reset in 157 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 458/458 transitions.
Graph (trivial) has 187 edges and 190 vertex of which 9 / 190 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 184 transition count 452
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 28 place count 184 transition count 455
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 184 transition count 455
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 64 place count 184 transition count 459
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 81 place count 167 transition count 416
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 98 place count 167 transition count 416
Performed 24 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 122 place count 167 transition count 568
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 128 place count 167 transition count 562
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 139 place count 156 transition count 530
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 150 place count 156 transition count 530
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 155 place count 156 transition count 525
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 158 place count 153 transition count 520
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 161 place count 153 transition count 520
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 153 transition count 560
Deduced a syphon composed of 61 places in 0 ms
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 192 place count 153 transition count 531
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 194 place count 151 transition count 527
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 196 place count 151 transition count 527
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 200 place count 151 transition count 527
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 204 place count 147 transition count 523
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 208 place count 147 transition count 523
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 208 rules in 86 ms. Remains 147 /190 variables (removed 43) and now considering 523/458 (removed -65) transitions.
[2024-06-02 21:19:28] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 21:19:28] [INFO ] Flow matrix only has 495 transitions (discarded 28 similar events)
// Phase 1: matrix 495 rows 147 cols
[2024-06-02 21:19:28] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:19:28] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/190 places, 523/458 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 413 ms. Remains : 147/190 places, 523/458 transitions.
Built C files in :
/tmp/ltsmin774256191153585199
[2024-06-02 21:19:28] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin774256191153585199
Running compilation step : cd /tmp/ltsmin774256191153585199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1308 ms.
Running link step : cd /tmp/ltsmin774256191153585199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin774256191153585199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10277498720965846244.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 458/458 transitions.
Applied a total of 0 rules in 3 ms. Remains 190 /190 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 190 cols
[2024-06-02 21:19:43] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:19:44] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-02 21:19:44] [INFO ] Invariant cache hit.
[2024-06-02 21:19:44] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-06-02 21:19:44] [INFO ] Invariant cache hit.
[2024-06-02 21:19:44] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 831 ms. Remains : 190/190 places, 458/458 transitions.
Built C files in :
/tmp/ltsmin2688329818571925569
[2024-06-02 21:19:44] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2688329818571925569
Running compilation step : cd /tmp/ltsmin2688329818571925569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1296 ms.
Running link step : cd /tmp/ltsmin2688329818571925569;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2688329818571925569;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12886010400224155730.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 21:20:00] [INFO ] Flatten gal took : 58 ms
[2024-06-02 21:20:00] [INFO ] Flatten gal took : 53 ms
[2024-06-02 21:20:00] [INFO ] Time to serialize gal into /tmp/LTL6714027897958028829.gal : 8 ms
[2024-06-02 21:20:00] [INFO ] Time to serialize properties into /tmp/LTL6470745100790448826.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6714027897958028829.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8760571864917797365.hoa' '-atoms' '/tmp/LTL6470745100790448826.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6470745100790448826.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8760571864917797365.hoa
Detected timeout of ITS tools.
[2024-06-02 21:20:15] [INFO ] Flatten gal took : 44 ms
[2024-06-02 21:20:15] [INFO ] Flatten gal took : 37 ms
[2024-06-02 21:20:15] [INFO ] Time to serialize gal into /tmp/LTL18361419342157682355.gal : 6 ms
[2024-06-02 21:20:15] [INFO ] Time to serialize properties into /tmp/LTL9175962587429631041.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18361419342157682355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9175962587429631041.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(p116==0)")||((F("(p134==1)"))&&(X(X(G("(p116==0)"))))))))
Formula 0 simplified : F(!"(p116==0)" & (G!"(p134==1)" | XXF!"(p116==0)"))
Detected timeout of ITS tools.
[2024-06-02 21:20:30] [INFO ] Flatten gal took : 36 ms
[2024-06-02 21:20:30] [INFO ] Applying decomposition
[2024-06-02 21:20:30] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13136799713484490259.txt' '-o' '/tmp/graph13136799713484490259.bin' '-w' '/tmp/graph13136799713484490259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13136799713484490259.bin' '-l' '-1' '-v' '-w' '/tmp/graph13136799713484490259.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:20:30] [INFO ] Decomposing Gal with order
[2024-06-02 21:20:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:20:30] [INFO ] Removed a total of 1066 redundant transitions.
[2024-06-02 21:20:30] [INFO ] Flatten gal took : 142 ms
[2024-06-02 21:20:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 34 ms.
[2024-06-02 21:20:30] [INFO ] Time to serialize gal into /tmp/LTL12830609576528237364.gal : 15 ms
[2024-06-02 21:20:30] [INFO ] Time to serialize properties into /tmp/LTL6790326033260189751.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12830609576528237364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6790326033260189751.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(i2.u23.p116==0)")||((F("(i3.u28.p134==1)"))&&(X(X(G("(i2.u23.p116==0)"))))))))
Formula 0 simplified : F(!"(i2.u23.p116==0)" & (G!"(i3.u28.p134==1)" | XXF!"(i2.u23.p116==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7466398316910455924
[2024-06-02 21:20:45] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7466398316910455924
Running compilation step : cd /tmp/ltsmin7466398316910455924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1145 ms.
Running link step : cd /tmp/ltsmin7466398316910455924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7466398316910455924;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((LTLAPp0==true)||(<>((LTLAPp1==true))&&X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property MedleyA-PT-17-LTLFireability-13 finished in 100550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p1)||G(!p2))))))'
Support contains 3 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 200 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 190 transition count 438
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 164 transition count 438
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 53 place count 164 transition count 422
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 85 place count 148 transition count 422
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 141 transition count 409
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 141 transition count 409
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 140 transition count 393
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 140 transition count 393
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 145 place count 118 transition count 371
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 117 transition count 359
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 117 transition count 359
Performed 23 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 193 place count 94 transition count 449
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 197 place count 94 transition count 445
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 199 place count 92 transition count 429
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 92 transition count 429
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 209 place count 92 transition count 421
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 213 place count 90 transition count 451
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 228 place count 90 transition count 436
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 4 with 8 rules applied. Total rules applied 236 place count 86 transition count 432
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 86 transition count 432
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 249 place count 86 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 85 transition count 420
Applied a total of 250 rules in 85 ms. Remains 85 /197 variables (removed 112) and now considering 420/471 (removed 51) transitions.
[2024-06-02 21:21:01] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
// Phase 1: matrix 388 rows 85 cols
[2024-06-02 21:21:01] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:21:01] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 21:21:01] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-02 21:21:01] [INFO ] Invariant cache hit.
[2024-06-02 21:21:01] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 21:21:01] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-06-02 21:21:01] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 21:21:01] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-02 21:21:01] [INFO ] Invariant cache hit.
[2024-06-02 21:21:02] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/197 places, 420/471 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 891 ms. Remains : 85/197 places, 420/471 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : MedleyA-PT-17-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s16 1) (AND (EQ s15 1) (EQ s60 1))), p1:(AND (EQ s15 1) (EQ s60 1)), p2:(AND (NOT (AND (EQ s15 1) (EQ s60 1))) (EQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 18224 reset in 268 ms.
Product exploration explored 100000 steps with 18224 reset in 371 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 188 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Incomplete random walk after 10000 steps, including 1879 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 343 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 349 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:21:03] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-02 21:21:03] [INFO ] Invariant cache hit.
[2024-06-02 21:21:03] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (G (NOT (AND (NOT p1) p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND (NOT p1) p2) (AND (NOT p1) (NOT p0)))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 14 factoid took 660 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 420/420 transitions.
Applied a total of 0 rules in 9 ms. Remains 85 /85 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-06-02 21:21:04] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-02 21:21:04] [INFO ] Invariant cache hit.
[2024-06-02 21:21:04] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 21:21:04] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-02 21:21:04] [INFO ] Invariant cache hit.
[2024-06-02 21:21:04] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-06-02 21:21:05] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-06-02 21:21:05] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 21:21:05] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-02 21:21:05] [INFO ] Invariant cache hit.
[2024-06-02 21:21:05] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 738 ms. Remains : 85/85 places, 420/420 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) p2))), (X p0), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 183 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Incomplete random walk after 10000 steps, including 1865 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 352 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 347 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :5
Running SMT prover for 1 properties.
[2024-06-02 21:21:05] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2024-06-02 21:21:05] [INFO ] Invariant cache hit.
[2024-06-02 21:21:06] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p1) p2 p0))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) p2))), (X p0), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (G (NOT (AND (NOT p1) p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (OR (AND (NOT p1) p2) (AND (NOT p1) (NOT p0)))), (F (NOT p0)), (F (NOT (AND (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 14 factoid took 532 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Product exploration explored 100000 steps with 18174 reset in 244 ms.
Product exploration explored 100000 steps with 18265 reset in 270 ms.
Built C files in :
/tmp/ltsmin11663382148370656444
[2024-06-02 21:21:07] [INFO ] Computing symmetric may disable matrix : 420 transitions.
[2024-06-02 21:21:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:21:07] [INFO ] Computing symmetric may enable matrix : 420 transitions.
[2024-06-02 21:21:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:21:07] [INFO ] Computing Do-Not-Accords matrix : 420 transitions.
[2024-06-02 21:21:07] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:21:07] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11663382148370656444
Running compilation step : cd /tmp/ltsmin11663382148370656444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1653 ms.
Running link step : cd /tmp/ltsmin11663382148370656444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11663382148370656444;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12223657738554037958.hoa' '--buchi-type=spotba'
LTSmin run took 1246 ms.
FORMULA MedleyA-PT-17-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-17-LTLFireability-14 finished in 9514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(p1)&&X(X(G(p0)))))))'
Found a Lengthening insensitive property : MedleyA-PT-17-LTLFireability-13
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 197/197 places, 471/471 transitions.
Graph (trivial) has 198 edges and 197 vertex of which 9 / 197 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 190 transition count 438
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 164 transition count 438
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 53 place count 164 transition count 423
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 83 place count 149 transition count 423
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 142 transition count 410
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 142 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 141 transition count 394
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 141 transition count 394
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 145 place count 118 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 118 transition count 370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 117 transition count 358
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 117 transition count 358
Performed 23 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 194 place count 94 transition count 451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 196 place count 94 transition count 449
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 197 place count 93 transition count 441
Iterating global reduction 4 with 1 rules applied. Total rules applied 198 place count 93 transition count 441
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 202 place count 93 transition count 437
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 204 place count 92 transition count 452
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 91 transition count 451
Applied a total of 205 rules in 60 ms. Remains 91 /197 variables (removed 106) and now considering 451/471 (removed 20) transitions.
[2024-06-02 21:21:10] [INFO ] Flow matrix only has 423 transitions (discarded 28 similar events)
// Phase 1: matrix 423 rows 91 cols
[2024-06-02 21:21:11] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:21:11] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 21:21:11] [INFO ] Flow matrix only has 423 transitions (discarded 28 similar events)
[2024-06-02 21:21:11] [INFO ] Invariant cache hit.
[2024-06-02 21:21:11] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-02 21:21:11] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
[2024-06-02 21:21:11] [INFO ] Flow matrix only has 423 transitions (discarded 28 similar events)
[2024-06-02 21:21:11] [INFO ] Invariant cache hit.
[2024-06-02 21:21:11] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 91/197 places, 451/471 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 857 ms. Remains : 91/197 places, 451/471 transitions.
Running random walk in product with property : MedleyA-PT-17-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s56 0), p1:(EQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 17406 reset in 185 ms.
Product exploration explored 100000 steps with 17390 reset in 199 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 1775 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 338 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 328 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 330 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Finished probabilistic random walk after 27007 steps, run visited all 3 properties in 167 ms. (steps per millisecond=161 )
Probabilistic random walk after 27007 steps, saw 6451 distinct states, run finished after 167 ms. (steps per millisecond=161 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 451/451 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-06-02 21:21:13] [INFO ] Flow matrix only has 423 transitions (discarded 28 similar events)
[2024-06-02 21:21:13] [INFO ] Invariant cache hit.
[2024-06-02 21:21:13] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 21:21:13] [INFO ] Flow matrix only has 423 transitions (discarded 28 similar events)
[2024-06-02 21:21:13] [INFO ] Invariant cache hit.
[2024-06-02 21:21:13] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-02 21:21:13] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-06-02 21:21:13] [INFO ] Flow matrix only has 423 transitions (discarded 28 similar events)
[2024-06-02 21:21:13] [INFO ] Invariant cache hit.
[2024-06-02 21:21:14] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 885 ms. Remains : 91/91 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Incomplete random walk after 10000 steps, including 1763 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 326 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 315 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 319 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Finished probabilistic random walk after 27007 steps, run visited all 3 properties in 173 ms. (steps per millisecond=156 )
Probabilistic random walk after 27007 steps, saw 6451 distinct states, run finished after 173 ms. (steps per millisecond=156 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 17456 reset in 188 ms.
Product exploration explored 100000 steps with 17455 reset in 203 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 451/451 transitions.
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 91 transition count 428
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 91 transition count 428
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 27 rules in 17 ms. Remains 91 /91 variables (removed 0) and now considering 428/451 (removed 23) transitions.
[2024-06-02 21:21:16] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 21:21:16] [INFO ] Flow matrix only has 400 transitions (discarded 28 similar events)
// Phase 1: matrix 400 rows 91 cols
[2024-06-02 21:21:16] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:21:16] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/91 places, 428/451 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 91/91 places, 428/451 transitions.
Built C files in :
/tmp/ltsmin5919088153684947221
[2024-06-02 21:21:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5919088153684947221
Running compilation step : cd /tmp/ltsmin5919088153684947221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1315 ms.
Running link step : cd /tmp/ltsmin5919088153684947221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5919088153684947221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18364613338144444240.hoa' '--buchi-type=spotba'
LTSmin run took 730 ms.
Treatment of property MedleyA-PT-17-LTLFireability-13 finished in 8346 ms.
FORMULA MedleyA-PT-17-LTLFireability-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 21:21:19] [INFO ] Flatten gal took : 28 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 158275 ms.

BK_STOP 1717363280642

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-17"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is MedleyA-PT-17, 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 r597-smll-171734926500083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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