Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838856000548.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FlexibleBarrier-PT-16b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856000548
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 12:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 945K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678566587865

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 20:29:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 20:29:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 20:29:49] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-03-11 20:29:49] [INFO ] Transformed 3472 places.
[2023-03-11 20:29:49] [INFO ] Transformed 4001 transitions.
[2023-03-11 20:29:49] [INFO ] Found NUPN structural information;
[2023-03-11 20:29:49] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 3472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Discarding 1414 places :
Symmetric choice reduction at 0 with 1414 rule applications. Total rules 1414 place count 2058 transition count 2587
Iterating global reduction 0 with 1414 rules applied. Total rules applied 2828 place count 2058 transition count 2587
Discarding 668 places :
Symmetric choice reduction at 0 with 668 rule applications. Total rules 3496 place count 1390 transition count 1919
Iterating global reduction 0 with 668 rules applied. Total rules applied 4164 place count 1390 transition count 1919
Discarding 423 places :
Symmetric choice reduction at 0 with 423 rule applications. Total rules 4587 place count 967 transition count 1496
Iterating global reduction 0 with 423 rules applied. Total rules applied 5010 place count 967 transition count 1496
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 0 with 201 rules applied. Total rules applied 5211 place count 967 transition count 1295
Applied a total of 5211 rules in 762 ms. Remains 967 /3472 variables (removed 2505) and now considering 1295/4001 (removed 2706) transitions.
// Phase 1: matrix 1295 rows 967 cols
[2023-03-11 20:29:50] [INFO ] Computed 18 place invariants in 50 ms
[2023-03-11 20:29:51] [INFO ] Implicit Places using invariants in 579 ms returned []
[2023-03-11 20:29:51] [INFO ] Invariant cache hit.
[2023-03-11 20:29:52] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2023-03-11 20:29:52] [INFO ] Invariant cache hit.
[2023-03-11 20:29:52] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 967/3472 places, 1295/4001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2727 ms. Remains : 967/3472 places, 1295/4001 transitions.
Support contains 41 out of 967 places after structural reductions.
[2023-03-11 20:29:53] [INFO ] Flatten gal took : 121 ms
[2023-03-11 20:29:53] [INFO ] Flatten gal took : 69 ms
[2023-03-11 20:29:53] [INFO ] Input system was already deterministic with 1295 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 35) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) 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 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-11 20:29:54] [INFO ] Invariant cache hit.
[2023-03-11 20:29:54] [INFO ] After 721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-11 20:29:55] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-11 20:29:57] [INFO ] After 1370ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :26
[2023-03-11 20:29:58] [INFO ] Deduced a trap composed of 319 places in 283 ms of which 5 ms to minimize.
[2023-03-11 20:29:58] [INFO ] Deduced a trap composed of 278 places in 287 ms of which 1 ms to minimize.
[2023-03-11 20:29:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 690 ms
[2023-03-11 20:29:59] [INFO ] After 3909ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :26
Attempting to minimize the solution found.
Minimization took 1055 ms.
[2023-03-11 20:30:00] [INFO ] After 5931ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :26
Fused 28 Parikh solutions to 24 different solutions.
Parikh walk visited 14 properties in 263 ms.
Support contains 15 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Graph (trivial) has 895 edges and 967 vertex of which 97 / 967 are part of one of the 16 SCC in 7 ms
Free SCC test removed 81 places
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 886 transition count 1120
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 809 transition count 1120
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 155 place count 809 transition count 1085
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 225 place count 774 transition count 1085
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 271 place count 728 transition count 1039
Iterating global reduction 2 with 46 rules applied. Total rules applied 317 place count 728 transition count 1039
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 319 place count 728 transition count 1037
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 329 place count 718 transition count 1027
Iterating global reduction 3 with 10 rules applied. Total rules applied 339 place count 718 transition count 1027
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 344 place count 718 transition count 1022
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 546 place count 617 transition count 921
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 578 place count 617 transition count 889
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 601 place count 594 transition count 866
Iterating global reduction 5 with 23 rules applied. Total rules applied 624 place count 594 transition count 866
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 631 place count 594 transition count 859
Free-agglomeration rule applied 489 times.
Iterating global reduction 6 with 489 rules applied. Total rules applied 1120 place count 594 transition count 370
Reduce places removed 489 places and 0 transitions.
Drop transitions removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Iterating post reduction 6 with 696 rules applied. Total rules applied 1816 place count 105 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1817 place count 104 transition count 162
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 80 edges and 103 vertex of which 32 / 103 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1819 place count 87 transition count 162
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 1851 place count 87 transition count 130
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1851 place count 87 transition count 114
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1883 place count 71 transition count 114
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 1899 place count 71 transition count 98
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 1931 place count 55 transition count 82
Free-agglomeration rule applied 16 times.
Iterating global reduction 10 with 16 rules applied. Total rules applied 1947 place count 55 transition count 66
Reduce places removed 25 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 10 with 49 rules applied. Total rules applied 1996 place count 30 transition count 42
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 2001 place count 30 transition count 37
Applied a total of 2001 rules in 424 ms. Remains 30 /967 variables (removed 937) and now considering 37/1295 (removed 1258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 30/967 places, 37/1295 transitions.
Finished random walk after 151 steps, including 0 resets, run visited all 12 properties in 3 ms. (steps per millisecond=50 )
FORMULA FlexibleBarrier-PT-16b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 18 stabilizing places and 18 stable transitions
FORMULA FlexibleBarrier-PT-16b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 938 transition count 1266
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 938 transition count 1266
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 938 transition count 1263
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 84 place count 915 transition count 1240
Iterating global reduction 1 with 23 rules applied. Total rules applied 107 place count 915 transition count 1240
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 120 place count 915 transition count 1227
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 128 place count 907 transition count 1219
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 907 transition count 1219
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 143 place count 907 transition count 1212
Applied a total of 143 rules in 181 ms. Remains 907 /967 variables (removed 60) and now considering 1212/1295 (removed 83) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2023-03-11 20:30:02] [INFO ] Computed 18 place invariants in 28 ms
[2023-03-11 20:30:02] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-11 20:30:02] [INFO ] Invariant cache hit.
[2023-03-11 20:30:03] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1153 ms to find 0 implicit places.
[2023-03-11 20:30:03] [INFO ] Invariant cache hit.
[2023-03-11 20:30:03] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 907/967 places, 1212/1295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1829 ms. Remains : 907/967 places, 1212/1295 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s872 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 908 ms.
Product exploration explored 100000 steps with 50000 reset in 898 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-00 finished in 3966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 938 transition count 1266
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 938 transition count 1266
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 938 transition count 1263
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 84 place count 915 transition count 1240
Iterating global reduction 1 with 23 rules applied. Total rules applied 107 place count 915 transition count 1240
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 120 place count 915 transition count 1227
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 128 place count 907 transition count 1219
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 907 transition count 1219
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 143 place count 907 transition count 1212
Applied a total of 143 rules in 170 ms. Remains 907 /967 variables (removed 60) and now considering 1212/1295 (removed 83) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2023-03-11 20:30:06] [INFO ] Computed 18 place invariants in 23 ms
[2023-03-11 20:30:06] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-11 20:30:06] [INFO ] Invariant cache hit.
[2023-03-11 20:30:07] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
[2023-03-11 20:30:07] [INFO ] Invariant cache hit.
[2023-03-11 20:30:07] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 907/967 places, 1212/1295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1730 ms. Remains : 907/967 places, 1212/1295 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s193 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-02 finished in 1825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(p1) U G((p2&&F(p3)))))))'
Support contains 3 out of 967 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Graph (trivial) has 684 edges and 967 vertex of which 97 / 967 are part of one of the 16 SCC in 2 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 885 transition count 1131
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 163 place count 804 transition count 1131
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 163 place count 804 transition count 1094
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 237 place count 767 transition count 1094
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 293 place count 711 transition count 1038
Iterating global reduction 2 with 56 rules applied. Total rules applied 349 place count 711 transition count 1038
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 352 place count 711 transition count 1035
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 366 place count 697 transition count 1021
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 697 transition count 1021
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 391 place count 697 transition count 1010
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 587 place count 599 transition count 912
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 594 place count 592 transition count 905
Iterating global reduction 4 with 7 rules applied. Total rules applied 601 place count 592 transition count 905
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 608 place count 592 transition count 898
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 610 place count 590 transition count 896
Applied a total of 610 rules in 246 ms. Remains 590 /967 variables (removed 377) and now considering 896/1295 (removed 399) transitions.
[2023-03-11 20:30:07] [INFO ] Flow matrix only has 850 transitions (discarded 46 similar events)
// Phase 1: matrix 850 rows 590 cols
[2023-03-11 20:30:07] [INFO ] Computed 18 place invariants in 12 ms
[2023-03-11 20:30:08] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-11 20:30:08] [INFO ] Flow matrix only has 850 transitions (discarded 46 similar events)
[2023-03-11 20:30:08] [INFO ] Invariant cache hit.
[2023-03-11 20:30:08] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
[2023-03-11 20:30:08] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-11 20:30:08] [INFO ] Flow matrix only has 850 transitions (discarded 46 similar events)
[2023-03-11 20:30:08] [INFO ] Invariant cache hit.
[2023-03-11 20:30:09] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 590/967 places, 896/1295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1537 ms. Remains : 590/967 places, 896/1295 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s225 1), p2:(EQ s44 1), p3:(NEQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-03 finished in 1671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Graph (trivial) has 916 edges and 967 vertex of which 97 / 967 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 885 transition count 1127
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 800 transition count 1127
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 171 place count 800 transition count 1088
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 249 place count 761 transition count 1088
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 307 place count 703 transition count 1030
Iterating global reduction 2 with 58 rules applied. Total rules applied 365 place count 703 transition count 1030
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 368 place count 703 transition count 1027
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 368 place count 703 transition count 1026
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 370 place count 702 transition count 1026
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 384 place count 688 transition count 1012
Iterating global reduction 3 with 14 rules applied. Total rules applied 398 place count 688 transition count 1012
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 412 place count 688 transition count 998
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 608 place count 590 transition count 900
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 614 place count 584 transition count 894
Iterating global reduction 4 with 6 rules applied. Total rules applied 620 place count 584 transition count 894
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 626 place count 584 transition count 888
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 642 place count 584 transition count 872
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 644 place count 582 transition count 870
Applied a total of 644 rules in 414 ms. Remains 582 /967 variables (removed 385) and now considering 870/1295 (removed 425) transitions.
[2023-03-11 20:30:09] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
// Phase 1: matrix 839 rows 582 cols
[2023-03-11 20:30:09] [INFO ] Computed 18 place invariants in 11 ms
[2023-03-11 20:30:10] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-11 20:30:10] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:30:10] [INFO ] Invariant cache hit.
[2023-03-11 20:30:10] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2023-03-11 20:30:10] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-11 20:30:10] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:30:10] [INFO ] Invariant cache hit.
[2023-03-11 20:30:11] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/967 places, 870/1295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1653 ms. Remains : 582/967 places, 870/1295 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s495 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-04 finished in 1705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||G((F(p0) U p2)))))'
Support contains 3 out of 967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Graph (trivial) has 688 edges and 967 vertex of which 97 / 967 are part of one of the 16 SCC in 0 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 885 transition count 1128
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 169 place count 801 transition count 1128
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 169 place count 801 transition count 1088
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 249 place count 761 transition count 1088
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 306 place count 704 transition count 1031
Iterating global reduction 2 with 57 rules applied. Total rules applied 363 place count 704 transition count 1031
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 366 place count 704 transition count 1028
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 379 place count 691 transition count 1015
Iterating global reduction 3 with 13 rules applied. Total rules applied 392 place count 691 transition count 1015
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 405 place count 691 transition count 1002
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 601 place count 593 transition count 904
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 607 place count 587 transition count 898
Iterating global reduction 4 with 6 rules applied. Total rules applied 613 place count 587 transition count 898
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 619 place count 587 transition count 892
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 621 place count 585 transition count 890
Applied a total of 621 rules in 220 ms. Remains 585 /967 variables (removed 382) and now considering 890/1295 (removed 405) transitions.
[2023-03-11 20:30:11] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
// Phase 1: matrix 844 rows 585 cols
[2023-03-11 20:30:11] [INFO ] Computed 18 place invariants in 21 ms
[2023-03-11 20:30:11] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-11 20:30:11] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2023-03-11 20:30:11] [INFO ] Invariant cache hit.
[2023-03-11 20:30:12] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2023-03-11 20:30:12] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-11 20:30:12] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2023-03-11 20:30:12] [INFO ] Invariant cache hit.
[2023-03-11 20:30:12] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/967 places, 890/1295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1662 ms. Remains : 585/967 places, 890/1295 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s582 1), p2:(NEQ s34 1), p0:(EQ s569 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5474 reset in 916 ms.
Product exploration explored 100000 steps with 5447 reset in 922 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 441 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 438 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 20:30:15] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2023-03-11 20:30:15] [INFO ] Invariant cache hit.
[2023-03-11 20:30:15] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-11 20:30:15] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 20:30:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-11 20:30:16] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 20:30:16] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-11 20:30:16] [INFO ] After 733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 890/890 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 585 transition count 858
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 48 place count 569 transition count 842
Iterating global reduction 1 with 16 rules applied. Total rules applied 64 place count 569 transition count 842
Free-agglomeration rule applied 259 times.
Iterating global reduction 1 with 259 rules applied. Total rules applied 323 place count 569 transition count 583
Reduce places removed 260 places and 0 transitions.
Graph (trivial) has 80 edges and 309 vertex of which 32 / 309 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 1 with 261 rules applied. Total rules applied 584 place count 293 transition count 583
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 616 place count 293 transition count 551
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 616 place count 293 transition count 535
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 648 place count 277 transition count 535
Discarding 104 places :
Symmetric choice reduction at 3 with 104 rule applications. Total rules 752 place count 173 transition count 431
Iterating global reduction 3 with 104 rules applied. Total rules applied 856 place count 173 transition count 431
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 3 with 104 rules applied. Total rules applied 960 place count 173 transition count 327
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 992 place count 157 transition count 311
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 1010 place count 157 transition count 293
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1026 place count 157 transition count 277
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Iterating post reduction 4 with 165 rules applied. Total rules applied 1191 place count 126 transition count 143
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 5 with 208 rules applied. Total rules applied 1399 place count 22 transition count 39
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1413 place count 8 transition count 25
Iterating global reduction 6 with 14 rules applied. Total rules applied 1427 place count 8 transition count 25
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1441 place count 8 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1442 place count 8 transition count 10
Applied a total of 1442 rules in 79 ms. Remains 8 /585 variables (removed 577) and now considering 10/890 (removed 880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 8/585 places, 10/890 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2 (NOT p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 705 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 890/890 transitions.
Applied a total of 0 rules in 26 ms. Remains 585 /585 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2023-03-11 20:30:17] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2023-03-11 20:30:17] [INFO ] Invariant cache hit.
[2023-03-11 20:30:18] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-11 20:30:18] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2023-03-11 20:30:18] [INFO ] Invariant cache hit.
[2023-03-11 20:30:18] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
[2023-03-11 20:30:18] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-11 20:30:18] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2023-03-11 20:30:18] [INFO ] Invariant cache hit.
[2023-03-11 20:30:19] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1528 ms. Remains : 585/585 places, 890/890 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 627 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 439 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 20:30:20] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2023-03-11 20:30:20] [INFO ] Invariant cache hit.
[2023-03-11 20:30:20] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-11 20:30:20] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 20:30:20] [INFO ] [Nat]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-11 20:30:20] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 20:30:20] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-11 20:30:21] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 890/890 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 585 transition count 858
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 48 place count 569 transition count 842
Iterating global reduction 1 with 16 rules applied. Total rules applied 64 place count 569 transition count 842
Free-agglomeration rule applied 259 times.
Iterating global reduction 1 with 259 rules applied. Total rules applied 323 place count 569 transition count 583
Reduce places removed 260 places and 0 transitions.
Graph (trivial) has 80 edges and 309 vertex of which 32 / 309 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 1 with 261 rules applied. Total rules applied 584 place count 293 transition count 583
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 616 place count 293 transition count 551
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 616 place count 293 transition count 535
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 648 place count 277 transition count 535
Discarding 104 places :
Symmetric choice reduction at 3 with 104 rule applications. Total rules 752 place count 173 transition count 431
Iterating global reduction 3 with 104 rules applied. Total rules applied 856 place count 173 transition count 431
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 3 with 104 rules applied. Total rules applied 960 place count 173 transition count 327
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 992 place count 157 transition count 311
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 1010 place count 157 transition count 293
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 1026 place count 157 transition count 277
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Iterating post reduction 4 with 165 rules applied. Total rules applied 1191 place count 126 transition count 143
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 5 with 208 rules applied. Total rules applied 1399 place count 22 transition count 39
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1413 place count 8 transition count 25
Iterating global reduction 6 with 14 rules applied. Total rules applied 1427 place count 8 transition count 25
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1441 place count 8 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1442 place count 8 transition count 10
Applied a total of 1442 rules in 74 ms. Remains 8 /585 variables (removed 577) and now considering 10/890 (removed 880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 8/585 places, 10/890 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F p1), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 633 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5470 reset in 734 ms.
Product exploration explored 100000 steps with 5460 reset in 729 ms.
Support contains 3 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 890/890 transitions.
Applied a total of 0 rules in 27 ms. Remains 585 /585 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2023-03-11 20:30:23] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2023-03-11 20:30:23] [INFO ] Invariant cache hit.
[2023-03-11 20:30:23] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-11 20:30:23] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2023-03-11 20:30:23] [INFO ] Invariant cache hit.
[2023-03-11 20:30:24] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2023-03-11 20:30:24] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-11 20:30:24] [INFO ] Flow matrix only has 844 transitions (discarded 46 similar events)
[2023-03-11 20:30:24] [INFO ] Invariant cache hit.
[2023-03-11 20:30:24] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1241 ms. Remains : 585/585 places, 890/890 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-05 finished in 13897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((X(p1)||F(p2)||G(p3)))))'
Support contains 3 out of 967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 939 transition count 1267
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 939 transition count 1267
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 939 transition count 1264
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 916 transition count 1241
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 916 transition count 1241
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 119 place count 916 transition count 1227
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 126 place count 909 transition count 1220
Iterating global reduction 2 with 7 rules applied. Total rules applied 133 place count 909 transition count 1220
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 140 place count 909 transition count 1213
Applied a total of 140 rules in 206 ms. Remains 909 /967 variables (removed 58) and now considering 1213/1295 (removed 82) transitions.
// Phase 1: matrix 1213 rows 909 cols
[2023-03-11 20:30:25] [INFO ] Computed 18 place invariants in 12 ms
[2023-03-11 20:30:25] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-11 20:30:25] [INFO ] Invariant cache hit.
[2023-03-11 20:30:26] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2023-03-11 20:30:26] [INFO ] Invariant cache hit.
[2023-03-11 20:30:26] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 909/967 places, 1213/1295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1794 ms. Remains : 909/967 places, 1213/1295 transitions.
Stuttering acceptance computed with spot in 571 ms :[(AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 9}, { cond=(AND p0 (NOT p2) p3 (NOT p1)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=10 dest: 10}]], initial=2, aps=[p2:(EQ s140 0), p1:(EQ s899 0), p0:(EQ s463 0), p3:(EQ s463 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 812 ms.
Product exploration explored 100000 steps with 50000 reset in 797 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p2 p1 p0 (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p0 (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p2) p3)))
Knowledge based reduction with 16 factoid took 359 ms. Reduced automaton from 11 states, 26 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-16b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-07 finished in 4366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&(p1||X(p1)))) U (p2&&G((F(p0)&&(p1||X(p1))))))))'
Support contains 3 out of 967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 940 transition count 1268
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 940 transition count 1268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 940 transition count 1265
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 78 place count 919 transition count 1244
Iterating global reduction 1 with 21 rules applied. Total rules applied 99 place count 919 transition count 1244
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 111 place count 919 transition count 1232
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 119 place count 911 transition count 1224
Iterating global reduction 2 with 8 rules applied. Total rules applied 127 place count 911 transition count 1224
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 134 place count 911 transition count 1217
Applied a total of 134 rules in 183 ms. Remains 911 /967 variables (removed 56) and now considering 1217/1295 (removed 78) transitions.
// Phase 1: matrix 1217 rows 911 cols
[2023-03-11 20:30:29] [INFO ] Computed 18 place invariants in 14 ms
[2023-03-11 20:30:30] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-11 20:30:30] [INFO ] Invariant cache hit.
[2023-03-11 20:30:30] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2023-03-11 20:30:30] [INFO ] Invariant cache hit.
[2023-03-11 20:30:31] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 911/967 places, 1217/1295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1887 ms. Remains : 911/967 places, 1217/1295 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}, { cond=p2, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s859 1), p0:(EQ s677 1), p1:(NEQ s110 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-08 finished in 2143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&F(p1)))||G(p2)))'
Support contains 4 out of 967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Graph (trivial) has 685 edges and 967 vertex of which 91 / 967 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 890 transition count 1133
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 169 place count 806 transition count 1133
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 169 place count 806 transition count 1092
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 251 place count 765 transition count 1092
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 306 place count 710 transition count 1037
Iterating global reduction 2 with 55 rules applied. Total rules applied 361 place count 710 transition count 1037
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 364 place count 710 transition count 1034
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 378 place count 696 transition count 1020
Iterating global reduction 3 with 14 rules applied. Total rules applied 392 place count 696 transition count 1020
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 406 place count 696 transition count 1006
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 608 place count 595 transition count 905
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 613 place count 590 transition count 900
Iterating global reduction 4 with 5 rules applied. Total rules applied 618 place count 590 transition count 900
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 623 place count 590 transition count 895
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 625 place count 589 transition count 895
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 627 place count 587 transition count 893
Applied a total of 627 rules in 203 ms. Remains 587 /967 variables (removed 380) and now considering 893/1295 (removed 402) transitions.
[2023-03-11 20:30:31] [INFO ] Flow matrix only has 849 transitions (discarded 44 similar events)
// Phase 1: matrix 849 rows 587 cols
[2023-03-11 20:30:31] [INFO ] Computed 18 place invariants in 21 ms
[2023-03-11 20:30:32] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-11 20:30:32] [INFO ] Flow matrix only has 849 transitions (discarded 44 similar events)
[2023-03-11 20:30:32] [INFO ] Invariant cache hit.
[2023-03-11 20:30:32] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
[2023-03-11 20:30:32] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-11 20:30:32] [INFO ] Flow matrix only has 849 transitions (discarded 44 similar events)
[2023-03-11 20:30:32] [INFO ] Invariant cache hit.
[2023-03-11 20:30:32] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/967 places, 893/1295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1409 ms. Remains : 587/967 places, 893/1295 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-09 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}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(EQ s313 1), p0:(OR (EQ s49 1) (EQ s584 1)), p2:(EQ s74 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-09 finished in 1610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 938 transition count 1266
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 938 transition count 1266
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 938 transition count 1263
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 84 place count 915 transition count 1240
Iterating global reduction 1 with 23 rules applied. Total rules applied 107 place count 915 transition count 1240
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 120 place count 915 transition count 1227
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 128 place count 907 transition count 1219
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 907 transition count 1219
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 143 place count 907 transition count 1212
Applied a total of 143 rules in 164 ms. Remains 907 /967 variables (removed 60) and now considering 1212/1295 (removed 83) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2023-03-11 20:30:33] [INFO ] Computed 18 place invariants in 36 ms
[2023-03-11 20:30:33] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-11 20:30:33] [INFO ] Invariant cache hit.
[2023-03-11 20:30:34] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2023-03-11 20:30:34] [INFO ] Invariant cache hit.
[2023-03-11 20:30:34] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 907/967 places, 1212/1295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1859 ms. Remains : 907/967 places, 1212/1295 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-10 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:(NEQ s828 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 888 reset in 274 ms.
Product exploration explored 100000 steps with 886 reset in 309 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 466652 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 466652 steps, saw 147466 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 20:30:39] [INFO ] Invariant cache hit.
[2023-03-11 20:30:39] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-11 20:30:39] [INFO ] After 378ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 20:30:39] [INFO ] After 456ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-11 20:30:39] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 907/907 places, 1212/1212 transitions.
Applied a total of 0 rules in 43 ms. Remains 907 /907 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2023-03-11 20:30:40] [INFO ] Invariant cache hit.
[2023-03-11 20:30:40] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-11 20:30:40] [INFO ] Invariant cache hit.
[2023-03-11 20:30:41] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2023-03-11 20:30:41] [INFO ] Invariant cache hit.
[2023-03-11 20:30:41] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1713 ms. Remains : 907/907 places, 1212/1212 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 486692 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486692 steps, saw 151960 distinct states, run finished after 3002 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 20:30:45] [INFO ] Invariant cache hit.
[2023-03-11 20:30:45] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-11 20:30:45] [INFO ] After 338ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 20:30:45] [INFO ] After 412ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 20:30:45] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 890 reset in 236 ms.
Product exploration explored 100000 steps with 886 reset in 228 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 907 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 907/907 places, 1212/1212 transitions.
Graph (trivial) has 856 edges and 907 vertex of which 97 / 907 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 826 transition count 1130
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 64 place count 826 transition count 1130
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 111 place count 826 transition count 1130
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 188 place count 749 transition count 1053
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 265 place count 749 transition count 1053
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 86 rules applied. Total rules applied 351 place count 749 transition count 1085
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 387 place count 713 transition count 1049
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 423 place count 713 transition count 1049
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 439 place count 713 transition count 1081
Deduced a syphon composed of 130 places in 0 ms
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 471 place count 713 transition count 1049
Deduced a syphon composed of 130 places in 0 ms
Applied a total of 471 rules in 298 ms. Remains 713 /907 variables (removed 194) and now considering 1049/1212 (removed 163) transitions.
[2023-03-11 20:30:47] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 20:30:47] [INFO ] Flow matrix only has 1018 transitions (discarded 31 similar events)
// Phase 1: matrix 1018 rows 713 cols
[2023-03-11 20:30:47] [INFO ] Computed 18 place invariants in 14 ms
[2023-03-11 20:30:47] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 713/907 places, 1049/1212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 847 ms. Remains : 713/907 places, 1049/1212 transitions.
Support contains 1 out of 907 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 907/907 places, 1212/1212 transitions.
Applied a total of 0 rules in 18 ms. Remains 907 /907 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2023-03-11 20:30:47] [INFO ] Computed 18 place invariants in 16 ms
[2023-03-11 20:30:48] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-11 20:30:48] [INFO ] Invariant cache hit.
[2023-03-11 20:30:48] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
[2023-03-11 20:30:48] [INFO ] Invariant cache hit.
[2023-03-11 20:30:49] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1733 ms. Remains : 907/907 places, 1212/1212 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-10 finished in 16388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 938 transition count 1266
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 938 transition count 1266
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 938 transition count 1263
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 84 place count 915 transition count 1240
Iterating global reduction 1 with 23 rules applied. Total rules applied 107 place count 915 transition count 1240
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 121 place count 915 transition count 1226
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 128 place count 908 transition count 1219
Iterating global reduction 2 with 7 rules applied. Total rules applied 135 place count 908 transition count 1219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 141 place count 908 transition count 1213
Applied a total of 141 rules in 158 ms. Remains 908 /967 variables (removed 59) and now considering 1213/1295 (removed 82) transitions.
// Phase 1: matrix 1213 rows 908 cols
[2023-03-11 20:30:49] [INFO ] Computed 18 place invariants in 18 ms
[2023-03-11 20:30:50] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-11 20:30:50] [INFO ] Invariant cache hit.
[2023-03-11 20:30:50] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2023-03-11 20:30:50] [INFO ] Invariant cache hit.
[2023-03-11 20:30:51] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 908/967 places, 1213/1295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1845 ms. Remains : 908/967 places, 1213/1295 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s510 0), p0:(EQ s102 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-11 finished in 1998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Support contains 2 out of 967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 938 transition count 1266
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 938 transition count 1266
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 938 transition count 1263
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 84 place count 915 transition count 1240
Iterating global reduction 1 with 23 rules applied. Total rules applied 107 place count 915 transition count 1240
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 121 place count 915 transition count 1226
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 129 place count 907 transition count 1218
Iterating global reduction 2 with 8 rules applied. Total rules applied 137 place count 907 transition count 1218
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 144 place count 907 transition count 1211
Applied a total of 144 rules in 151 ms. Remains 907 /967 variables (removed 60) and now considering 1211/1295 (removed 84) transitions.
// Phase 1: matrix 1211 rows 907 cols
[2023-03-11 20:30:51] [INFO ] Computed 18 place invariants in 13 ms
[2023-03-11 20:30:52] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-11 20:30:52] [INFO ] Invariant cache hit.
[2023-03-11 20:30:52] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
[2023-03-11 20:30:52] [INFO ] Invariant cache hit.
[2023-03-11 20:30:53] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 907/967 places, 1211/1295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1779 ms. Remains : 907/967 places, 1211/1295 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s856 1), p1:(EQ s176 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-12 finished in 1932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||(p1 U G(p2))))))'
Support contains 3 out of 967 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Graph (trivial) has 912 edges and 967 vertex of which 97 / 967 are part of one of the 16 SCC in 0 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 885 transition count 1129
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 802 transition count 1129
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 167 place count 802 transition count 1091
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 243 place count 764 transition count 1091
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 300 place count 707 transition count 1034
Iterating global reduction 2 with 57 rules applied. Total rules applied 357 place count 707 transition count 1034
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 360 place count 707 transition count 1031
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 360 place count 707 transition count 1030
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 362 place count 706 transition count 1030
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 376 place count 692 transition count 1016
Iterating global reduction 3 with 14 rules applied. Total rules applied 390 place count 692 transition count 1016
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 403 place count 692 transition count 1003
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 597 place count 595 transition count 906
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 603 place count 589 transition count 900
Iterating global reduction 4 with 6 rules applied. Total rules applied 609 place count 589 transition count 900
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 615 place count 589 transition count 894
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 631 place count 589 transition count 878
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 632 place count 589 transition count 878
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 634 place count 587 transition count 876
Applied a total of 634 rules in 300 ms. Remains 587 /967 variables (removed 380) and now considering 876/1295 (removed 419) transitions.
[2023-03-11 20:30:53] [INFO ] Flow matrix only has 845 transitions (discarded 31 similar events)
// Phase 1: matrix 845 rows 587 cols
[2023-03-11 20:30:53] [INFO ] Computed 18 place invariants in 13 ms
[2023-03-11 20:30:54] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-11 20:30:54] [INFO ] Flow matrix only has 845 transitions (discarded 31 similar events)
[2023-03-11 20:30:54] [INFO ] Invariant cache hit.
[2023-03-11 20:30:54] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2023-03-11 20:30:54] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-11 20:30:54] [INFO ] Flow matrix only has 845 transitions (discarded 31 similar events)
[2023-03-11 20:30:54] [INFO ] Invariant cache hit.
[2023-03-11 20:30:54] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/967 places, 876/1295 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1541 ms. Remains : 587/967 places, 876/1295 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=1 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s227 1), p2:(EQ s19 1), p1:(EQ s68 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-14 finished in 1695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (!p0 U X(G(p1)))))'
Support contains 2 out of 967 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 939 transition count 1267
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 939 transition count 1267
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 939 transition count 1264
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 81 place count 917 transition count 1242
Iterating global reduction 1 with 22 rules applied. Total rules applied 103 place count 917 transition count 1242
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 116 place count 917 transition count 1229
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 123 place count 910 transition count 1222
Iterating global reduction 2 with 7 rules applied. Total rules applied 130 place count 910 transition count 1222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 136 place count 910 transition count 1216
Applied a total of 136 rules in 153 ms. Remains 910 /967 variables (removed 57) and now considering 1216/1295 (removed 79) transitions.
// Phase 1: matrix 1216 rows 910 cols
[2023-03-11 20:30:55] [INFO ] Computed 18 place invariants in 18 ms
[2023-03-11 20:30:55] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-11 20:30:55] [INFO ] Invariant cache hit.
[2023-03-11 20:30:56] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2023-03-11 20:30:56] [INFO ] Invariant cache hit.
[2023-03-11 20:30:56] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 910/967 places, 1216/1295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1715 ms. Remains : 910/967 places, 1216/1295 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(NEQ s472 1), p1:(EQ s555 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]]
Product exploration explored 100000 steps with 25059 reset in 476 ms.
Product exploration explored 100000 steps with 25045 reset in 551 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 772 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 220723 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220723 steps, saw 90093 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 20:31:02] [INFO ] Invariant cache hit.
[2023-03-11 20:31:02] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-11 20:31:03] [INFO ] After 686ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 20:31:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-11 20:31:04] [INFO ] After 610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 20:31:04] [INFO ] After 1024ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 218 ms.
[2023-03-11 20:31:04] [INFO ] After 1486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 70 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 6 properties in 6 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F p1), (F (AND p0 p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 702 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter insensitive) to 6 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
[2023-03-11 20:31:05] [INFO ] Invariant cache hit.
[2023-03-11 20:31:06] [INFO ] [Real]Absence check using 18 positive place invariants in 33 ms returned sat
[2023-03-11 20:31:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:31:08] [INFO ] [Real]Absence check using state equation in 2293 ms returned sat
[2023-03-11 20:31:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:31:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-11 20:31:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:31:10] [INFO ] [Nat]Absence check using state equation in 1397 ms returned sat
[2023-03-11 20:31:10] [INFO ] Computed and/alt/rep : 1179/1875/1179 causal constraints (skipped 36 transitions) in 81 ms.
[2023-03-11 20:31:18] [INFO ] Added : 560 causal constraints over 112 iterations in 8109 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 910 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 910/910 places, 1216/1216 transitions.
Graph (trivial) has 857 edges and 910 vertex of which 97 / 910 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 828 transition count 1057
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 752 transition count 1057
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 153 place count 752 transition count 1023
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 221 place count 718 transition count 1023
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 252 place count 687 transition count 992
Iterating global reduction 2 with 31 rules applied. Total rules applied 283 place count 687 transition count 992
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 285 place count 685 transition count 990
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 685 transition count 990
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 483 place count 587 transition count 892
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 499 place count 587 transition count 876
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 501 place count 585 transition count 874
Applied a total of 501 rules in 217 ms. Remains 585 /910 variables (removed 325) and now considering 874/1216 (removed 342) transitions.
[2023-03-11 20:31:18] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
// Phase 1: matrix 843 rows 585 cols
[2023-03-11 20:31:18] [INFO ] Computed 18 place invariants in 19 ms
[2023-03-11 20:31:19] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-11 20:31:19] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:31:19] [INFO ] Invariant cache hit.
[2023-03-11 20:31:19] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
[2023-03-11 20:31:19] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-11 20:31:19] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:31:19] [INFO ] Invariant cache hit.
[2023-03-11 20:31:20] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/910 places, 874/1216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1447 ms. Remains : 585/910 places, 874/1216 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 595 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter insensitive) to 6 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 452 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 346362 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346362 steps, saw 86197 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 20:31:24] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:31:24] [INFO ] Invariant cache hit.
[2023-03-11 20:31:24] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-11 20:31:24] [INFO ] After 303ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2023-03-11 20:31:24] [INFO ] After 466ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:3
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-11 20:31:25] [INFO ] After 728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:3
[2023-03-11 20:31:25] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-11 20:31:25] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 20:31:25] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-11 20:31:26] [INFO ] After 966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 874/874 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 585 transition count 842
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 48 place count 569 transition count 826
Iterating global reduction 1 with 16 rules applied. Total rules applied 64 place count 569 transition count 826
Free-agglomeration rule applied 484 times.
Iterating global reduction 1 with 484 rules applied. Total rules applied 548 place count 569 transition count 342
Discarding 60 places :
Also discarding 205 output transitions
Drop transitions removed 205 transitions
Remove reverse transitions (loop back) rule discarded transition t246.t1006.t888 and 60 places that fell out of Prefix Of Interest.
Drop transitions removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Graph (trivial) has 28 edges and 23 vertex of which 20 / 23 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 1 with 106 rules applied. Total rules applied 654 place count 7 transition count 33
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 684 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 684 place count 5 transition count 4
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 686 place count 4 transition count 4
Applied a total of 686 rules in 79 ms. Remains 4 /585 variables (removed 581) and now considering 4/874 (removed 870) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 4/585 places, 4/874 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 6 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F p1), (F (AND p1 p0)), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 13 factoid took 766 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter insensitive) to 6 states, 16 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
[2023-03-11 20:31:27] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2023-03-11 20:31:27] [INFO ] Invariant cache hit.
[2023-03-11 20:31:27] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2023-03-11 20:31:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 20:31:28] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2023-03-11 20:31:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 20:31:29] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-11 20:31:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 20:31:30] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2023-03-11 20:31:30] [INFO ] Computed and/alt/rep : 358/860/358 causal constraints (skipped 0 transitions) in 45 ms.
[2023-03-11 20:31:30] [INFO ] Added : 15 causal constraints over 3 iterations in 260 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-15 finished in 35411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)||G((F(p0) U p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-16b-LTLFireability-10
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 967 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 967/967 places, 1295/1295 transitions.
Graph (trivial) has 916 edges and 967 vertex of which 97 / 967 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 885 transition count 1127
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 800 transition count 1127
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 171 place count 800 transition count 1088
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 249 place count 761 transition count 1088
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 307 place count 703 transition count 1030
Iterating global reduction 2 with 58 rules applied. Total rules applied 365 place count 703 transition count 1030
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 368 place count 703 transition count 1027
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 368 place count 703 transition count 1026
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 370 place count 702 transition count 1026
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 383 place count 689 transition count 1013
Iterating global reduction 3 with 13 rules applied. Total rules applied 396 place count 689 transition count 1013
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 409 place count 689 transition count 1000
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 605 place count 591 transition count 902
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 612 place count 584 transition count 895
Iterating global reduction 4 with 7 rules applied. Total rules applied 619 place count 584 transition count 895
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 626 place count 584 transition count 888
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 642 place count 584 transition count 872
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 644 place count 582 transition count 870
Applied a total of 644 rules in 187 ms. Remains 582 /967 variables (removed 385) and now considering 870/1295 (removed 425) transitions.
[2023-03-11 20:31:31] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
// Phase 1: matrix 839 rows 582 cols
[2023-03-11 20:31:31] [INFO ] Computed 18 place invariants in 22 ms
[2023-03-11 20:31:31] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-11 20:31:31] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:31] [INFO ] Invariant cache hit.
[2023-03-11 20:31:31] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
[2023-03-11 20:31:31] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:31] [INFO ] Invariant cache hit.
[2023-03-11 20:31:32] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 582/967 places, 870/1295 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1425 ms. Remains : 582/967 places, 870/1295 transitions.
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-10 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:(NEQ s507 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4446 reset in 790 ms.
Product exploration explored 100000 steps with 4444 reset in 800 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 456 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 632581 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 632581 steps, saw 152247 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 20:31:37] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:37] [INFO ] Invariant cache hit.
[2023-03-11 20:31:37] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-11 20:31:37] [INFO ] After 242ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 20:31:37] [INFO ] After 301ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-11 20:31:37] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 870/870 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 582 transition count 838
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 48 place count 566 transition count 822
Iterating global reduction 1 with 16 rules applied. Total rules applied 64 place count 566 transition count 822
Free-agglomeration rule applied 483 times.
Iterating global reduction 1 with 483 rules applied. Total rules applied 547 place count 566 transition count 339
Reduce places removed 484 places and 0 transitions.
Drop transitions removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Graph (complete) has 148 edges and 82 vertex of which 12 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Graph (trivial) has 38 edges and 12 vertex of which 4 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 711 rules applied. Total rules applied 1258 place count 10 transition count 44
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 1290 place count 10 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1290 place count 10 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1294 place count 8 transition count 10
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1296 place count 8 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1300 place count 6 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1302 place count 6 transition count 4
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1308 place count 2 transition count 2
Applied a total of 1308 rules in 75 ms. Remains 2 /582 variables (removed 580) and now considering 2/870 (removed 868) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 2/582 places, 2/870 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 273 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 870/870 transitions.
Applied a total of 0 rules in 20 ms. Remains 582 /582 variables (removed 0) and now considering 870/870 (removed 0) transitions.
[2023-03-11 20:31:38] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:38] [INFO ] Invariant cache hit.
[2023-03-11 20:31:38] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-11 20:31:38] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:38] [INFO ] Invariant cache hit.
[2023-03-11 20:31:39] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2023-03-11 20:31:39] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:39] [INFO ] Invariant cache hit.
[2023-03-11 20:31:39] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1212 ms. Remains : 582/582 places, 870/870 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 459 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618905 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 618905 steps, saw 148291 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 20:31:42] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:42] [INFO ] Invariant cache hit.
[2023-03-11 20:31:43] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-11 20:31:43] [INFO ] After 243ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 20:31:43] [INFO ] After 289ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-11 20:31:43] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 870/870 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 582 transition count 838
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 48 place count 566 transition count 822
Iterating global reduction 1 with 16 rules applied. Total rules applied 64 place count 566 transition count 822
Free-agglomeration rule applied 483 times.
Iterating global reduction 1 with 483 rules applied. Total rules applied 547 place count 566 transition count 339
Reduce places removed 484 places and 0 transitions.
Drop transitions removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Graph (complete) has 148 edges and 82 vertex of which 12 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.0 ms
Discarding 70 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Graph (trivial) has 38 edges and 12 vertex of which 4 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 711 rules applied. Total rules applied 1258 place count 10 transition count 44
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 1290 place count 10 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1290 place count 10 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1294 place count 8 transition count 10
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1296 place count 8 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1300 place count 6 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1302 place count 6 transition count 4
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1308 place count 2 transition count 2
Applied a total of 1308 rules in 76 ms. Remains 2 /582 variables (removed 580) and now considering 2/870 (removed 868) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 2/582 places, 2/870 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4455 reset in 812 ms.
Product exploration explored 100000 steps with 4449 reset in 804 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 870/870 transitions.
Applied a total of 0 rules in 50 ms. Remains 582 /582 variables (removed 0) and now considering 870/870 (removed 0) transitions.
[2023-03-11 20:31:45] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-11 20:31:45] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:45] [INFO ] Invariant cache hit.
[2023-03-11 20:31:46] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 424 ms. Remains : 582/582 places, 870/870 transitions.
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 870/870 transitions.
Applied a total of 0 rules in 14 ms. Remains 582 /582 variables (removed 0) and now considering 870/870 (removed 0) transitions.
[2023-03-11 20:31:46] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:46] [INFO ] Invariant cache hit.
[2023-03-11 20:31:46] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-11 20:31:46] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:46] [INFO ] Invariant cache hit.
[2023-03-11 20:31:47] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2023-03-11 20:31:47] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2023-03-11 20:31:47] [INFO ] Invariant cache hit.
[2023-03-11 20:31:47] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1204 ms. Remains : 582/582 places, 870/870 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-10 finished in 16737 ms.
[2023-03-11 20:31:47] [INFO ] Flatten gal took : 59 ms
[2023-03-11 20:31:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 20:31:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 967 places, 1295 transitions and 3827 arcs took 14 ms.
Total runtime 118083 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1934/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1934/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FlexibleBarrier-PT-16b-LTLFireability-05
Could not compute solution for formula : FlexibleBarrier-PT-16b-LTLFireability-10

BK_STOP 1678566709726

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FlexibleBarrier-PT-16b-LTLFireability-05
ltl formula formula --ltl=/tmp/1934/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 967 places, 1295 transitions and 3827 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1934/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1934/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1934/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.050 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1934/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name FlexibleBarrier-PT-16b-LTLFireability-10
ltl formula formula --ltl=/tmp/1934/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 967 places, 1295 transitions and 3827 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1934/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1934/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1934/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.050 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1934/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5558b5c303f4]
1: pnml2lts-mc(+0xa2496) [0x5558b5c30496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f9eb9999140]
3: pnml2lts-mc(+0x405be5) [0x5558b5f93be5]
4: pnml2lts-mc(+0x16b3f9) [0x5558b5cf93f9]
5: pnml2lts-mc(+0x164ac4) [0x5558b5cf2ac4]
6: pnml2lts-mc(+0x272e0a) [0x5558b5e00e0a]
7: pnml2lts-mc(+0xb61f0) [0x5558b5c441f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f9eb97ec4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f9eb97ec67a]
10: pnml2lts-mc(+0xa1581) [0x5558b5c2f581]
11: pnml2lts-mc(+0xa1910) [0x5558b5c2f910]
12: pnml2lts-mc(+0xa32a2) [0x5558b5c312a2]
13: pnml2lts-mc(+0xa50f4) [0x5558b5c330f4]
14: pnml2lts-mc(+0xa516b) [0x5558b5c3316b]
15: pnml2lts-mc(+0x3f34b3) [0x5558b5f814b3]
16: pnml2lts-mc(+0x7c63d) [0x5558b5c0a63d]
17: pnml2lts-mc(+0x67d86) [0x5558b5bf5d86]
18: pnml2lts-mc(+0x60a8a) [0x5558b5beea8a]
19: pnml2lts-mc(+0x5eb15) [0x5558b5becb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f9eb97d4d0a]
21: pnml2lts-mc(+0x6075e) [0x5558b5bee75e]

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-16b, 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 r169-tall-167838856000548"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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