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.r532-smll-171683810600043.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 SieveSingleMsgMbox-PT-d0m96, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810600043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 19:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 19:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 19:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 19:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K 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 SieveSingleMsgMbox-PT-d0m96-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m96-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717242515837

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m96
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:48:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:48:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:48:38] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-06-01 11:48:38] [INFO ] Transformed 262 places.
[2024-06-01 11:48:38] [INFO ] Transformed 73 transitions.
[2024-06-01 11:48:38] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 379 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Deduced a syphon composed of 190 places in 3 ms
Reduce places removed 190 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 60 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 59 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 59 transition count 61
Applied a total of 25 rules in 78 ms. Remains 59 /72 variables (removed 13) and now considering 61/73 (removed 12) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-06-01 11:48:39] [INFO ] Computed 5 invariants in 19 ms
[2024-06-01 11:48:39] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-06-01 11:48:39] [INFO ] Invariant cache hit.
[2024-06-01 11:48:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:48:39] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 11:48:39] [INFO ] Invariant cache hit.
[2024-06-01 11:48:39] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:48:40] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 22 ms to minimize.
[2024-06-01 11:48:41] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3255 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
After SMT, in 6182ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6207ms
Starting structural reductions in LTL mode, iteration 1 : 59/72 places, 61/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7133 ms. Remains : 59/72 places, 61/73 transitions.
Support contains 2 out of 59 places after structural reductions.
[2024-06-01 11:48:46] [INFO ] Flatten gal took : 36 ms
[2024-06-01 11:48:46] [INFO ] Flatten gal took : 16 ms
[2024-06-01 11:48:46] [INFO ] Input system was already deterministic with 61 transitions.
RANDOM walk for 40000 steps (8879 resets) in 990 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4142 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4042 resets) in 406 ms. (98 steps per ms) remains 1/2 properties
[2024-06-01 11:48:46] [INFO ] Invariant cache hit.
[2024-06-01 11:48:47] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/47 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:48:47] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 52/99 variables, 47/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/120 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/35 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/47 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:48:47] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/99 variables, 47/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 16/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/120 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/120 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/120 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/120 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 58 transition count 59
Applied a total of 3 rules in 25 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 58/59 places, 59/61 transitions.
RANDOM walk for 40000 steps (8942 resets) in 461 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4060 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 379 steps, run visited all 1 properties in 12 ms. (steps per millisecond=31 )
Probabilistic random walk after 379 steps, saw 220 distinct states, run finished after 19 ms. (steps per millisecond=19 ) properties seen :1
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 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' '!(F(p0))'
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 11 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 11:48:47] [INFO ] Invariant cache hit.
[2024-06-01 11:48:48] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 11:48:48] [INFO ] Invariant cache hit.
[2024-06-01 11:48:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:48:48] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-06-01 11:48:48] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:48:48] [INFO ] Invariant cache hit.
[2024-06-01 11:48:48] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:48:49] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
[2024-06-01 11:48:49] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2790 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2787 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
After SMT, in 5696ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 5699ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6059 ms. Remains : 59/59 places, 61/61 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-10 finished in 6373 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 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 11:48:54] [INFO ] Invariant cache hit.
[2024-06-01 11:48:54] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 11:48:54] [INFO ] Invariant cache hit.
[2024-06-01 11:48:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:48:54] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-01 11:48:54] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:48:54] [INFO ] Invariant cache hit.
[2024-06-01 11:48:54] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:48:55] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:48:55] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2059 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
After SMT, in 3902ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3903ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4161 ms. Remains : 59/59 places, 61/61 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14
Product exploration explored 100000 steps with 22403 reset in 314 ms.
Product exploration explored 100000 steps with 22478 reset in 229 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8910 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4085 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 379 steps, run visited all 1 properties in 8 ms. (steps per millisecond=47 )
Probabilistic random walk after 379 steps, saw 220 distinct states, run finished after 8 ms. (steps per millisecond=47 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 11:48:59] [INFO ] Invariant cache hit.
[2024-06-01 11:48:59] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 11:48:59] [INFO ] Invariant cache hit.
[2024-06-01 11:48:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:48:59] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-01 11:48:59] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:48:59] [INFO ] Invariant cache hit.
[2024-06-01 11:48:59] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:49:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:49:00] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1944 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
After SMT, in 3734ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3736ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3975 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8964 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4072 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 379 steps, run visited all 1 properties in 6 ms. (steps per millisecond=63 )
Probabilistic random walk after 379 steps, saw 220 distinct states, run finished after 6 ms. (steps per millisecond=63 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22305 reset in 97 ms.
Product exploration explored 100000 steps with 22306 reset in 192 ms.
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 11:49:04] [INFO ] Invariant cache hit.
[2024-06-01 11:49:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 11:49:04] [INFO ] Invariant cache hit.
[2024-06-01 11:49:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:49:04] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-06-01 11:49:04] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:49:04] [INFO ] Invariant cache hit.
[2024-06-01 11:49:04] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:49:05] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:49:05] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2166 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints]
After SMT, in 4128ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4129ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4361 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14 finished in 14686 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 11:49:09] [INFO ] Flatten gal took : 9 ms
[2024-06-01 11:49:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:49:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 61 transitions and 241 arcs took 6 ms.
Total runtime 31137 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717242549618

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name SieveSingleMsgMbox-PT-d0m96-LTLCardinality-14
ltl formula formula --ltl=/tmp/743/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 59 places, 61 transitions and 241 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( 0/ 4): LTL layer: formula: /tmp/743/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/743/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/743/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/743/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 61 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 60, there are 64 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( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~50!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 413
pnml2lts-mc( 0/ 4): unique states count: 593
pnml2lts-mc( 0/ 4): unique transitions count: 1370
pnml2lts-mc( 0/ 4): - self-loop count: 352
pnml2lts-mc( 0/ 4): - claim dead count: 49
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 647
pnml2lts-mc( 0/ 4): - cum. max stack depth: 230
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 647 states 1518 transitions, fanout: 2.346
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 64700, Transitions per second: 151800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 15.6 B/state, compr.: 6.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 61 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~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="SieveSingleMsgMbox-PT-d0m96"
export BK_EXAMINATION="LTLCardinality"
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 SieveSingleMsgMbox-PT-d0m96, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683810600043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m96.tgz
mv SieveSingleMsgMbox-PT-d0m96 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;