Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 08:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 08:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 08:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Apr 13 08:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 23K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717181786094

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-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:56:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:56:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:56:27] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-31 18:56:27] [INFO ] Transformed 51 places.
[2024-05-31 18:56:27] [INFO ] Transformed 88 transitions.
[2024-05-31 18:56:27] [INFO ] Found NUPN structural information;
[2024-05-31 18:56:27] [INFO ] Parsed PT model containing 51 places and 88 transitions and 309 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 20 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2024-05-31 18:56:27] [INFO ] Computed 6 invariants in 9 ms
[2024-05-31 18:56:27] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-31 18:56:28] [INFO ] Invariant cache hit.
[2024-05-31 18:56:28] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 18:56:28] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-31 18:56:28] [INFO ] Invariant cache hit.
[2024-05-31 18:56:28] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 33/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 141 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1157 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 33/141 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 214 constraints, problems are : Problem set: 0 solved, 73 unsolved in 900 ms.
Refiners :[Domain max(s): 51/51 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2101ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2115ms
Starting structural reductions in LTL mode, iteration 1 : 51/51 places, 74/78 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2533 ms. Remains : 51/51 places, 74/78 transitions.
Support contains 22 out of 51 places after structural reductions.
[2024-05-31 18:56:30] [INFO ] Flatten gal took : 23 ms
[2024-05-31 18:56:30] [INFO ] Flatten gal took : 9 ms
[2024-05-31 18:56:30] [INFO ] Input system was already deterministic with 74 transitions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (8 resets) in 680 ms. (58 steps per ms) remains 1/22 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
[2024-05-31 18:56:30] [INFO ] Invariant cache hit.
[2024-05-31 18:56:30] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 14/125 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Domain max(s): 3/51 constraints, Positive P Invariants (semi-flows): 2/6 constraints, State Equation: 0/51 constraints, ReadFeed: 0/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 26ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 38 edges and 51 vertex of which 9 / 51 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 56 edges and 42 vertex of which 35 / 42 are part of one of the 5 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 12 transition count 62
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 60 place count 7 transition count 13
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 6 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 6 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 6 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 4 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 3 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 72 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 73 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 74 place count 2 transition count 3
Applied a total of 74 rules in 19 ms. Remains 2 /51 variables (removed 49) and now considering 3/74 (removed 71) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 18:56:31] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 18:56:31] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-31 18:56:31] [INFO ] Invariant cache hit.
[2024-05-31 18:56:31] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-31 18:56:31] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-31 18:56:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 41ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/51 places, 3/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 2/51 places, 3/74 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-00 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 36 edges and 51 vertex of which 12 / 51 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 33 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 33 transition count 47
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 33 transition count 47
Applied a total of 28 rules in 12 ms. Remains 33 /51 variables (removed 18) and now considering 47/74 (removed 27) transitions.
[2024-05-31 18:56:31] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 33 cols
[2024-05-31 18:56:31] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 18:56:31] [INFO ] Implicit Places using invariants in 46 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/51 places, 47/74 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 32 transition count 43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 28 transition count 43
Applied a total of 8 rules in 4 ms. Remains 28 /32 variables (removed 4) and now considering 43/47 (removed 4) transitions.
[2024-05-31 18:56:31] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
// Phase 1: matrix 37 rows 28 cols
[2024-05-31 18:56:31] [INFO ] Computed 5 invariants in 0 ms
[2024-05-31 18:56:31] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 18:56:31] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
[2024-05-31 18:56:31] [INFO ] Invariant cache hit.
[2024-05-31 18:56:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 18:56:31] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/51 places, 43/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 28/51 places, 43/74 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-01 finished in 285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2024-05-31 18:56:31] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 18:56:31] [INFO ] Implicit Places using invariants in 45 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-04a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-02 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0)) U (p0 U p1)))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-31 18:56:32] [INFO ] Invariant cache hit.
[2024-05-31 18:56:32] [INFO ] Implicit Places using invariants in 57 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-03 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))&&F(p1)) U G(p2)))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 34 edges and 51 vertex of which 9 / 51 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 36 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 27 place count 36 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 36 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 29 place count 35 transition count 49
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 35 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 34 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 34 transition count 48
Applied a total of 33 rules in 17 ms. Remains 34 /51 variables (removed 17) and now considering 48/74 (removed 26) transitions.
[2024-05-31 18:56:32] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 34 cols
[2024-05-31 18:56:32] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 18:56:32] [INFO ] Implicit Places using invariants in 34 ms returned [32, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/51 places, 48/74 transitions.
Graph (trivial) has 38 edges and 32 vertex of which 17 / 32 are part of one of the 3 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 17 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 17 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 16 transition count 24
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 14 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 14 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 13 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 13 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 12 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 16 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 11 transition count 16
Applied a total of 17 rules in 4 ms. Remains 11 /32 variables (removed 21) and now considering 16/48 (removed 32) transitions.
[2024-05-31 18:56:32] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 11 cols
[2024-05-31 18:56:32] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 18:56:32] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 18:56:32] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
[2024-05-31 18:56:32] [INFO ] Invariant cache hit.
[2024-05-31 18:56:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 18:56:32] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/51 places, 16/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 11/51 places, 16/74 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-04
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-04 finished in 289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(!p1)))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 8 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2024-05-31 18:56:32] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 18:56:32] [INFO ] Implicit Places using invariants in 44 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-05
Product exploration explored 100000 steps with 24803 reset in 155 ms.
Product exploration explored 100000 steps with 24876 reset in 202 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 76 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 408 steps (0 resets) in 15 ms. (25 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0))), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 133 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2024-05-31 18:56:34] [INFO ] Computed 5 invariants in 0 ms
[2024-05-31 18:56:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-31 18:56:34] [INFO ] Invariant cache hit.
[2024-05-31 18:56:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 18:56:34] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-31 18:56:34] [INFO ] Invariant cache hit.
[2024-05-31 18:56:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/124 variables, 50/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 125 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1013 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/124 variables, 50/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 73/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 198 constraints, problems are : Problem set: 0 solved, 73 unsolved in 878 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1906ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1907ms
Finished structural reductions in LTL mode , in 1 iterations and 2007 ms. Remains : 50/50 places, 74/74 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 375 steps (0 resets) in 7 ms. (46 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0))), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 206 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 24787 reset in 95 ms.
Product exploration explored 100000 steps with 24855 reset in 155 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 74/74 transitions.
Graph (trivial) has 41 edges and 50 vertex of which 9 / 50 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 44 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 44 transition count 71
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 17 place count 44 transition count 79
Deduced a syphon composed of 16 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 23 place count 44 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 23 place count 44 transition count 75
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 44 transition count 75
Deduced a syphon composed of 17 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 44 transition count 73
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 26 rules in 17 ms. Remains 44 /50 variables (removed 6) and now considering 73/74 (removed 1) transitions.
[2024-05-31 18:56:37] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-31 18:56:37] [INFO ] Flow matrix only has 66 transitions (discarded 7 similar events)
// Phase 1: matrix 66 rows 44 cols
[2024-05-31 18:56:37] [INFO ] Computed 5 invariants in 1 ms
[2024-05-31 18:56:37] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 18:56:38] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 4 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-31 18:56:38] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-31 18:56:38] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-31 18:56:38] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 4/53 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/53 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 65/109 variables, 44/97 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 29/126 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/126 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 1/110 variables, 1/127 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/127 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/110 variables, 0/127 constraints. Problems are: Problem set: 31 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 127 constraints, problems are : Problem set: 31 solved, 41 unsolved in 975 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 31 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 18/44 variables, 5/31 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 18/49 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 4/53 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/53 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 65/109 variables, 44/97 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 29/126 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 41/167 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/167 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 1/110 variables, 1/168 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 0/168 constraints. Problems are: Problem set: 31 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/110 variables, 0/168 constraints. Problems are: Problem set: 31 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 168 constraints, problems are : Problem set: 31 solved, 41 unsolved in 567 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 44/44 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 41/72 constraints, Known Traps: 4/4 constraints]
After SMT, in 1556ms problems are : Problem set: 31 solved, 41 unsolved
Search for dead transitions found 31 dead transitions in 1558ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 44/50 places, 42/74 transitions.
Graph (complete) has 87 edges and 44 vertex of which 27 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 27 /44 variables (removed 17) and now considering 42/42 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/50 places, 42/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1593 ms. Remains : 27/50 places, 42/74 transitions.
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2024-05-31 18:56:39] [INFO ] Computed 5 invariants in 0 ms
[2024-05-31 18:56:39] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 18:56:39] [INFO ] Invariant cache hit.
[2024-05-31 18:56:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 18:56:39] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-31 18:56:39] [INFO ] Invariant cache hit.
[2024-05-31 18:56:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/124 variables, 50/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 125 constraints, problems are : Problem set: 0 solved, 73 unsolved in 866 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/124 variables, 50/105 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 73/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 198 constraints, problems are : Problem set: 0 solved, 73 unsolved in 784 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 50/50 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 1661ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 1662ms
Finished structural reductions in LTL mode , in 1 iterations and 1779 ms. Remains : 50/50 places, 74/74 transitions.
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-05 finished in 8564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 35 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 35 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 35 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 32 place count 35 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 34 transition count 49
Applied a total of 34 rules in 6 ms. Remains 34 /51 variables (removed 17) and now considering 49/74 (removed 25) transitions.
[2024-05-31 18:56:41] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 34 cols
[2024-05-31 18:56:41] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 18:56:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-31 18:56:41] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
[2024-05-31 18:56:41] [INFO ] Invariant cache hit.
[2024-05-31 18:56:41] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-31 18:56:41] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-31 18:56:41] [INFO ] Redundant transitions in 13 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 47 sub problems to find dead transitions.
[2024-05-31 18:56:41] [INFO ] Flow matrix only has 43 transitions (discarded 5 similar events)
// Phase 1: matrix 43 rows 34 cols
[2024-05-31 18:56:41] [INFO ] Computed 6 invariants in 8 ms
[2024-05-31 18:56:41] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 42/76 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 28/102 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/77 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/77 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 103 constraints, problems are : Problem set: 0 solved, 47 unsolved in 679 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 42/76 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 28/102 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 47/149 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/77 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 150 constraints, problems are : Problem set: 0 solved, 47 unsolved in 547 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 1246ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1250ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/51 places, 48/74 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 33 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 33 transition count 47
Applied a total of 3 rules in 7 ms. Remains 33 /34 variables (removed 1) and now considering 47/48 (removed 1) transitions.
[2024-05-31 18:56:42] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
// Phase 1: matrix 42 rows 33 cols
[2024-05-31 18:56:42] [INFO ] Computed 6 invariants in 3 ms
[2024-05-31 18:56:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-31 18:56:42] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
[2024-05-31 18:56:42] [INFO ] Invariant cache hit.
[2024-05-31 18:56:42] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-31 18:56:42] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/51 places, 47/74 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1461 ms. Remains : 33/51 places, 47/74 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-06 finished in 1615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F(p1)))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2024-05-31 18:56:42] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 18:56:42] [INFO ] Implicit Places using invariants in 43 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-11
Product exploration explored 100000 steps with 395 reset in 191 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-11 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p1)||p0))))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-31 18:56:43] [INFO ] Invariant cache hit.
[2024-05-31 18:56:43] [INFO ] Implicit Places using invariants in 44 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-12
Product exploration explored 100000 steps with 22563 reset in 165 ms.
Stack based approach found an accepted trace after 5629 steps with 1271 reset with depth 10 and stack size 10 in 13 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-12 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-31 18:56:43] [INFO ] Invariant cache hit.
[2024-05-31 18:56:43] [INFO ] Implicit Places using invariants in 46 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-13 finished in 176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||X(F(p2)))))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-31 18:56:43] [INFO ] Invariant cache hit.
[2024-05-31 18:56:43] [INFO ] Implicit Places using invariants in 48 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-14
Product exploration explored 100000 steps with 990 reset in 92 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-14 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(!p1)))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-04a-LTLFireability-05
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 37 edges and 51 vertex of which 9 / 51 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 33 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 31 place count 33 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 31 place count 33 transition count 48
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 32 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 32 transition count 46
Applied a total of 35 rules in 7 ms. Remains 32 /51 variables (removed 19) and now considering 46/74 (removed 28) transitions.
[2024-05-31 18:56:44] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
// Phase 1: matrix 40 rows 32 cols
[2024-05-31 18:56:44] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 18:56:44] [INFO ] Implicit Places using invariants in 30 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 31/51 places, 46/74 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 31 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 42
Applied a total of 8 rules in 2 ms. Remains 27 /31 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2024-05-31 18:56:44] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 27 cols
[2024-05-31 18:56:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-31 18:56:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 18:56:44] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
[2024-05-31 18:56:44] [INFO ] Invariant cache hit.
[2024-05-31 18:56:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 18:56:44] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 27/51 places, 42/74 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 126 ms. Remains : 27/51 places, 42/74 transitions.
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-05
Stuttering criterion allowed to conclude after 1685 steps with 388 reset in 9 ms.
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-05 finished in 406 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-31 18:56:44] [INFO ] Flatten gal took : 4 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 17307 ms.
ITS solved all properties within timeout

BK_STOP 1717181804697

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-04a"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-04a, 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 r496-tall-171640602400004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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