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.r114-smll-171624275400148.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 itstools
Input is DLCround-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-171624275400148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 13 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 13:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 13 13:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 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 259K 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 DLCround-PT-05a-LTLFireability-00
FORMULA_NAME DLCround-PT-05a-LTLFireability-01
FORMULA_NAME DLCround-PT-05a-LTLFireability-02
FORMULA_NAME DLCround-PT-05a-LTLFireability-03
FORMULA_NAME DLCround-PT-05a-LTLFireability-04
FORMULA_NAME DLCround-PT-05a-LTLFireability-05
FORMULA_NAME DLCround-PT-05a-LTLFireability-06
FORMULA_NAME DLCround-PT-05a-LTLFireability-07
FORMULA_NAME DLCround-PT-05a-LTLFireability-08
FORMULA_NAME DLCround-PT-05a-LTLFireability-09
FORMULA_NAME DLCround-PT-05a-LTLFireability-10
FORMULA_NAME DLCround-PT-05a-LTLFireability-11
FORMULA_NAME DLCround-PT-05a-LTLFireability-12
FORMULA_NAME DLCround-PT-05a-LTLFireability-13
FORMULA_NAME DLCround-PT-05a-LTLFireability-14
FORMULA_NAME DLCround-PT-05a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716350072037

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 03:54:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 03:54:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:54:34] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2024-05-22 03:54:34] [INFO ] Transformed 167 places.
[2024-05-22 03:54:34] [INFO ] Transformed 1055 transitions.
[2024-05-22 03:54:34] [INFO ] Found NUPN structural information;
[2024-05-22 03:54:34] [INFO ] Parsed PT model containing 167 places and 1055 transitions and 3985 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Ensure Unique test removed 112 transitions
Reduce redundant transitions removed 112 transitions.
FORMULA DLCround-PT-05a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-05a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 943/943 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 150 transition count 788
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 150 transition count 788
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 150 transition count 784
Drop transitions (Redundant composition of simpler transitions.) removed 237 transitions
Redundant transition composition rules discarded 237 transitions
Iterating global reduction 1 with 237 rules applied. Total rules applied 275 place count 150 transition count 547
Applied a total of 275 rules in 231 ms. Remains 150 /167 variables (removed 17) and now considering 547/943 (removed 396) transitions.
[2024-05-22 03:54:34] [INFO ] Flow matrix only has 117 transitions (discarded 430 similar events)
// Phase 1: matrix 117 rows 150 cols
[2024-05-22 03:54:34] [INFO ] Computed 88 invariants in 19 ms
[2024-05-22 03:54:35] [INFO ] Implicit Places using invariants in 783 ms returned [73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 92, 94, 96, 97, 98, 99, 100, 101, 102, 103, 104, 106, 108, 110, 111, 114, 115, 117, 118, 119, 121, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 138, 139, 140, 141, 142, 144, 145, 147, 148, 149]
Discarding 62 places :
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Implicit Place search using SMT only with invariants took 832 ms to find 62 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/167 places, 251/943 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 88 transition count 151
Applied a total of 100 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 151/251 (removed 100) transitions.
[2024-05-22 03:54:35] [INFO ] Flow matrix only has 117 transitions (discarded 34 similar events)
// Phase 1: matrix 117 rows 88 cols
[2024-05-22 03:54:35] [INFO ] Computed 26 invariants in 2 ms
[2024-05-22 03:54:35] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 03:54:35] [INFO ] Flow matrix only has 117 transitions (discarded 34 similar events)
[2024-05-22 03:54:35] [INFO ] Invariant cache hit.
[2024-05-22 03:54:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:54:35] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/167 places, 151/943 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1338 ms. Remains : 88/167 places, 151/943 transitions.
Support contains 31 out of 88 places after structural reductions.
[2024-05-22 03:54:36] [INFO ] Flatten gal took : 49 ms
[2024-05-22 03:54:36] [INFO ] Flatten gal took : 17 ms
[2024-05-22 03:54:36] [INFO ] Input system was already deterministic with 151 transitions.
RANDOM walk for 1762 steps (0 resets) in 286 ms. (6 steps per ms) remains 0/22 properties
Computed a total of 17 stabilizing places and 1 stable transitions
Graph (complete) has 176 edges and 88 vertex of which 72 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 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(p0) U (!p1 U p2)))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 151/151 transitions.
Graph (trivial) has 129 edges and 88 vertex of which 55 / 88 are part of one of the 8 SCC in 4 ms
Free SCC test removed 47 places
Ensure Unique test removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Graph (complete) has 67 edges and 41 vertex of which 28 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 28 transition count 41
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 27 transition count 37
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 14 place count 23 transition count 35
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 20 place count 17 transition count 29
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 17 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 17 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 17 transition count 27
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 16 transition count 26
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 16 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 16 transition count 25
Applied a total of 32 rules in 37 ms. Remains 16 /88 variables (removed 72) and now considering 25/151 (removed 126) transitions.
[2024-05-22 03:54:36] [INFO ] Flow matrix only has 17 transitions (discarded 8 similar events)
// Phase 1: matrix 17 rows 16 cols
[2024-05-22 03:54:36] [INFO ] Computed 7 invariants in 1 ms
[2024-05-22 03:54:36] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 03:54:36] [INFO ] Flow matrix only has 17 transitions (discarded 8 similar events)
[2024-05-22 03:54:36] [INFO ] Invariant cache hit.
[2024-05-22 03:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:54:36] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-22 03:54:36] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-22 03:54:36] [INFO ] Flow matrix only has 17 transitions (discarded 8 similar events)
[2024-05-22 03:54:36] [INFO ] Invariant cache hit.
[2024-05-22 03:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 3/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 24 constraints, problems are : Problem set: 0 solved, 24 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 3/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 16/32 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 24/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/33 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/33 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 48 constraints, problems are : Problem set: 0 solved, 24 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 1157ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 1167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/88 places, 25/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1279 ms. Remains : 16/88 places, 25/151 transitions.
Stuttering acceptance computed with spot in 371 ms :[(NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : DLCround-PT-05a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DLCround-PT-05a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLFireability-04 finished in 1748 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((G(p1)&&F(p2)&&X(p3)&&p0)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 151/151 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 74 transition count 151
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 71 transition count 145
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 71 transition count 145
Applied a total of 20 rules in 8 ms. Remains 71 /88 variables (removed 17) and now considering 145/151 (removed 6) transitions.
[2024-05-22 03:54:38] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
// Phase 1: matrix 114 rows 71 cols
[2024-05-22 03:54:38] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 03:54:38] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 03:54:38] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:54:38] [INFO ] Invariant cache hit.
[2024-05-22 03:54:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:54:38] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-22 03:54:38] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:54:38] [INFO ] Invariant cache hit.
[2024-05-22 03:54:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/71 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 113/184 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 84 constraints, problems are : Problem set: 0 solved, 144 unsolved in 7340 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/71 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 113/184 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 144/227 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 228 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6129 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 13563ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 13572ms
Starting structural reductions in LTL mode, iteration 1 : 71/88 places, 145/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13765 ms. Remains : 71/88 places, 145/151 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : DLCround-PT-05a-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLFireability-05 finished in 14112 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 G((p1||F(p2)))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 151/151 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 74 transition count 151
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 71 transition count 145
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 71 transition count 145
Applied a total of 20 rules in 5 ms. Remains 71 /88 variables (removed 17) and now considering 145/151 (removed 6) transitions.
[2024-05-22 03:54:52] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:54:52] [INFO ] Invariant cache hit.
[2024-05-22 03:54:52] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 03:54:52] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:54:52] [INFO ] Invariant cache hit.
[2024-05-22 03:54:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:54:52] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-22 03:54:52] [INFO ] Flow matrix only has 114 transitions (discarded 31 similar events)
[2024-05-22 03:54:52] [INFO ] Invariant cache hit.
[2024-05-22 03:54:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/71 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 113/184 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 84 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6790 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 2/71 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 113/184 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 144/227 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 228 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6050 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints]
After SMT, in 12898ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 12907ms
Starting structural reductions in LTL mode, iteration 1 : 71/88 places, 145/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13087 ms. Remains : 71/88 places, 145/151 transitions.
Stuttering acceptance computed with spot in 474 ms :[(AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-05a-LTLFireability-06
Stuttering criterion allowed to conclude after 12 steps with 3 reset in 2 ms.
FORMULA DLCround-PT-05a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLFireability-06 finished in 13603 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((p0||G(p1)||F(p2)||G(p3))))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 151/151 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 75 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 73 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 73 transition count 147
Applied a total of 17 rules in 5 ms. Remains 73 /88 variables (removed 15) and now considering 147/151 (removed 4) transitions.
[2024-05-22 03:55:06] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
// Phase 1: matrix 115 rows 73 cols
[2024-05-22 03:55:06] [INFO ] Computed 13 invariants in 2 ms
[2024-05-22 03:55:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 03:55:06] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
[2024-05-22 03:55:06] [INFO ] Invariant cache hit.
[2024-05-22 03:55:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:55:06] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 03:55:06] [INFO ] Flow matrix only has 115 transitions (discarded 32 similar events)
[2024-05-22 03:55:06] [INFO ] Invariant cache hit.
[2024-05-22 03:55:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 3/73 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 114/187 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 1/188 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 87 constraints, problems are : Problem set: 0 solved, 146 unsolved in 6929 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 3/73 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 114/187 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 146/232 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 1/188 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/188 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 233 constraints, problems are : Problem set: 0 solved, 146 unsolved in 6046 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 13034ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 13040ms
Starting structural reductions in LTL mode, iteration 1 : 73/88 places, 147/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13221 ms. Remains : 73/88 places, 147/151 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p2), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DLCround-PT-05a-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 759 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 159 edges and 73 vertex of which 70 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p3) p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X p1), (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 25 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05a-LTLFireability-07 finished in 14615 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((G((F(p0) U p1))&&(p2||X(G(p1))))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 151/151 transitions.
Graph (trivial) has 138 edges and 88 vertex of which 64 / 88 are part of one of the 9 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 50 edges and 33 vertex of which 19 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 17 transition count 22
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 13 place count 11 transition count 16
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 11 transition count 16
Applied a total of 19 rules in 7 ms. Remains 11 /88 variables (removed 77) and now considering 16/151 (removed 135) transitions.
[2024-05-22 03:55:20] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
// Phase 1: matrix 10 rows 11 cols
[2024-05-22 03:55:20] [INFO ] Computed 6 invariants in 2 ms
[2024-05-22 03:55:20] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-22 03:55:20] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2024-05-22 03:55:20] [INFO ] Invariant cache hit.
[2024-05-22 03:55:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:55:20] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-22 03:55:20] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-22 03:55:20] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2024-05-22 03:55:20] [INFO ] Invariant cache hit.
[2024-05-22 03:55:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/20 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 15 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/20 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/21 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 33 constraints, problems are : Problem set: 0 solved, 15 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 546ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 547ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/88 places, 16/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 623 ms. Remains : 11/88 places, 16/151 transitions.
Stuttering acceptance computed with spot in 409 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-05a-LTLFireability-08
Stuttering criterion allowed to conclude after 13 steps with 6 reset in 1 ms.
FORMULA DLCround-PT-05a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLFireability-08 finished in 1059 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))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 151/151 transitions.
Graph (trivial) has 137 edges and 88 vertex of which 62 / 88 are part of one of the 11 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Graph (complete) has 60 edges and 37 vertex of which 22 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output 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 0 with 2 rules applied. Total rules applied 4 place count 22 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 20 transition count 33
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 13 place count 13 transition count 26
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 13 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 13 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 13 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 12 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 12 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 12 transition count 21
Applied a total of 27 rules in 18 ms. Remains 12 /88 variables (removed 76) and now considering 21/151 (removed 130) transitions.
[2024-05-22 03:55:21] [INFO ] Flow matrix only has 13 transitions (discarded 8 similar events)
// Phase 1: matrix 13 rows 12 cols
[2024-05-22 03:55:21] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 03:55:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 03:55:21] [INFO ] Flow matrix only has 13 transitions (discarded 8 similar events)
[2024-05-22 03:55:21] [INFO ] Invariant cache hit.
[2024-05-22 03:55:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:55:21] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-22 03:55:21] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 03:55:21] [INFO ] Flow matrix only has 13 transitions (discarded 8 similar events)
[2024-05-22 03:55:21] [INFO ] Invariant cache hit.
[2024-05-22 03:55:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 20 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 12/24 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 1/25 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/25 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 37 constraints, problems are : Problem set: 0 solved, 20 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 916ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/88 places, 21/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1016 ms. Remains : 12/88 places, 21/151 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-05a-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 24 edges and 12 vertex of which 11 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 23 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-05a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-05a-LTLFireability-09 finished in 1330 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((F(X(X(F((G(!F(p1))&&p0))))) U p2)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 151/151 transitions.
Graph (trivial) has 137 edges and 88 vertex of which 62 / 88 are part of one of the 10 SCC in 0 ms
Free SCC test removed 52 places
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Graph (complete) has 57 edges and 36 vertex of which 23 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 23 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 22 transition count 31
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 10 place count 16 transition count 25
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 16 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 16 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 16 transition count 23
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 15 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 15 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 15 transition count 21
Applied a total of 22 rules in 12 ms. Remains 15 /88 variables (removed 73) and now considering 21/151 (removed 130) transitions.
[2024-05-22 03:55:23] [INFO ] Flow matrix only has 14 transitions (discarded 7 similar events)
// Phase 1: matrix 14 rows 15 cols
[2024-05-22 03:55:23] [INFO ] Computed 7 invariants in 0 ms
[2024-05-22 03:55:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 03:55:23] [INFO ] Flow matrix only has 14 transitions (discarded 7 similar events)
[2024-05-22 03:55:23] [INFO ] Invariant cache hit.
[2024-05-22 03:55:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:55:23] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-22 03:55:23] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 03:55:23] [INFO ] Flow matrix only has 14 transitions (discarded 7 similar events)
[2024-05-22 03:55:23] [INFO ] Invariant cache hit.
[2024-05-22 03:55:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 13/28 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 23 constraints, problems are : Problem set: 0 solved, 20 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 13/28 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/29 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 43 constraints, problems are : Problem set: 0 solved, 20 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 940ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 941ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/88 places, 21/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1042 ms. Remains : 15/88 places, 21/151 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p2)]
Running random walk in product with property : DLCround-PT-05a-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-05a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLFireability-12 finished in 1129 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)))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 151/151 transitions.
Graph (trivial) has 141 edges and 88 vertex of which 65 / 88 are part of one of the 10 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Graph (complete) has 51 edges and 33 vertex of which 18 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 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 4 place count 17 transition count 25
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 12 place count 9 transition count 17
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 9 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 9 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 9 transition count 15
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 8 transition count 14
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 8 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 8 transition count 13
Applied a total of 26 rules in 11 ms. Remains 8 /88 variables (removed 80) and now considering 13/151 (removed 138) transitions.
[2024-05-22 03:55:24] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
// Phase 1: matrix 9 rows 8 cols
[2024-05-22 03:55:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-22 03:55:24] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 03:55:24] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
[2024-05-22 03:55:24] [INFO ] Invariant cache hit.
[2024-05-22 03:55:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:55:24] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-22 03:55:24] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-22 03:55:24] [INFO ] Flow matrix only has 9 transitions (discarded 4 similar events)
[2024-05-22 03:55:24] [INFO ] Invariant cache hit.
[2024-05-22 03:55:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/16 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/17 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/17 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 12 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 8/16 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/17 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/17 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 24 constraints, problems are : Problem set: 0 solved, 12 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 497ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/88 places, 13/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 577 ms. Remains : 8/88 places, 13/151 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-05a-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-05a-LTLFireability-14 finished in 696 ms.
All properties solved by simple procedures.
Total runtime 51128 ms.

BK_STOP 1716350124956

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="DLCround-PT-05a"
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-5568"
echo " Executing tool itstools"
echo " Input is DLCround-PT-05a, 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 r114-smll-171624275400148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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