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.r524-tall-171679079400020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is RingSingleMessageInMbox-PT-d0m010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079400020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 23:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K May 18 16:43 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 RingSingleMessageInMbox-PT-d0m010-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717217970191

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:59:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 04:59:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:59:31] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-06-01 04:59:31] [INFO ] Transformed 385 places.
[2024-06-01 04:59:31] [INFO ] Transformed 59 transitions.
[2024-06-01 04:59:31] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 51 transition count 56
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 51 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 50 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 50 transition count 55
Applied a total of 10 rules in 21 ms. Remains 50 /56 variables (removed 6) and now considering 55/59 (removed 4) transitions.
// Phase 1: matrix 55 rows 50 cols
[2024-06-01 04:59:31] [INFO ] Computed 3 invariants in 9 ms
[2024-06-01 04:59:31] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 04:59:31] [INFO ] Invariant cache hit.
[2024-06-01 04:59:31] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 04:59:31] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 04:59:31] [INFO ] Invariant cache hit.
[2024-06-01 04:59:31] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 4 (OVERLAPS) 55/105 variables, 50/53 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 26/79 constraints. Problems are: Problem set: 5 solved, 49 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/79 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/79 constraints. Problems are: Problem set: 5 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 79 constraints, problems are : Problem set: 5 solved, 49 unsolved in 733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 2/47 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 3/50 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 55/105 variables, 50/53 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 26/79 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 49/128 constraints. Problems are: Problem set: 5 solved, 49 unsolved
[2024-06-01 04:59:33] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 33 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/129 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/129 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/129 constraints. Problems are: Problem set: 5 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 129 constraints, problems are : Problem set: 5 solved, 49 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 49/54 constraints, Known Traps: 1/1 constraints]
After SMT, in 2167ms problems are : Problem set: 5 solved, 49 unsolved
Search for dead transitions found 5 dead transitions in 2179ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in LTL mode, iteration 1 : 50/56 places, 50/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 50
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 48 /50 variables (removed 2) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 48 cols
[2024-06-01 04:59:34] [INFO ] Computed 4 invariants in 6 ms
[2024-06-01 04:59:34] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 04:59:34] [INFO ] Invariant cache hit.
[2024-06-01 04:59:34] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-06-01 04:59:34] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 48/56 places, 50/59 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2663 ms. Remains : 48/56 places, 50/59 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Support contains 16 out of 46 places after structural reductions.
[2024-06-01 04:59:34] [INFO ] Flatten gal took : 19 ms
[2024-06-01 04:59:34] [INFO ] Flatten gal took : 8 ms
[2024-06-01 04:59:34] [INFO ] Input system was already deterministic with 50 transitions.
Support contains 13 out of 46 places (down from 16) after GAL structural reductions.
RANDOM walk for 40000 steps (8651 resets) in 1204 ms. (33 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (2208 resets) in 176 ms. (226 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (3718 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
// Phase 1: matrix 50 rows 46 cols
[2024-06-01 04:59:35] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 04:59:35] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 9/14 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/26 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/62 variables, 26/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 10/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/95 variables, 19/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 14/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/96 variables, 1/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/96 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/96 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 72 constraints, problems are : Problem set: 1 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/26 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 36/62 variables, 26/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 10/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/95 variables, 19/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 14/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 1/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/95 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/96 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/96 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/96 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 73 constraints, problems are : Problem set: 1 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 50/50 transitions.
Graph (complete) has 117 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 45 transition count 47
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 42 transition count 42
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 42 transition count 42
Applied a total of 10 rules in 12 ms. Remains 42 /46 variables (removed 4) and now considering 42/50 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 42/46 places, 42/50 transitions.
RANDOM walk for 40000 steps (8666 resets) in 563 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3833 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 374 steps, run visited all 1 properties in 11 ms. (steps per millisecond=34 )
Probabilistic random walk after 374 steps, saw 199 distinct states, run finished after 21 ms. (steps per millisecond=17 ) properties seen :1
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 13 stable transitions
Graph (complete) has 138 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 50/50 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 44
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 44/50 (removed 6) transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-06-01 04:59:35] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 04:59:35] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 04:59:35] [INFO ] Invariant cache hit.
[2024-06-01 04:59:35] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 04:59:35] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-06-01 04:59:35] [INFO ] Invariant cache hit.
[2024-06-01 04:59:35] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1488ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1490ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 44/50 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1594 ms. Remains : 42/46 places, 44/50 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m010-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m010-LTLFireability-00 finished in 1846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 50/50 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 44
Applied a total of 8 rules in 2 ms. Remains 42 /46 variables (removed 4) and now considering 44/50 (removed 6) transitions.
[2024-06-01 04:59:37] [INFO ] Invariant cache hit.
[2024-06-01 04:59:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 04:59:37] [INFO ] Invariant cache hit.
[2024-06-01 04:59:37] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 04:59:37] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-06-01 04:59:37] [INFO ] Invariant cache hit.
[2024-06-01 04:59:37] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1158ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1159ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 44/50 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1253 ms. Remains : 42/46 places, 44/50 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m010-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 128 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d0m010-LTLFireability-01 finished in 1722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 50/50 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 45
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 45
Applied a total of 6 rules in 3 ms. Remains 43 /46 variables (removed 3) and now considering 45/50 (removed 5) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-06-01 04:59:39] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 04:59:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 04:59:39] [INFO ] Invariant cache hit.
[2024-06-01 04:59:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 04:59:39] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-01 04:59:39] [INFO ] Invariant cache hit.
[2024-06-01 04:59:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 0 solved, 44 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 109 constraints, problems are : Problem set: 0 solved, 44 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1227ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1228ms
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 45/50 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1327 ms. Remains : 43/46 places, 45/50 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m010-LTLFireability-02
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m010-LTLFireability-02 finished in 1548 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&&G(F(p1)))) U p2))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 50/50 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 48
Applied a total of 4 rules in 10 ms. Remains 44 /46 variables (removed 2) and now considering 48/50 (removed 2) transitions.
// Phase 1: matrix 48 rows 44 cols
[2024-06-01 04:59:40] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 04:59:42] [INFO ] Implicit Places using invariants in 1369 ms returned []
[2024-06-01 04:59:42] [INFO ] Invariant cache hit.
[2024-06-01 04:59:42] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 04:59:42] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2024-06-01 04:59:42] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-06-01 04:59:42] [INFO ] Invariant cache hit.
[2024-06-01 04:59:42] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/92 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 69 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1217 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/92 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 47/116 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/92 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 116 constraints, problems are : Problem set: 0 solved, 47 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 2001ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2002ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/46 places, 48/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3483 ms. Remains : 44/46 places, 48/50 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m010-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m010-LTLFireability-07 finished in 3737 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 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 50/50 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 44
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 44/50 (removed 6) transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-06-01 04:59:44] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 04:59:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 04:59:44] [INFO ] Invariant cache hit.
[2024-06-01 04:59:44] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 04:59:44] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-01 04:59:44] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 04:59:44] [INFO ] Invariant cache hit.
[2024-06-01 04:59:44] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1162ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1165ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/46 places, 44/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1263 ms. Remains : 42/46 places, 44/50 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m010-LTLFireability-08
Product exploration explored 100000 steps with 21502 reset in 163 ms.
Product exploration explored 100000 steps with 21564 reset in 133 ms.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 128 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 339 steps (67 resets) in 8 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-06-01 04:59:46] [INFO ] Invariant cache hit.
[2024-06-01 04:59:46] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 04:59:46] [INFO ] Invariant cache hit.
[2024-06-01 04:59:46] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 04:59:46] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-01 04:59:46] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 04:59:46] [INFO ] Invariant cache hit.
[2024-06-01 04:59:46] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1099ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1099ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1198 ms. Remains : 42/42 places, 44/44 transitions.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 128 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 520 steps (107 resets) in 5 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21722 reset in 74 ms.
Product exploration explored 100000 steps with 21756 reset in 141 ms.
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 42 /42 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-06-01 04:59:48] [INFO ] Invariant cache hit.
[2024-06-01 04:59:48] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 04:59:48] [INFO ] Invariant cache hit.
[2024-06-01 04:59:48] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 04:59:48] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-06-01 04:59:48] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 04:59:48] [INFO ] Invariant cache hit.
[2024-06-01 04:59:48] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1192ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1194ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1302 ms. Remains : 42/42 places, 44/44 transitions.
Treatment of property RingSingleMessageInMbox-PT-d0m010-LTLFireability-08 finished in 5648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 50/50 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 44
Applied a total of 8 rules in 2 ms. Remains 42 /46 variables (removed 4) and now considering 44/50 (removed 6) transitions.
[2024-06-01 04:59:50] [INFO ] Invariant cache hit.
[2024-06-01 04:59:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 04:59:50] [INFO ] Invariant cache hit.
[2024-06-01 04:59:50] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 04:59:50] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-06-01 04:59:50] [INFO ] Invariant cache hit.
[2024-06-01 04:59:50] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1124ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 44/50 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1204 ms. Remains : 42/46 places, 44/50 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m010-LTLFireability-11
Entered a terminal (fully accepting) state of product in 138 steps with 31 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m010-LTLFireability-11 finished in 1351 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)))'
[2024-06-01 04:59:51] [INFO ] Flatten gal took : 7 ms
[2024-06-01 04:59:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 04:59:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 50 transitions and 194 arcs took 1 ms.
Total runtime 20277 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA RingSingleMessageInMbox-PT-d0m010-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717217992425

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name RingSingleMessageInMbox-PT-d0m010-LTLFireability-08
ltl formula formula --ltl=/tmp/845/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 46 places, 50 transitions and 194 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/845/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/845/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/845/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/845/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 48 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 47, there are 53 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~310 levels ~10000 states ~19348 transitions
pnml2lts-mc( 2/ 4): ~499 levels ~20000 states ~49144 transitions
pnml2lts-mc( 2/ 4): ~499 levels ~40000 states ~111356 transitions
pnml2lts-mc( 2/ 4): ~499 levels ~80000 states ~214984 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 67315
pnml2lts-mc( 0/ 4): unique states count: 89415
pnml2lts-mc( 0/ 4): unique transitions count: 214147
pnml2lts-mc( 0/ 4): - self-loop count: 34092
pnml2lts-mc( 0/ 4): - claim dead count: 66138
pnml2lts-mc( 0/ 4): - claim found count: 31169
pnml2lts-mc( 0/ 4): - claim success count: 90175
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2131
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 91958 states 229724 transitions, fanout: 2.498
pnml2lts-mc( 0/ 4): Total exploration time 0.460 sec (0.460 sec minimum, 0.460 sec on average)
pnml2lts-mc( 0/ 4): States per second: 199909, Transitions per second: 499400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.1MB, 12.7 B/state, compr.: 6.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 50 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.1MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is RingSingleMessageInMbox-PT-d0m010, 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 r524-tall-171679079400020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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