About the Execution of 2023-gold for FlexibleBarrier-PT-12b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
589.027 | 52574.00 | 79175.00 | 547.90 | FFFFFFTTFFFFFTFF | normal |
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.r197-tall-171640624800048.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 FlexibleBarrier-PT-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640624800048
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 08:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 536K May 18 16:42 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 FlexibleBarrier-PT-12b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716495938049
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=FlexibleBarrier-PT-12b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 20:25:39] [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-05-23 20:25:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:25:39] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-23 20:25:39] [INFO ] Transformed 1988 places.
[2024-05-23 20:25:39] [INFO ] Transformed 2289 transitions.
[2024-05-23 20:25:39] [INFO ] Found NUPN structural information;
[2024-05-23 20:25:39] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1988 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Discarding 782 places :
Symmetric choice reduction at 0 with 782 rule applications. Total rules 782 place count 1206 transition count 1507
Iterating global reduction 0 with 782 rules applied. Total rules applied 1564 place count 1206 transition count 1507
Discarding 353 places :
Symmetric choice reduction at 0 with 353 rule applications. Total rules 1917 place count 853 transition count 1154
Iterating global reduction 0 with 353 rules applied. Total rules applied 2270 place count 853 transition count 1154
Discarding 220 places :
Symmetric choice reduction at 0 with 220 rule applications. Total rules 2490 place count 633 transition count 934
Iterating global reduction 0 with 220 rules applied. Total rules applied 2710 place count 633 transition count 934
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 0 with 104 rules applied. Total rules applied 2814 place count 633 transition count 830
Applied a total of 2814 rules in 432 ms. Remains 633 /1988 variables (removed 1355) and now considering 830/2289 (removed 1459) transitions.
// Phase 1: matrix 830 rows 633 cols
[2024-05-23 20:25:40] [INFO ] Computed 14 invariants in 30 ms
[2024-05-23 20:25:40] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-23 20:25:40] [INFO ] Invariant cache hit.
[2024-05-23 20:25:41] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
[2024-05-23 20:25:41] [INFO ] Invariant cache hit.
[2024-05-23 20:25:41] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 633/1988 places, 830/2289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1640 ms. Remains : 633/1988 places, 830/2289 transitions.
Support contains 43 out of 633 places after structural reductions.
[2024-05-23 20:25:42] [INFO ] Flatten gal took : 72 ms
[2024-05-23 20:25:42] [INFO ] Flatten gal took : 42 ms
[2024-05-23 20:25:42] [INFO ] Input system was already deterministic with 830 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 30) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2024-05-23 20:25:42] [INFO ] Invariant cache hit.
[2024-05-23 20:25:43] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-23 20:25:43] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2024-05-23 20:25:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-23 20:25:44] [INFO ] After 760ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2024-05-23 20:25:44] [INFO ] Deduced a trap composed of 171 places in 247 ms of which 7 ms to minimize.
[2024-05-23 20:25:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2024-05-23 20:25:45] [INFO ] Deduced a trap composed of 233 places in 173 ms of which 1 ms to minimize.
[2024-05-23 20:25:45] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 1 ms to minimize.
[2024-05-23 20:25:46] [INFO ] Deduced a trap composed of 234 places in 177 ms of which 1 ms to minimize.
[2024-05-23 20:25:46] [INFO ] Deduced a trap composed of 168 places in 165 ms of which 1 ms to minimize.
[2024-05-23 20:25:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 791 ms
[2024-05-23 20:25:46] [INFO ] After 2858ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 533 ms.
[2024-05-23 20:25:47] [INFO ] After 3892ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :20
Fused 21 Parikh solutions to 17 different solutions.
Parikh walk visited 14 properties in 125 ms.
Support contains 10 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 580 edges and 633 vertex of which 67 / 633 are part of one of the 11 SCC in 4 ms
Free SCC test removed 56 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 577 transition count 701
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 516 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 515 transition count 700
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 125 place count 515 transition count 668
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 189 place count 483 transition count 668
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 226 place count 446 transition count 631
Iterating global reduction 3 with 37 rules applied. Total rules applied 263 place count 446 transition count 631
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 266 place count 446 transition count 628
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 275 place count 437 transition count 619
Iterating global reduction 4 with 9 rules applied. Total rules applied 284 place count 437 transition count 619
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 293 place count 437 transition count 610
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 5 with 158 rules applied. Total rules applied 451 place count 358 transition count 531
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 474 place count 358 transition count 508
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 487 place count 345 transition count 495
Iterating global reduction 6 with 13 rules applied. Total rules applied 500 place count 345 transition count 495
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 501 place count 345 transition count 494
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 503 place count 344 transition count 494
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 505 place count 344 transition count 492
Free-agglomeration rule applied 266 times.
Iterating global reduction 7 with 266 rules applied. Total rules applied 771 place count 344 transition count 226
Reduce places removed 266 places and 0 transitions.
Drop transitions removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 7 with 354 rules applied. Total rules applied 1125 place count 78 transition count 138
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 1134 place count 78 transition count 129
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1135 place count 78 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1136 place count 77 transition count 128
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 60 edges and 76 vertex of which 22 / 76 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 1138 place count 65 transition count 128
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1160 place count 65 transition count 106
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 12 Pre rules applied. Total rules applied 1160 place count 65 transition count 94
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1184 place count 53 transition count 94
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1196 place count 53 transition count 82
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1222 place count 40 transition count 69
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1223 place count 40 transition count 68
Free-agglomeration rule applied 12 times.
Iterating global reduction 11 with 12 rules applied. Total rules applied 1235 place count 40 transition count 56
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 11 with 42 rules applied. Total rules applied 1277 place count 21 transition count 33
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 1283 place count 21 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1284 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1285 place count 20 transition count 26
Applied a total of 1285 rules in 258 ms. Remains 20 /633 variables (removed 613) and now considering 26/830 (removed 804) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 20/633 places, 26/830 transitions.
Finished random walk after 516 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=129 )
Parikh walk visited 0 properties in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 15 stabilizing places and 15 stable transitions
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))&&(G(p1)||X(G((X(p0)&&p2))))))'
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 610 transition count 807
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 610 transition count 807
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 610 transition count 804
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 593 transition count 787
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 593 transition count 787
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 93 place count 593 transition count 777
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 589 transition count 773
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 589 transition count 773
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 589 transition count 771
Applied a total of 103 rules in 49 ms. Remains 589 /633 variables (removed 44) and now considering 771/830 (removed 59) transitions.
// Phase 1: matrix 771 rows 589 cols
[2024-05-23 20:25:48] [INFO ] Computed 14 invariants in 13 ms
[2024-05-23 20:25:48] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-23 20:25:48] [INFO ] Invariant cache hit.
[2024-05-23 20:25:48] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-05-23 20:25:48] [INFO ] Invariant cache hit.
[2024-05-23 20:25:49] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 589/633 places, 771/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1037 ms. Remains : 589/633 places, 771/830 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 430 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) p2), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p1 p2), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=7 dest: 6}]], initial=0, aps=[p1:(EQ s314 1), p0:(AND (EQ s210 1) (EQ s384 1) (EQ s520 1)), p2:(AND (EQ s210 1) (EQ s384 1) (EQ s520 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-00 finished in 1534 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(p1))))'
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 580 edges and 633 vertex of which 67 / 633 are part of one of the 11 SCC in 2 ms
Free SCC test removed 56 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 576 transition count 708
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 512 transition count 708
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 129 place count 512 transition count 676
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 193 place count 480 transition count 676
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 236 place count 437 transition count 633
Iterating global reduction 2 with 43 rules applied. Total rules applied 279 place count 437 transition count 633
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 283 place count 437 transition count 629
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 283 place count 437 transition count 628
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 436 transition count 628
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 294 place count 427 transition count 619
Iterating global reduction 3 with 9 rules applied. Total rules applied 303 place count 427 transition count 619
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 312 place count 427 transition count 610
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 464 place count 351 transition count 534
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 468 place count 347 transition count 530
Iterating global reduction 4 with 4 rules applied. Total rules applied 472 place count 347 transition count 530
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 476 place count 347 transition count 526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
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 480 place count 345 transition count 539
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 493 place count 345 transition count 526
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 494 place count 344 transition count 525
Applied a total of 494 rules in 180 ms. Remains 344 /633 variables (removed 289) and now considering 525/830 (removed 305) transitions.
[2024-05-23 20:25:49] [INFO ] Flow matrix only has 503 transitions (discarded 22 similar events)
// Phase 1: matrix 503 rows 344 cols
[2024-05-23 20:25:49] [INFO ] Computed 14 invariants in 8 ms
[2024-05-23 20:25:49] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-23 20:25:49] [INFO ] Flow matrix only has 503 transitions (discarded 22 similar events)
[2024-05-23 20:25:49] [INFO ] Invariant cache hit.
[2024-05-23 20:25:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:25:50] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-23 20:25:50] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-23 20:25:50] [INFO ] Flow matrix only has 503 transitions (discarded 22 similar events)
[2024-05-23 20:25:50] [INFO ] Invariant cache hit.
[2024-05-23 20:25:50] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 344/633 places, 525/830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 910 ms. Remains : 344/633 places, 525/830 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s200 1), p0:(EQ s107 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, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-02 finished in 1003 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(X(X(G(p0)))))'
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 609 transition count 806
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 609 transition count 806
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 609 transition count 802
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 592 transition count 785
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 592 transition count 785
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 95 place count 592 transition count 776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 587 transition count 771
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 587 transition count 771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 587 transition count 768
Applied a total of 108 rules in 51 ms. Remains 587 /633 variables (removed 46) and now considering 768/830 (removed 62) transitions.
// Phase 1: matrix 768 rows 587 cols
[2024-05-23 20:25:50] [INFO ] Computed 14 invariants in 15 ms
[2024-05-23 20:25:50] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-23 20:25:50] [INFO ] Invariant cache hit.
[2024-05-23 20:25:51] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-23 20:25:51] [INFO ] Invariant cache hit.
[2024-05-23 20:25:51] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 587/633 places, 768/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 957 ms. Remains : 587/633 places, 768/830 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s54 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1126 reset in 280 ms.
Product exploration explored 100000 steps with 1131 reset in 253 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 813737 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{}
Probabilistic random walk after 813737 steps, saw 207448 distinct states, run finished after 3002 ms. (steps per millisecond=271 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:25:55] [INFO ] Invariant cache hit.
[2024-05-23 20:25:55] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 20:25:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-23 20:25:55] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 20:25:55] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-23 20:25:56] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Applied a total of 0 rules in 16 ms. Remains 587 /587 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 20:25:56] [INFO ] Invariant cache hit.
[2024-05-23 20:25:56] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-23 20:25:56] [INFO ] Invariant cache hit.
[2024-05-23 20:25:57] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-05-23 20:25:57] [INFO ] Invariant cache hit.
[2024-05-23 20:25:57] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 587/587 places, 768/768 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 847386 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Probabilistic random walk after 847386 steps, saw 213860 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:26:00] [INFO ] Invariant cache hit.
[2024-05-23 20:26:00] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 20:26:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-23 20:26:01] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 20:26:01] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-23 20:26:01] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 85233 steps with 962 reset in 163 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-03 finished in 11469 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)))'
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 610 transition count 807
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 610 transition count 807
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 610 transition count 803
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 594 transition count 787
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 594 transition count 787
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 91 place count 594 transition count 778
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 590 transition count 774
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 590 transition count 774
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 590 transition count 772
Applied a total of 101 rules in 61 ms. Remains 590 /633 variables (removed 43) and now considering 772/830 (removed 58) transitions.
// Phase 1: matrix 772 rows 590 cols
[2024-05-23 20:26:02] [INFO ] Computed 14 invariants in 16 ms
[2024-05-23 20:26:02] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-23 20:26:02] [INFO ] Invariant cache hit.
[2024-05-23 20:26:02] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2024-05-23 20:26:02] [INFO ] Invariant cache hit.
[2024-05-23 20:26:02] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 590/633 places, 772/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 955 ms. Remains : 590/633 places, 772/830 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s203 0) (EQ s278 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 87509 steps with 985 reset in 206 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-04 finished in 1280 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(X(G(p0))))'
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 609 transition count 806
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 609 transition count 806
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 609 transition count 802
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 592 transition count 785
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 592 transition count 785
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 95 place count 592 transition count 776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 587 transition count 771
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 587 transition count 771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 587 transition count 768
Applied a total of 108 rules in 51 ms. Remains 587 /633 variables (removed 46) and now considering 768/830 (removed 62) transitions.
// Phase 1: matrix 768 rows 587 cols
[2024-05-23 20:26:03] [INFO ] Computed 14 invariants in 13 ms
[2024-05-23 20:26:03] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-23 20:26:03] [INFO ] Invariant cache hit.
[2024-05-23 20:26:03] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-23 20:26:03] [INFO ] Invariant cache hit.
[2024-05-23 20:26:04] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 587/633 places, 768/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 980 ms. Remains : 587/633 places, 768/830 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s239 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1120 reset in 193 ms.
Product exploration explored 100000 steps with 1120 reset in 208 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 111 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 817132 steps, run timeout after 3001 ms. (steps per millisecond=272 ) properties seen :{}
Probabilistic random walk after 817132 steps, saw 207963 distinct states, run finished after 3008 ms. (steps per millisecond=271 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:26:08] [INFO ] Invariant cache hit.
[2024-05-23 20:26:08] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-23 20:26:08] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 20:26:08] [INFO ] After 246ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-23 20:26:08] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 57 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Applied a total of 0 rules in 15 ms. Remains 587 /587 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-23 20:26:08] [INFO ] Invariant cache hit.
[2024-05-23 20:26:08] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-23 20:26:08] [INFO ] Invariant cache hit.
[2024-05-23 20:26:09] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-23 20:26:09] [INFO ] Invariant cache hit.
[2024-05-23 20:26:09] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 880 ms. Remains : 587/587 places, 768/768 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 812420 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :{}
Probabilistic random walk after 812420 steps, saw 207174 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 20:26:12] [INFO ] Invariant cache hit.
[2024-05-23 20:26:12] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-23 20:26:13] [INFO ] After 216ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 20:26:13] [INFO ] After 260ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-23 20:26:13] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 85050 steps with 957 reset in 166 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-05 finished in 10702 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) U (p1&&X(p2))) U (G(p3) U !p0))))'
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 612 transition count 809
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 612 transition count 809
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 612 transition count 805
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 598 transition count 791
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 598 transition count 791
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 81 place count 598 transition count 784
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 593 transition count 779
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 593 transition count 779
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 593 transition count 776
Applied a total of 94 rules in 53 ms. Remains 593 /633 variables (removed 40) and now considering 776/830 (removed 54) transitions.
// Phase 1: matrix 776 rows 593 cols
[2024-05-23 20:26:14] [INFO ] Computed 14 invariants in 14 ms
[2024-05-23 20:26:14] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-23 20:26:14] [INFO ] Invariant cache hit.
[2024-05-23 20:26:14] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2024-05-23 20:26:14] [INFO ] Invariant cache hit.
[2024-05-23 20:26:14] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 593/633 places, 776/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 970 ms. Remains : 593/633 places, 776/830 transitions.
Stuttering acceptance computed with spot in 496 ms :[p0, p0, (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p3 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p3 p1), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p3), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={} source=9 dest: 8}]], initial=0, aps=[p0:(EQ s165 1), p3:(EQ s557 1), p1:(EQ s282 1), p2:(EQ s240 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 578 ms.
Product exploration explored 100000 steps with 50000 reset in 497 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (NOT (AND p0 p3 p1))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 34 factoid took 29 ms. Reduced automaton from 10 states, 36 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-12b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-06 finished in 2630 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))||(p1 U p2)))'
Support contains 5 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 610 transition count 807
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 610 transition count 807
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 610 transition count 803
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 593 transition count 786
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 593 transition count 786
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 593 transition count 776
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 589 transition count 772
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 589 transition count 772
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 589 transition count 769
Applied a total of 105 rules in 53 ms. Remains 589 /633 variables (removed 44) and now considering 769/830 (removed 61) transitions.
// Phase 1: matrix 769 rows 589 cols
[2024-05-23 20:26:16] [INFO ] Computed 14 invariants in 12 ms
[2024-05-23 20:26:16] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-23 20:26:16] [INFO ] Invariant cache hit.
[2024-05-23 20:26:17] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2024-05-23 20:26:17] [INFO ] Invariant cache hit.
[2024-05-23 20:26:17] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 589/633 places, 769/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 956 ms. Remains : 589/633 places, 769/830 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (EQ s151 1) (EQ s587 1)), p1:(AND (EQ s472 1) (NEQ s143 1)), p0:(OR (EQ s189 1) (AND (EQ s151 1) (EQ s587 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-08 finished in 1157 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||X(p1)) U X((p2&&G(p3)))))'
Support contains 7 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 611 transition count 808
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 611 transition count 808
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 611 transition count 805
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 63 place count 595 transition count 789
Iterating global reduction 1 with 16 rules applied. Total rules applied 79 place count 595 transition count 789
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 89 place count 595 transition count 779
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 592 transition count 776
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 592 transition count 776
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 592 transition count 774
Applied a total of 97 rules in 50 ms. Remains 592 /633 variables (removed 41) and now considering 774/830 (removed 56) transitions.
// Phase 1: matrix 774 rows 592 cols
[2024-05-23 20:26:17] [INFO ] Computed 14 invariants in 12 ms
[2024-05-23 20:26:17] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-23 20:26:17] [INFO ] Invariant cache hit.
[2024-05-23 20:26:18] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2024-05-23 20:26:18] [INFO ] Invariant cache hit.
[2024-05-23 20:26:18] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 592/633 places, 774/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 938 ms. Remains : 592/633 places, 774/830 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), true, (NOT p3), (AND (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=2 dest: 5}, { cond=(AND p2 p3), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(NOT p3), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s77 1), p1:(AND (EQ s347 1) (EQ s47 1) (EQ s354 1) (EQ s555 1)), p2:(EQ s127 1), p3:(NEQ s517 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-09 finished in 1254 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(F(p0)))'
Support contains 3 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 592 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 571 transition count 702
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 506 transition count 702
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 131 place count 506 transition count 671
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 193 place count 475 transition count 671
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 238 place count 430 transition count 626
Iterating global reduction 2 with 45 rules applied. Total rules applied 283 place count 430 transition count 626
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 286 place count 430 transition count 623
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 286 place count 430 transition count 622
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 288 place count 429 transition count 622
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 297 place count 420 transition count 613
Iterating global reduction 3 with 9 rules applied. Total rules applied 306 place count 420 transition count 613
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 315 place count 420 transition count 604
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 461 place count 347 transition count 531
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 465 place count 343 transition count 527
Iterating global reduction 4 with 4 rules applied. Total rules applied 469 place count 343 transition count 527
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 473 place count 343 transition count 523
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 485 place count 343 transition count 511
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 487 place count 341 transition count 509
Applied a total of 487 rules in 111 ms. Remains 341 /633 variables (removed 292) and now considering 509/830 (removed 321) transitions.
[2024-05-23 20:26:19] [INFO ] Flow matrix only has 486 transitions (discarded 23 similar events)
// Phase 1: matrix 486 rows 341 cols
[2024-05-23 20:26:19] [INFO ] Computed 14 invariants in 9 ms
[2024-05-23 20:26:19] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-23 20:26:19] [INFO ] Flow matrix only has 486 transitions (discarded 23 similar events)
[2024-05-23 20:26:19] [INFO ] Invariant cache hit.
[2024-05-23 20:26:19] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-05-23 20:26:19] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-23 20:26:19] [INFO ] Flow matrix only has 486 transitions (discarded 23 similar events)
[2024-05-23 20:26:19] [INFO ] Invariant cache hit.
[2024-05-23 20:26:19] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 341/633 places, 509/830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 734 ms. Remains : 341/633 places, 509/830 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s106 1) (EQ s114 1) (EQ s283 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-10 finished in 830 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((F(G(!p0))&&F(p1))))'
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 593 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 2 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 571 transition count 702
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 506 transition count 702
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 131 place count 506 transition count 671
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 193 place count 475 transition count 671
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 237 place count 431 transition count 627
Iterating global reduction 2 with 44 rules applied. Total rules applied 281 place count 431 transition count 627
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 285 place count 431 transition count 623
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 285 place count 431 transition count 622
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 430 transition count 622
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 296 place count 421 transition count 613
Iterating global reduction 3 with 9 rules applied. Total rules applied 305 place count 421 transition count 613
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 314 place count 421 transition count 604
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 460 place count 348 transition count 531
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 462 place count 346 transition count 529
Iterating global reduction 4 with 2 rules applied. Total rules applied 464 place count 346 transition count 529
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 466 place count 346 transition count 527
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 478 place count 346 transition count 515
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 480 place count 344 transition count 513
Applied a total of 480 rules in 109 ms. Remains 344 /633 variables (removed 289) and now considering 513/830 (removed 317) transitions.
[2024-05-23 20:26:19] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2024-05-23 20:26:19] [INFO ] Computed 14 invariants in 7 ms
[2024-05-23 20:26:20] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-23 20:26:20] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
[2024-05-23 20:26:20] [INFO ] Invariant cache hit.
[2024-05-23 20:26:20] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-23 20:26:20] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:26:20] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
[2024-05-23 20:26:20] [INFO ] Invariant cache hit.
[2024-05-23 20:26:20] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 344/633 places, 513/830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 748 ms. Remains : 344/633 places, 513/830 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s131 1), p1:(EQ s18 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 99082 steps with 5344 reset in 575 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-11 finished in 1461 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(F(p0)))'
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 581 edges and 633 vertex of which 67 / 633 are part of one of the 11 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 576 transition count 707
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 511 transition count 707
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 131 place count 511 transition count 675
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 195 place count 479 transition count 675
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 238 place count 436 transition count 632
Iterating global reduction 2 with 43 rules applied. Total rules applied 281 place count 436 transition count 632
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 285 place count 436 transition count 628
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 285 place count 436 transition count 627
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 435 transition count 627
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 296 place count 426 transition count 618
Iterating global reduction 3 with 9 rules applied. Total rules applied 305 place count 426 transition count 618
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 314 place count 426 transition count 609
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 464 place count 351 transition count 534
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 468 place count 347 transition count 530
Iterating global reduction 4 with 4 rules applied. Total rules applied 472 place count 347 transition count 530
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 476 place count 347 transition count 526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
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 480 place count 345 transition count 539
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 494 place count 345 transition count 525
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 496 place count 343 transition count 523
Applied a total of 496 rules in 106 ms. Remains 343 /633 variables (removed 290) and now considering 523/830 (removed 307) transitions.
[2024-05-23 20:26:21] [INFO ] Flow matrix only has 501 transitions (discarded 22 similar events)
// Phase 1: matrix 501 rows 343 cols
[2024-05-23 20:26:21] [INFO ] Computed 14 invariants in 14 ms
[2024-05-23 20:26:21] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-23 20:26:21] [INFO ] Flow matrix only has 501 transitions (discarded 22 similar events)
[2024-05-23 20:26:21] [INFO ] Invariant cache hit.
[2024-05-23 20:26:21] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-05-23 20:26:21] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 20:26:21] [INFO ] Flow matrix only has 501 transitions (discarded 22 similar events)
[2024-05-23 20:26:21] [INFO ] Invariant cache hit.
[2024-05-23 20:26:22] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 343/633 places, 523/830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 761 ms. Remains : 343/633 places, 523/830 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s146 0) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-12 finished in 860 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) U (G(F(p1))||G(p2)))))'
Support contains 3 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 610 transition count 807
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 610 transition count 807
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 610 transition count 803
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 593 transition count 786
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 593 transition count 786
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 593 transition count 776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 588 transition count 771
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 588 transition count 771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 588 transition count 768
Applied a total of 107 rules in 53 ms. Remains 588 /633 variables (removed 45) and now considering 768/830 (removed 62) transitions.
// Phase 1: matrix 768 rows 588 cols
[2024-05-23 20:26:22] [INFO ] Computed 14 invariants in 10 ms
[2024-05-23 20:26:22] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-23 20:26:22] [INFO ] Invariant cache hit.
[2024-05-23 20:26:22] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-23 20:26:22] [INFO ] Invariant cache hit.
[2024-05-23 20:26:23] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/633 places, 768/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 927 ms. Remains : 588/633 places, 768/830 transitions.
Stuttering acceptance computed with spot in 387 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s309 1) (EQ s304 1)), p2:(EQ s509 1), p0:(NEQ s304 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]]
Stuttering criterion allowed to conclude after 145 steps with 2 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-14 finished in 1347 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||G(p1)))))'
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 609 transition count 806
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 609 transition count 806
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 609 transition count 802
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 592 transition count 785
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 592 transition count 785
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 95 place count 592 transition count 776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 587 transition count 771
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 587 transition count 771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 587 transition count 768
Applied a total of 108 rules in 51 ms. Remains 587 /633 variables (removed 46) and now considering 768/830 (removed 62) transitions.
// Phase 1: matrix 768 rows 587 cols
[2024-05-23 20:26:23] [INFO ] Computed 14 invariants in 10 ms
[2024-05-23 20:26:23] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-23 20:26:23] [INFO ] Invariant cache hit.
[2024-05-23 20:26:24] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-23 20:26:24] [INFO ] Invariant cache hit.
[2024-05-23 20:26:24] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 587/633 places, 768/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 978 ms. Remains : 587/633 places, 768/830 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s581 0), p0:(EQ s240 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1126 reset in 182 ms.
Product exploration explored 100000 steps with 1125 reset in 244 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-23 20:26:25] [INFO ] Invariant cache hit.
[2024-05-23 20:26:25] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-23 20:26:25] [INFO ] After 222ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-23 20:26:25] [INFO ] After 277ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 20:26:25] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 20:26:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-23 20:26:26] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 20:26:26] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-23 20:26:26] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 55 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 2 out of 587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Graph (trivial) has 426 edges and 587 vertex of which 73 / 587 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 525 transition count 647
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 467 transition count 647
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 117 place count 467 transition count 622
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 167 place count 442 transition count 622
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 190 place count 419 transition count 599
Iterating global reduction 2 with 23 rules applied. Total rules applied 213 place count 419 transition count 599
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 361 place count 345 transition count 525
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 363 place count 343 transition count 523
Applied a total of 363 rules in 51 ms. Remains 343 /587 variables (removed 244) and now considering 523/768 (removed 245) transitions.
[2024-05-23 20:26:26] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
// Phase 1: matrix 489 rows 343 cols
[2024-05-23 20:26:26] [INFO ] Computed 14 invariants in 12 ms
[2024-05-23 20:26:27] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-23 20:26:27] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
[2024-05-23 20:26:27] [INFO ] Invariant cache hit.
[2024-05-23 20:26:27] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2024-05-23 20:26:27] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-23 20:26:27] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
[2024-05-23 20:26:27] [INFO ] Invariant cache hit.
[2024-05-23 20:26:27] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 343/587 places, 523/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 705 ms. Remains : 343/587 places, 523/768 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 5 factoid took 282 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 524 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-23 20:26:28] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
[2024-05-23 20:26:28] [INFO ] Invariant cache hit.
[2024-05-23 20:26:28] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-23 20:26:28] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-23 20:26:28] [INFO ] After 170ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 20:26:28] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 20:26:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-23 20:26:28] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 20:26:28] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-23 20:26:28] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 523/523 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 343 transition count 499
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 36 place count 331 transition count 487
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 331 transition count 487
Free-agglomeration rule applied 146 times.
Iterating global reduction 1 with 146 rules applied. Total rules applied 194 place count 331 transition count 341
Reduce places removed 147 places and 0 transitions.
Graph (trivial) has 60 edges and 184 vertex of which 24 / 184 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 1 with 148 rules applied. Total rules applied 342 place count 172 transition count 341
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 366 place count 172 transition count 317
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 366 place count 172 transition count 305
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 390 place count 160 transition count 305
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 444 place count 106 transition count 251
Iterating global reduction 3 with 54 rules applied. Total rules applied 498 place count 106 transition count 251
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 552 place count 106 transition count 197
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 576 place count 94 transition count 185
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 589 place count 94 transition count 172
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 601 place count 94 transition count 160
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 4 with 100 rules applied. Total rules applied 701 place count 71 transition count 83
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 5 with 110 rules applied. Total rules applied 811 place count 16 transition count 28
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 821 place count 6 transition count 18
Iterating global reduction 6 with 10 rules applied. Total rules applied 831 place count 6 transition count 18
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 841 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 842 place count 6 transition count 7
Applied a total of 842 rules in 36 ms. Remains 6 /343 variables (removed 337) and now considering 7/523 (removed 516) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 6/343 places, 7/523 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 302 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering criterion allowed to conclude after 46 steps with 2 reset in 2 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-15 finished in 6089 ms.
All properties solved by simple procedures.
Total runtime 50066 ms.
BK_STOP 1716495990623
--------------------
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="FlexibleBarrier-PT-12b"
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 FlexibleBarrier-PT-12b, 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 r197-tall-171640624800048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;