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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 19:30 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 450K 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-d1m06-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717243020306

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-d1m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:57:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:57:02] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2024-06-01 11:57:02] [INFO ] Transformed 1295 places.
[2024-06-01 11:57:02] [INFO ] Transformed 749 transitions.
[2024-06-01 11:57:02] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 492 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 15 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 316 place count 183 transition count 247
Iterating global reduction 1 with 59 rules applied. Total rules applied 375 place count 183 transition count 247
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 382 place count 183 transition count 240
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 424 place count 141 transition count 198
Iterating global reduction 2 with 42 rules applied. Total rules applied 466 place count 141 transition count 198
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 480 place count 141 transition count 184
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 503 place count 118 transition count 159
Iterating global reduction 3 with 23 rules applied. Total rules applied 526 place count 118 transition count 159
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 544 place count 118 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 549 place count 113 transition count 134
Iterating global reduction 4 with 5 rules applied. Total rules applied 554 place count 113 transition count 134
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 559 place count 108 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 564 place count 108 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 566 place count 106 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 568 place count 106 transition count 126
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 570 place count 104 transition count 124
Iterating global reduction 4 with 2 rules applied. Total rules applied 572 place count 104 transition count 124
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 574 place count 102 transition count 122
Iterating global reduction 4 with 2 rules applied. Total rules applied 576 place count 102 transition count 122
Applied a total of 576 rules in 124 ms. Remains 102 /259 variables (removed 157) and now considering 122/749 (removed 627) transitions.
// Phase 1: matrix 122 rows 102 cols
[2024-06-01 11:57:03] [INFO ] Computed 5 invariants in 16 ms
[2024-06-01 11:57:03] [INFO ] Implicit Places using invariants in 545 ms returned []
[2024-06-01 11:57:03] [INFO ] Invariant cache hit.
[2024-06-01 11:57:04] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 11:57:04] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-06-01 11:57:04] [INFO ] Invariant cache hit.
[2024-06-01 11:57:04] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:57:07] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 19 ms to minimize.
[2024-06-01 11:57:07] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 4 ms to minimize.
[2024-06-01 11:57:07] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-06-01 11:57:07] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 11:57:07] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-01 11:57:07] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 11:57:07] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 122/224 variables, 102/114 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 54/168 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:57:10] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/224 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 169 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9474 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 122/224 variables, 102/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 54/169 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 121/290 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 290 constraints, problems are : Problem set: 0 solved, 121 unsolved in 12813 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
After SMT, in 22722ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 22743ms
Starting structural reductions in LTL mode, iteration 1 : 102/259 places, 122/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23966 ms. Remains : 102/259 places, 122/749 transitions.
Support contains 4 out of 102 places after structural reductions.
[2024-06-01 11:57:27] [INFO ] Flatten gal took : 75 ms
[2024-06-01 11:57:27] [INFO ] Flatten gal took : 34 ms
[2024-06-01 11:57:27] [INFO ] Input system was already deterministic with 122 transitions.
RANDOM walk for 40000 steps (8969 resets) in 3206 ms. (12 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4029 resets) in 318 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4395 resets) in 290 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4269 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
Probably explored full state space saw : 96716 states, properties seen :2
Probabilistic random walk after 250181 steps, saw 96716 distinct states, run finished after 517 ms. (steps per millisecond=483 ) properties seen :2
Explored full state space saw : 96717 states, properties seen :0
Exhaustive walk after 250182 steps, saw 96717 distinct states, run finished after 268 ms. (steps per millisecond=933 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 328 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 100 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 98 transition count 117
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 98 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 98 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 95 transition count 113
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 95 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 93 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 93 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 91 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 91 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 91 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 89 transition count 104
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 88 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 87 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 86 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 85 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 84 transition count 98
Applied a total of 40 rules in 50 ms. Remains 84 /102 variables (removed 18) and now considering 98/122 (removed 24) transitions.
// Phase 1: matrix 98 rows 84 cols
[2024-06-01 11:57:30] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 11:57:30] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 11:57:30] [INFO ] Invariant cache hit.
[2024-06-01 11:57:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 11:57:30] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-06-01 11:57:30] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 11:57:30] [INFO ] Invariant cache hit.
[2024-06-01 11:57:30] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 11:57:31] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 11:57:32] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-01 11:57:32] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:57:32] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:57:32] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-06-01 11:57:32] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/182 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 139 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6092 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 11:57:37] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/182 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 97/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 237 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8793 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints]
After SMT, in 15066ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 15070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/102 places, 98/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15476 ms. Remains : 84/102 places, 98/122 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01
Product exploration explored 100000 steps with 22441 reset in 531 ms.
Product exploration explored 100000 steps with 22340 reset in 280 ms.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8948 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4149 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17346 steps, run visited all 1 properties in 35 ms. (steps per millisecond=495 )
Probabilistic random walk after 17346 steps, saw 7882 distinct states, run finished after 40 ms. (steps per millisecond=433 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-06-01 11:57:46] [INFO ] Invariant cache hit.
[2024-06-01 11:57:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 11:57:47] [INFO ] Invariant cache hit.
[2024-06-01 11:57:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 11:57:47] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-06-01 11:57:47] [INFO ] Redundant transitions in 4 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 11:57:47] [INFO ] Invariant cache hit.
[2024-06-01 11:57:47] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 11:57:48] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 11:57:49] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:57:49] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-06-01 11:57:49] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-01 11:57:49] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-01 11:57:49] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/182 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 139 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5940 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 11:57:54] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/182 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 97/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 237 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints]
After SMT, in 14326ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 14329ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14729 ms. Remains : 84/84 places, 98/98 transitions.
Computed a total of 13 stabilizing places and 17 stable transitions
Graph (complete) has 269 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8982 resets) in 280 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4141 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17346 steps, run visited all 1 properties in 205 ms. (steps per millisecond=84 )
Probabilistic random walk after 17346 steps, saw 7882 distinct states, run finished after 221 ms. (steps per millisecond=78 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22404 reset in 175 ms.
Product exploration explored 100000 steps with 22389 reset in 189 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 98/98 transitions.
Applied a total of 0 rules in 14 ms. Remains 84 /84 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-06-01 11:58:02] [INFO ] Invariant cache hit.
[2024-06-01 11:58:03] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 11:58:03] [INFO ] Invariant cache hit.
[2024-06-01 11:58:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 11:58:03] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-06-01 11:58:03] [INFO ] Redundant transitions in 2 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 11:58:03] [INFO ] Invariant cache hit.
[2024-06-01 11:58:03] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 11:58:04] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 11:58:05] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:58:05] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:58:05] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:58:05] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:58:05] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 98/182 variables, 84/95 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 139 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6068 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 11:58:10] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/182 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 97/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 237 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7477 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 84/84 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints]
After SMT, in 13636ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 13638ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14139 ms. Remains : 84/84 places, 98/98 transitions.
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01 finished in 47148 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(p0)))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 100 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 100 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 98 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 98 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 98 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 95 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 95 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 95 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 93 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 93 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 91 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 91 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 89 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 89 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 87 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 87 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 86 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 85 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 84 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 83 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 83 transition count 90
Applied a total of 41 rules in 28 ms. Remains 83 /102 variables (removed 19) and now considering 90/122 (removed 32) transitions.
// Phase 1: matrix 90 rows 83 cols
[2024-06-01 11:58:17] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 11:58:17] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 11:58:17] [INFO ] Invariant cache hit.
[2024-06-01 11:58:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-01 11:58:17] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-06-01 11:58:17] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-06-01 11:58:17] [INFO ] Invariant cache hit.
[2024-06-01 11:58:17] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 11:58:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2024-06-01 11:58:18] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-06-01 11:58:18] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-06-01 11:58:18] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-06-01 11:58:19] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 90/173 variables, 83/94 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 130 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5515 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-06-01 11:58:23] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 90/173 variables, 83/95 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 36/131 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 89/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/173 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (OVERLAPS) 0/173 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 220 constraints, problems are : Problem set: 0 solved, 89 unsolved in 8247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
After SMT, in 13841ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 13845ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/102 places, 90/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14255 ms. Remains : 83/102 places, 90/122 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m06-LTLCardinality-09 finished in 14310 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(p0)))'
[2024-06-01 11:58:31] [INFO ] Flatten gal took : 16 ms
[2024-06-01 11:58:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:58:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 122 transitions and 484 arcs took 6 ms.
Total runtime 89473 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d1m06-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717243111988

--------------------
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-d1m06-LTLCardinality-01
ltl formula formula --ltl=/tmp/781/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 102 places, 122 transitions and 484 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/781/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/781/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/781/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/781/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 103 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 103, there are 126 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~98!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1416
pnml2lts-mc( 0/ 4): unique states count: 1694
pnml2lts-mc( 0/ 4): unique transitions count: 3763
pnml2lts-mc( 0/ 4): - self-loop count: 1163
pnml2lts-mc( 0/ 4): - claim dead count: 269
pnml2lts-mc( 0/ 4): - claim found count: 6
pnml2lts-mc( 0/ 4): - claim success count: 1739
pnml2lts-mc( 0/ 4): - cum. max stack depth: 330
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1739 states 3942 transitions, fanout: 2.267
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.010 sec minimum, 0.025 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57967, Transitions per second: 131400
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.3 B/state, compr.: 3.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 122 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-d1m06"
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-d1m06, 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-171683810700059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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