Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102500420.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FlexibleBarrier-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102500420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 41K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748918875947

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 02:47:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 02:47:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:47:58] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2025-06-03 02:47:59] [INFO ] Transformed 75 places.
[2025-06-03 02:47:59] [INFO ] Transformed 154 transitions.
[2025-06-03 02:47:59] [INFO ] Found NUPN structural information;
[2025-06-03 02:47:59] [INFO ] Parsed PT model containing 75 places and 154 transitions and 599 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 128/128 transitions.
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 6 place count 75 transition count 122
Applied a total of 6 rules in 54 ms. Remains 75 /75 variables (removed 0) and now considering 122/128 (removed 6) transitions.
// Phase 1: matrix 122 rows 75 cols
[2025-06-03 02:47:59] [INFO ] Computed 8 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:47:59] [INFO ] Implicit Places using invariants in 439 ms returned []
[2025-06-03 02:47:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-03 02:48:00] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 02:48:00] [INFO ] Invariant cache hit.
[2025-06-03 02:48:00] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/197 variables, 75/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 61/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 219 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8365 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/197 variables, 75/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 61/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 121/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 340 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7627 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16162ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 16190ms
Starting structural reductions in LTL mode, iteration 1 : 75/75 places, 122/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17093 ms. Remains : 75/75 places, 122/128 transitions.
Support contains 25 out of 75 places after structural reductions.
[2025-06-03 02:48:16] [INFO ] Flatten gal took : 59 ms
[2025-06-03 02:48:16] [INFO ] Flatten gal took : 27 ms
[2025-06-03 02:48:17] [INFO ] Input system was already deterministic with 122 transitions.
Reduction of identical properties reduced properties to check from 30 to 27
RANDOM walk for 1683 steps (0 resets) in 163 ms. (10 steps per ms) remains 0/27 properties
FORMULA FlexibleBarrier-PT-06a-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-06-03 02:48:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:18] [INFO ] Implicit Places using invariants in 94 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 463 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-01 finished in 789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((p1||F(p2)) U p3)))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 53 edges and 75 vertex of which 9 / 75 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 83 edges and 66 vertex of which 45 / 66 are part of one of the 9 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 30 transition count 109
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Graph (trivial) has 28 edges and 22 vertex of which 2 / 22 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 84 place count 21 transition count 43
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 20 transition count 42
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 17 transition count 36
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 17 transition count 36
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 8 rules applied. Total rules applied 100 place count 17 transition count 28
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 106 place count 12 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 107 place count 11 transition count 27
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 6 with 4 rules applied. Total rules applied 111 place count 9 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 113 place count 9 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 124 place count 9 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 127 place count 9 transition count 9
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 130 place count 6 transition count 9
Applied a total of 130 rules in 28 ms. Remains 6 /75 variables (removed 69) and now considering 9/122 (removed 113) transitions.
// Phase 1: matrix 9 rows 6 cols
[2025-06-03 02:48:18] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:18] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 02:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:18] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:48:18] [INFO ] Redundant transitions in 25 ms returned [1, 4]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 7 rows 6 cols
[2025-06-03 02:48:18] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/75 places, 7/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 6/75 places, 7/122 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p3), (NOT p2), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-02 finished in 481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 75 cols
[2025-06-03 02:48:19] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:19] [INFO ] Implicit Places using invariants in 152 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 155 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-03
Product exploration explored 100000 steps with 645 reset in 823 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-03 finished in 1214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1)&&F(p2))))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 51 edges and 75 vertex of which 12 / 75 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
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 0 with 32 rules applied. Total rules applied 33 place count 51 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 53 place count 51 transition count 75
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 54 place count 51 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 50 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 50 transition count 74
Applied a total of 56 rules in 34 ms. Remains 50 /75 variables (removed 25) and now considering 74/122 (removed 48) transitions.
[2025-06-03 02:48:20] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
// Phase 1: matrix 67 rows 50 cols
[2025-06-03 02:48:20] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:20] [INFO ] Implicit Places using invariants in 111 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/75 places, 74/122 transitions.
Graph (trivial) has 54 edges and 49 vertex of which 6 / 49 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 45 transition count 60
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 39 transition count 60
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 13 place count 39 transition count 54
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 25 place count 33 transition count 54
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 2 with 20 rules applied. Total rules applied 45 place count 23 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 23 transition count 36
Applied a total of 53 rules in 13 ms. Remains 23 /49 variables (removed 26) and now considering 36/74 (removed 38) transitions.
[2025-06-03 02:48:20] [INFO ] Flow matrix only has 29 transitions (discarded 7 similar events)
// Phase 1: matrix 29 rows 23 cols
[2025-06-03 02:48:20] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-03 02:48:20] [INFO ] Flow matrix only has 29 transitions (discarded 7 similar events)
[2025-06-03 02:48:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-03 02:48:20] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/75 places, 36/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 23/75 places, 36/122 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-04
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-04 finished in 500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X((!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 75 cols
[2025-06-03 02:48:20] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:20] [INFO ] Implicit Places using invariants in 139 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), (AND (NOT p2) p1), true]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 142 steps with 4 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-05 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-06-03 02:48:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:21] [INFO ] Implicit Places using invariants in 136 ms returned [73, 74]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 140 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/75 places, 122/122 transitions.
Applied a total of 0 rules in 5 ms. Remains 73 /73 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 73/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-06 finished in 310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&(F(((p2&&X(!p3))||G(!p3))) U X(!p4))))'
Support contains 8 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-06-03 02:48:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:21] [INFO ] Implicit Places using invariants in 120 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 502 ms :[(OR (NOT p1) p4), (NOT p0), (NOT p1), (AND p3 p4), p4, (AND p3 p4), p3, p3]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-07
Product exploration explored 100000 steps with 3540 reset in 371 ms.
Stack based approach found an accepted trace after 53 steps with 2 reset with depth 39 and stack size 39 in 1 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-07 finished in 1104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 53 edges and 75 vertex of which 12 / 75 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 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 33 place count 51 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 53 place count 51 transition count 75
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 51 transition count 75
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 49 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 49 transition count 73
Applied a total of 60 rules in 31 ms. Remains 49 /75 variables (removed 26) and now considering 73/122 (removed 49) transitions.
[2025-06-03 02:48:22] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
// Phase 1: matrix 65 rows 49 cols
[2025-06-03 02:48:22] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:22] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-03 02:48:22] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2025-06-03 02:48:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:22] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-06-03 02:48:22] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:48:22] [INFO ] Redundant transitions in 23 ms returned [36]
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 71 sub problems to find dead transitions.
[2025-06-03 02:48:22] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
// Phase 1: matrix 64 rows 49 cols
[2025-06-03 02:48:22] [INFO ] Computed 8 invariants in 1 ms
[2025-06-03 02:48:22] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 63/112 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 1/113 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 102 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3661 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 63/112 variables, 49/57 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 44/101 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 71/172 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 173 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3481 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7181ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 7182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/75 places, 72/122 transitions.
Applied a total of 0 rules in 8 ms. Remains 49 /49 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7461 ms. Remains : 49/75 places, 72/122 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-08 finished in 7585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((p0 U X(X(!p1))))||(F(p0)&&F(p2))))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 75 cols
[2025-06-03 02:48:30] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:30] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-03 02:48:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:30] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-03 02:48:30] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 02:48:30] [INFO ] Invariant cache hit.
[2025-06-03 02:48:30] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/197 variables, 75/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 61/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 219 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7805 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/197 variables, 75/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 61/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 121/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 340 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7508 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15350ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15355ms
Finished structural reductions in LTL mode , in 1 iterations and 15677 ms. Remains : 75/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 635 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-10
Product exploration explored 100000 steps with 22499 reset in 372 ms.
Product exploration explored 100000 steps with 22472 reset in 409 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 11 states, 16 edges and 3 AP (stutter sensitive) to 11 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 1796 steps (0 resets) in 36 ms. (48 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p1), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 7 factoid took 812 ms. Reduced automaton from 11 states, 16 edges and 3 AP (stutter sensitive) to 11 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 597 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 599 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (NOT p2)]
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-06-03 02:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:50] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-03 02:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:48:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-03 02:48:50] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 02:48:50] [INFO ] Invariant cache hit.
[2025-06-03 02:48:50] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/197 variables, 75/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 61/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 219 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7561 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/197 variables, 75/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 61/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 121/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 340 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7567 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15160ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15162ms
Finished structural reductions in LTL mode , in 1 iterations and 15489 ms. Remains : 75/75 places, 122/122 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 7 factoid took 388 ms. Reduced automaton from 11 states, 16 edges and 3 AP (stutter sensitive) to 11 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 615 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 9503 steps (2 resets) in 76 ms. (123 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p1), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 7 factoid took 835 ms. Reduced automaton from 11 states, 16 edges and 3 AP (stutter sensitive) to 11 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 607 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 606 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 597 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 22476 reset in 363 ms.
Product exploration explored 100000 steps with 22450 reset in 398 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 542 ms :[(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p0), (NOT p2)]
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 52 edges and 75 vertex of which 12 / 75 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 18 place count 67 transition count 123
Deduced a syphon composed of 17 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 38 place count 67 transition count 103
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 38 rules in 18 ms. Remains 67 /75 variables (removed 8) and now considering 103/122 (removed 19) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:49:11] [INFO ] Redundant transitions in 21 ms returned [55]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 101 sub problems to find dead transitions.
[2025-06-03 02:49:11] [INFO ] Flow matrix only has 93 transitions (discarded 9 similar events)
// Phase 1: matrix 93 rows 67 cols
[2025-06-03 02:49:11] [INFO ] Computed 8 invariants in 2 ms
[2025-06-03 02:49:11] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:49:12] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 13 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:49:12] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 4 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:49:12] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:49:12] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:49:12] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 02:49:12] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 6/81 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/81 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 92/159 variables, 67/148 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 42/190 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/190 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/160 variables, 1/191 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/191 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 0/191 constraints. Problems are: Problem set: 29 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 191 constraints, problems are : Problem set: 29 solved, 72 unsolved in 5733 ms.
Refiners :[Domain max(s): 67/67 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 49/49 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/49 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 18/67 variables, 8/57 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 18/75 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 6/81 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/81 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 92/159 variables, 67/148 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 42/190 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 72/262 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/262 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 1/160 variables, 1/263 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/263 constraints. Problems are: Problem set: 29 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/160 variables, 0/263 constraints. Problems are: Problem set: 29 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 263 constraints, problems are : Problem set: 29 solved, 72 unsolved in 6145 ms.
Refiners :[Domain max(s): 67/67 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 72/101 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11895ms problems are : Problem set: 29 solved, 72 unsolved
Search for dead transitions found 29 dead transitions in 11896ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 67/75 places, 73/122 transitions.
Graph (complete) has 160 edges and 67 vertex of which 50 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.3 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 50 /67 variables (removed 17) and now considering 73/73 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/75 places, 73/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11957 ms. Remains : 50/75 places, 73/122 transitions.
Built C files in :
/tmp/ltsmin14932403946354673245
[2025-06-03 02:49:23] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14932403946354673245
Running compilation step : cd /tmp/ltsmin14932403946354673245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 749 ms.
Running link step : cd /tmp/ltsmin14932403946354673245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin14932403946354673245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12429142702921124104.hoa' '--buchi-type=spotba'
LTSmin run took 525 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-10 finished in 54392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Graph (trivial) has 55 edges and 75 vertex of which 12 / 75 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 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 37 place count 49 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 57 place count 49 transition count 73
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 58 place count 49 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 48 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 48 transition count 72
Applied a total of 60 rules in 28 ms. Remains 48 /75 variables (removed 27) and now considering 72/122 (removed 50) transitions.
[2025-06-03 02:49:24] [INFO ] Flow matrix only has 63 transitions (discarded 9 similar events)
// Phase 1: matrix 63 rows 48 cols
[2025-06-03 02:49:24] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:49:24] [INFO ] Implicit Places using invariants in 139 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/75 places, 72/122 transitions.
Graph (trivial) has 58 edges and 47 vertex of which 12 / 47 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 39 transition count 50
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 33 transition count 50
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 13 place count 33 transition count 44
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 25 place count 27 transition count 44
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 41 place count 19 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 19 transition count 30
Applied a total of 47 rules in 8 ms. Remains 19 /47 variables (removed 28) and now considering 30/72 (removed 42) transitions.
[2025-06-03 02:49:24] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
// Phase 1: matrix 23 rows 19 cols
[2025-06-03 02:49:24] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:49:24] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-03 02:49:24] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2025-06-03 02:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:49:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-03 02:49:24] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/75 places, 30/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 283 ms. Remains : 19/75 places, 30/122 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-11
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-11 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p1)&&p0))||F(p2)))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 75 cols
[2025-06-03 02:49:24] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:49:25] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-03 02:49:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:49:25] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-06-03 02:49:25] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-03 02:49:25] [INFO ] Invariant cache hit.
[2025-06-03 02:49:25] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/197 variables, 75/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 61/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 219 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7232 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 74/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/197 variables, 75/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 61/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 121/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 340 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7411 ms.
Refiners :[Domain max(s): 75/75 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14678ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 14679ms
Finished structural reductions in LTL mode , in 1 iterations and 15001 ms. Remains : 75/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-12
Product exploration explored 100000 steps with 8091 reset in 254 ms.
Stack based approach found an accepted trace after 68 steps with 6 reset with depth 5 and stack size 5 in 1 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-12 finished in 15428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F((G(!p1)||(p2&&X(!p1)))))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-06-03 02:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:49:40] [INFO ] Implicit Places using invariants in 82 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-13
Product exploration explored 100000 steps with 30275 reset in 368 ms.
Stack based approach found an accepted trace after 1731 steps with 530 reset with depth 6 and stack size 6 in 7 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-13 finished in 821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p0))))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2025-06-03 02:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:49:41] [INFO ] Implicit Places using invariants in 136 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/75 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 74/75 places, 122/122 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06a-LTLFireability-14
Product exploration explored 100000 steps with 3954 reset in 245 ms.
Stack based approach found an accepted trace after 84 steps with 7 reset with depth 7 and stack size 7 in 0 ms.
FORMULA FlexibleBarrier-PT-06a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06a-LTLFireability-14 finished in 480 ms.
All properties solved by simple procedures.
Total runtime 103035 ms.

BK_STOP 1748918981779

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-06a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-06a, 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 r086-smll-174860102500420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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