fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r378-smll-171683810700073
Last Updated
July 7, 2024

About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d1m36

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6265.668 2754260.00 2900298.00 6785.00 TFTTTTFFTFFFTTFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 19:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 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-d1m36-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716900777492

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 12:52:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 12:53:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:53:00] [INFO ] Load time of PNML (sax parser for PT used): 331 ms
[2024-05-28 12:53:00] [INFO ] Transformed 1295 places.
[2024-05-28 12:53:00] [INFO ] Transformed 749 transitions.
[2024-05-28 12:53:00] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 731 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Deduced a syphon composed of 1036 places in 20 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 224 transitions.
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 243 transition count 525
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 300 place count 183 transition count 234
Iterating global reduction 1 with 60 rules applied. Total rules applied 360 place count 183 transition count 234
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 366 place count 183 transition count 228
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 408 place count 141 transition count 186
Iterating global reduction 2 with 42 rules applied. Total rules applied 450 place count 141 transition count 186
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 465 place count 141 transition count 171
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 487 place count 119 transition count 148
Iterating global reduction 3 with 22 rules applied. Total rules applied 509 place count 119 transition count 148
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 521 place count 119 transition count 136
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 528 place count 112 transition count 126
Iterating global reduction 4 with 7 rules applied. Total rules applied 535 place count 112 transition count 126
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 542 place count 105 transition count 119
Iterating global reduction 4 with 7 rules applied. Total rules applied 549 place count 105 transition count 119
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 553 place count 101 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 557 place count 101 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 558 place count 101 transition count 113
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 561 place count 98 transition count 110
Iterating global reduction 5 with 3 rules applied. Total rules applied 564 place count 98 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 565 place count 97 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 566 place count 97 transition count 109
Applied a total of 566 rules in 186 ms. Remains 97 /259 variables (removed 162) and now considering 109/749 (removed 640) transitions.
// Phase 1: matrix 109 rows 97 cols
[2024-05-28 12:53:01] [INFO ] Computed 5 invariants in 26 ms
[2024-05-28 12:53:01] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-28 12:53:01] [INFO ] Invariant cache hit.
[2024-05-28 12:53:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 12:53:02] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 1025 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-28 12:53:02] [INFO ] Invariant cache hit.
[2024-05-28 12:53:02] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 12:53:04] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 22 ms to minimize.
[2024-05-28 12:53:04] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/205 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 148 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/205 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 44/147 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 98/245 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 12:53:13] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 3 ms to minimize.
[2024-05-28 12:53:13] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 1/206 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 10/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (OVERLAPS) 0/206 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 258 constraints, problems are : Problem set: 0 solved, 108 unsolved in 14505 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 4/4 constraints]
After SMT, in 22816ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 22839ms
Starting structural reductions in LTL mode, iteration 1 : 97/259 places, 109/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24092 ms. Remains : 97/259 places, 109/749 transitions.
Support contains 9 out of 97 places after structural reductions.
[2024-05-28 12:53:25] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 12:53:25] [INFO ] Flatten gal took : 71 ms
[2024-05-28 12:53:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 12:53:25] [INFO ] Flatten gal took : 33 ms
[2024-05-28 12:53:25] [INFO ] Input system was already deterministic with 109 transitions.
Support contains 7 out of 97 places (down from 9) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8992 resets) in 2463 ms. (16 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (4083 resets) in 782 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (4022 resets) in 254 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4225 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (4154 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4086 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
[2024-05-28 12:53:27] [INFO ] Invariant cache hit.
[2024-05-28 12:53:27] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 8/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
At refinement iteration 5 (OVERLAPS) 18/79 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 95/174 variables, 79/84 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 30/114 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 10 (OVERLAPS) 31/205 variables, 17/131 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 14/145 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/145 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/206 variables, 1/146 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 0/146 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/206 variables, 0/146 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 146 constraints, problems are : Problem set: 3 solved, 2 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/58 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 20/78 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-28 12:53:27] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 12:53:27] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-28 12:53:27] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 94/172 variables, 78/86 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 29/115 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 1/116 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 33/205 variables, 18/134 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 15/149 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 1/150 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-28 12:53:27] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 1/151 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 0/151 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/206 variables, 1/152 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/206 variables, 0/152 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/206 variables, 0/152 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 152 constraints, problems are : Problem set: 3 solved, 2 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 1005ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2077 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Graph (complete) has 271 edges and 97 vertex of which 95 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 95 transition count 106
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 91 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 91 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 91 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 89 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 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 19 place count 89 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 88 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 88 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 87 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 87 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 86 transition count 93
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 85 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 84 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 84 transition count 91
Applied a total of 29 rules in 50 ms. Remains 84 /97 variables (removed 13) and now considering 91/109 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 84/97 places, 91/109 transitions.
RANDOM walk for 40000 steps (8904 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4202 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4077 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2110622 steps, run timeout after 3001 ms. (steps per millisecond=703 ) properties seen :1 out of 2
Probabilistic random walk after 2110622 steps, saw 873733 distinct states, run finished after 3005 ms. (steps per millisecond=702 ) properties seen :1
// Phase 1: matrix 91 rows 84 cols
[2024-05-28 12:53:33] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 12:53:33] [INFO ] State equation strengthened by 36 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/55 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 65/120 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/150 variables, 16/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 24/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 25/175 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/175 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/55 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 65/120 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:53:33] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 30/150 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 24/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/150 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 25/175 variables, 13/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/175 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/175 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/175 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 368ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 185 ms.
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 91/91 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 83 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 83 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 82 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 82 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 81 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 81 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 81 transition count 86
Applied a total of 7 rules in 12 ms. Remains 81 /84 variables (removed 3) and now considering 86/91 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 81/84 places, 86/91 transitions.
RANDOM walk for 40000 steps (8950 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4092 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2347068 steps, run timeout after 3001 ms. (steps per millisecond=782 ) properties seen :0 out of 1
Probabilistic random walk after 2347068 steps, saw 972395 distinct states, run finished after 3001 ms. (steps per millisecond=782 ) properties seen :0
// Phase 1: matrix 86 rows 81 cols
[2024-05-28 12:53:36] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 12:53:36] [INFO ] State equation strengthened by 34 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 23/167 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/167 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/167 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 313 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 81/81 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-28 12:53:37] [INFO ] Invariant cache hit.
[2024-05-28 12:53:37] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-28 12:53:37] [INFO ] Invariant cache hit.
[2024-05-28 12:53:37] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-28 12:53:38] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-28 12:53:38] [INFO ] Redundant transitions in 3 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-28 12:53:38] [INFO ] Invariant cache hit.
[2024-05-28 12:53:38] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3213 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 204 constraints, problems are : Problem set: 0 solved, 85 unsolved in 6308 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 9655ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 9659ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10156 ms. Remains : 81/81 places, 86/86 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 81 transition count 79
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 76 transition count 79
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 12 place count 76 transition count 66
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 63 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 57 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 57 transition count 60
Applied a total of 51 rules in 35 ms. Remains 57 /81 variables (removed 24) and now considering 60/86 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 57 cols
[2024-05-28 12:53:47] [INFO ] Computed 6 invariants in 5 ms
[2024-05-28 12:53:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 12:53:47] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 12:53:47] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 12:53:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-28 12:53:47] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 12:53:47] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 12:53:48] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 14 ms to minimize.
[2024-05-28 12:53:48] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-28 12:53:48] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:53:48] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-28 12:53:48] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-28 12:53:48] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-28 12:53:48] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-28 12:53:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 511 ms
TRAPS : Iteration 1
[2024-05-28 12:53:48] [INFO ] After 586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 12:53:48] [INFO ] After 643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 817 ms.
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 12:53:48] [INFO ] Flatten gal took : 19 ms
[2024-05-28 12:53:48] [INFO ] Flatten gal took : 18 ms
[2024-05-28 12:53:48] [INFO ] Input system was already deterministic with 109 transitions.
Computed a total of 21 stabilizing places and 26 stable transitions
Graph (complete) has 305 edges and 97 vertex of which 95 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 109/109 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 108
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 90 transition count 102
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 90 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 90 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 87 transition count 97
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 87 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 87 transition count 95
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 27 place count 84 transition count 91
Iterating global reduction 3 with 3 rules applied. Total rules applied 30 place count 84 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 84 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 33 place count 82 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 82 transition count 88
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 37 place count 80 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 80 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 40 place count 80 transition count 84
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 42 place count 78 transition count 82
Iterating global reduction 5 with 2 rules applied. Total rules applied 44 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 45 place count 77 transition count 81
Iterating global reduction 5 with 1 rules applied. Total rules applied 46 place count 77 transition count 81
Applied a total of 46 rules in 29 ms. Remains 77 /97 variables (removed 20) and now considering 81/109 (removed 28) transitions.
// Phase 1: matrix 81 rows 77 cols
[2024-05-28 12:53:48] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 12:53:48] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 12:53:48] [INFO ] Invariant cache hit.
[2024-05-28 12:53:48] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-28 12:53:48] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-28 12:53:48] [INFO ] Invariant cache hit.
[2024-05-28 12:53:48] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-28 12:53:49] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-28 12:53:49] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 116 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2996 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/158 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 32/116 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 80/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 196 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3916 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 7001ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 7005ms
Starting structural reductions in LTL mode, iteration 1 : 77/97 places, 81/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7331 ms. Remains : 77/97 places, 81/109 transitions.
[2024-05-28 12:53:55] [INFO ] Flatten gal took : 11 ms
[2024-05-28 12:53:55] [INFO ] Flatten gal took : 12 ms
[2024-05-28 12:53:56] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-28 12:53:56] [INFO ] Flatten gal took : 12 ms
[2024-05-28 12:53:56] [INFO ] Flatten gal took : 12 ms
[2024-05-28 12:53:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality7554164552879465591.gal : 6 ms
[2024-05-28 12:53:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality8123362086374396927.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7554164552879465591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8123362086374396927.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 12:54:26] [INFO ] Flatten gal took : 8 ms
[2024-05-28 12:54:26] [INFO ] Applying decomposition
[2024-05-28 12:54:26] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12179195197512451996.txt' '-o' '/tmp/graph12179195197512451996.bin' '-w' '/tmp/graph12179195197512451996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12179195197512451996.bin' '-l' '-1' '-v' '-w' '/tmp/graph12179195197512451996.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:54:26] [INFO ] Decomposing Gal with order
[2024-05-28 12:54:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:54:26] [INFO ] Removed a total of 76 redundant transitions.
[2024-05-28 12:54:26] [INFO ] Flatten gal took : 56 ms
[2024-05-28 12:54:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 10 ms.
[2024-05-28 12:54:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality13320801432472120624.gal : 7 ms
[2024-05-28 12:54:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality5046873849380292428.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13320801432472120624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5046873849380292428.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 109/109 transitions.
Graph (complete) has 305 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 91 transition count 103
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 91 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 91 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 88 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 88 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 88 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 25 place count 85 transition count 92
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 85 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 29 place count 85 transition count 91
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 31 place count 83 transition count 89
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 83 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 35 place count 81 transition count 86
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 81 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 38 place count 81 transition count 85
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 40 place count 79 transition count 83
Iterating global reduction 5 with 2 rules applied. Total rules applied 42 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 43 place count 78 transition count 82
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 78 transition count 82
Applied a total of 44 rules in 33 ms. Remains 78 /97 variables (removed 19) and now considering 82/109 (removed 27) transitions.
// Phase 1: matrix 82 rows 78 cols
[2024-05-28 12:54:56] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 12:54:56] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 12:54:56] [INFO ] Invariant cache hit.
[2024-05-28 12:54:56] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-28 12:54:56] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-05-28 12:54:56] [INFO ] Redundant transitions in 2 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-28 12:54:56] [INFO ] Invariant cache hit.
[2024-05-28 12:54:56] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-28 12:54:57] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-05-28 12:54:57] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 82/160 variables, 78/85 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 33/118 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-28 12:54:59] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/160 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/160 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 119 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3853 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 82/160 variables, 78/86 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 33/119 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 200 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
After SMT, in 7673ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 7675ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/97 places, 82/109 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8010 ms. Remains : 78/97 places, 82/109 transitions.
[2024-05-28 12:55:04] [INFO ] Flatten gal took : 11 ms
[2024-05-28 12:55:04] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:55:04] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-28 12:55:04] [INFO ] Flatten gal took : 6 ms
[2024-05-28 12:55:04] [INFO ] Flatten gal took : 6 ms
[2024-05-28 12:55:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality6107568975038854932.gal : 2 ms
[2024-05-28 12:55:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality15133535525198671321.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6107568975038854932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15133535525198671321.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 12:55:34] [INFO ] Flatten gal took : 7 ms
[2024-05-28 12:55:34] [INFO ] Applying decomposition
[2024-05-28 12:55:34] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2752701661834042265.txt' '-o' '/tmp/graph2752701661834042265.bin' '-w' '/tmp/graph2752701661834042265.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2752701661834042265.bin' '-l' '-1' '-v' '-w' '/tmp/graph2752701661834042265.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:55:34] [INFO ] Decomposing Gal with order
[2024-05-28 12:55:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:55:34] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-28 12:55:34] [INFO ] Flatten gal took : 15 ms
[2024-05-28 12:55:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 7 ms.
[2024-05-28 12:55:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality14456217349670739471.gal : 3 ms
[2024-05-28 12:55:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality12782860090867457688.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14456217349670739471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12782860090867457688.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 109/109 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 96 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 91 transition count 103
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 91 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 91 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 89 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 89 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 87 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 87 transition count 95
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 85 transition count 93
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 85 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 83 transition count 90
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 83 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 83 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 35 place count 81 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 81 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 80 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 80 transition count 86
Applied a total of 39 rules in 13 ms. Remains 80 /97 variables (removed 17) and now considering 86/109 (removed 23) transitions.
// Phase 1: matrix 86 rows 80 cols
[2024-05-28 12:56:04] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 12:56:04] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 12:56:04] [INFO ] Invariant cache hit.
[2024-05-28 12:56:04] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-28 12:56:04] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-28 12:56:04] [INFO ] Invariant cache hit.
[2024-05-28 12:56:05] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-28 12:56:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 12:56:06] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/166 variables, 80/87 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/166 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 121 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3388 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 86/166 variables, 80/87 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 85/206 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 206 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints]
After SMT, in 7466ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 7468ms
Starting structural reductions in LTL mode, iteration 1 : 80/97 places, 86/109 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7750 ms. Remains : 80/97 places, 86/109 transitions.
[2024-05-28 12:56:12] [INFO ] Flatten gal took : 8 ms
[2024-05-28 12:56:12] [INFO ] Flatten gal took : 8 ms
[2024-05-28 12:56:12] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-28 12:56:12] [INFO ] Flatten gal took : 8 ms
[2024-05-28 12:56:12] [INFO ] Flatten gal took : 8 ms
[2024-05-28 12:56:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality14882599791147936470.gal : 3 ms
[2024-05-28 12:56:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality5995937491238052892.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14882599791147936470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5995937491238052892.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 12:56:42] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:56:42] [INFO ] Applying decomposition
[2024-05-28 12:56:42] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14201858216674529517.txt' '-o' '/tmp/graph14201858216674529517.bin' '-w' '/tmp/graph14201858216674529517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14201858216674529517.bin' '-l' '-1' '-v' '-w' '/tmp/graph14201858216674529517.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:56:42] [INFO ] Decomposing Gal with order
[2024-05-28 12:56:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:56:42] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-28 12:56:42] [INFO ] Flatten gal took : 12 ms
[2024-05-28 12:56:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 4 ms.
[2024-05-28 12:56:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17699496834904145895.gal : 3 ms
[2024-05-28 12:56:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality2211400108663080127.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17699496834904145895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2211400108663080127.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 97/97 places, 109/109 transitions.
Graph (complete) has 305 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 91 transition count 103
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 91 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 91 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 88 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 88 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 21 place count 88 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 86 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 86 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 86 transition count 93
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 27 place count 85 transition count 92
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 84 transition count 90
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 83 transition count 89
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 82 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 82 transition count 88
Applied a total of 34 rules in 27 ms. Remains 82 /97 variables (removed 15) and now considering 88/109 (removed 21) transitions.
// Phase 1: matrix 88 rows 82 cols
[2024-05-28 12:57:12] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 12:57:12] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-28 12:57:12] [INFO ] Invariant cache hit.
[2024-05-28 12:57:12] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 12:57:13] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-28 12:57:13] [INFO ] Redundant transitions in 1 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-28 12:57:13] [INFO ] Invariant cache hit.
[2024-05-28 12:57:13] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-28 12:57:14] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-05-28 12:57:14] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/170 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 125 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 88/170 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 36/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 87/212 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 212 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4905 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
After SMT, in 8993ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 8995ms
Starting structural reductions in SI_CTL mode, iteration 1 : 82/97 places, 88/109 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9432 ms. Remains : 82/97 places, 88/109 transitions.
[2024-05-28 12:57:22] [INFO ] Flatten gal took : 9 ms
[2024-05-28 12:57:22] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:57:22] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-28 12:57:22] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:57:22] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:57:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3434381595627819120.gal : 2 ms
[2024-05-28 12:57:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12160196760462544019.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3434381595627819120.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12160196760462544019.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (8929 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4069 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality12160196760462544019.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 38
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :38 after 125
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :125 after 221
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :221 after 1383
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1383 after 3423
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3423 after 5511
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5511 after 34455
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :34455 after 201925
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :201925 after 1.83913e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.83913e+06 after 1.91783e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.91783e+07 after 2.40992e+08
Interrupted probabilistic random walk after 2548424 steps, run timeout after 3001 ms. (steps per millisecond=849 ) properties seen :0 out of 1
Probabilistic random walk after 2548424 steps, saw 1052277 distinct states, run finished after 3001 ms. (steps per millisecond=849 ) properties seen :0
[2024-05-28 12:57:25] [INFO ] Invariant cache hit.
[2024-05-28 12:57:25] [INFO ] State equation strengthened by 36 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/65 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:57:25] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 3 ms to minimize.
[2024-05-28 12:57:25] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 75/140 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/170 variables, 17/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/170 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/48 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/65 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 75/140 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/170 variables, 17/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/170 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/170 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 82/82 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 468ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 315 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 81 transition count 86
Applied a total of 3 rules in 16 ms. Remains 81 /82 variables (removed 1) and now considering 86/88 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 81/82 places, 86/88 transitions.
RANDOM walk for 4000000 steps (897221 resets) in 6205 ms. (644 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.40992e+08 after 3.09711e+09
BEST_FIRST walk for 4000003 steps (414380 resets) in 2710 ms. (1475 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.09711e+09 after 3.21695e+10
Interrupted probabilistic random walk after 5259658 steps, run timeout after 6001 ms. (steps per millisecond=876 ) properties seen :0 out of 1
Probabilistic random walk after 5259658 steps, saw 2161723 distinct states, run finished after 6001 ms. (steps per millisecond=876 ) properties seen :0
// Phase 1: matrix 86 rows 81 cols
[2024-05-28 12:57:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 12:57:34] [INFO ] State equation strengthened by 34 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 23/167 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/167 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/167 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 228 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 81/81 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-28 12:57:35] [INFO ] Invariant cache hit.
[2024-05-28 12:57:35] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 12:57:35] [INFO ] Invariant cache hit.
[2024-05-28 12:57:35] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-28 12:57:35] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-28 12:57:35] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-28 12:57:35] [INFO ] Invariant cache hit.
[2024-05-28 12:57:35] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3095 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 204 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 8540ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 8541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8886 ms. Remains : 81/81 places, 86/86 transitions.
RANDOM walk for 400000 steps (89452 resets) in 1572 ms. (254 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-28 12:57:44] [INFO ] Invariant cache hit.
[2024-05-28 12:57:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:57:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 12:57:44] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 12:57:44] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-28 12:57:44] [INFO ] After 10ms SMT Verify possible using 34 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 12:57:44] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 12:57:44] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 12:57:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 12:57:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 12:57:44] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 12:57:44] [INFO ] After 10ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 12:57:44] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 12:57:44] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (897823 resets) in 5652 ms. (707 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (414986 resets) in 3070 ms. (1302 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.21695e+10 after 1.03106e+11
Interrupted probabilistic random walk after 5242361 steps, run timeout after 6001 ms. (steps per millisecond=873 ) properties seen :0 out of 1
Probabilistic random walk after 5242361 steps, saw 2154565 distinct states, run finished after 6001 ms. (steps per millisecond=873 ) properties seen :0
[2024-05-28 12:57:53] [INFO ] Invariant cache hit.
[2024-05-28 12:57:53] [INFO ] State equation strengthened by 34 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 23/167 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:57:53] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/144 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/167 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 270ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 186 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-28 12:57:53] [INFO ] Invariant cache hit.
[2024-05-28 12:57:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 12:57:53] [INFO ] Invariant cache hit.
[2024-05-28 12:57:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-28 12:57:53] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-05-28 12:57:53] [INFO ] Redundant transitions in 1 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-28 12:57:53] [INFO ] Invariant cache hit.
[2024-05-28 12:57:53] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2074 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 204 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4427 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 6563ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 6564ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6835 ms. Remains : 81/81 places, 86/86 transitions.
RANDOM walk for 400000 steps (89550 resets) in 498 ms. (801 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-28 12:58:00] [INFO ] Invariant cache hit.
[2024-05-28 12:58:00] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 12:58:00] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 12:58:00] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 12:58:00] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-28 12:58:00] [INFO ] After 10ms SMT Verify possible using 34 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 12:58:00] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 12:58:00] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 12:58:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 12:58:00] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 12:58:00] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 12:58:00] [INFO ] After 13ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 12:58:00] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 12:58:00] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (9008 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4057 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2606019 steps, run timeout after 3001 ms. (steps per millisecond=868 ) properties seen :0 out of 1
Probabilistic random walk after 2606019 steps, saw 1075540 distinct states, run finished after 3001 ms. (steps per millisecond=868 ) properties seen :0
[2024-05-28 12:58:03] [INFO ] Invariant cache hit.
[2024-05-28 12:58:03] [INFO ] State equation strengthened by 34 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 23/167 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:58:03] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/144 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/167 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 186 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 81/81 places, 86/86 transitions.
RANDOM walk for 40000 steps (8995 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4270 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2712872 steps, run timeout after 3001 ms. (steps per millisecond=903 ) properties seen :0 out of 1
Probabilistic random walk after 2712872 steps, saw 1119696 distinct states, run finished after 3001 ms. (steps per millisecond=903 ) properties seen :0
[2024-05-28 12:58:07] [INFO ] Invariant cache hit.
[2024-05-28 12:58:07] [INFO ] State equation strengthened by 34 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/144 variables, 15/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 23/167 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 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) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/52 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/116 variables, 54/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 12:58:07] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/144 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/167 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/167 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 184 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 81/81 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-28 12:58:07] [INFO ] Invariant cache hit.
[2024-05-28 12:58:07] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 12:58:07] [INFO ] Invariant cache hit.
[2024-05-28 12:58:07] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-28 12:58:07] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-28 12:58:08] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-28 12:58:08] [INFO ] Invariant cache hit.
[2024-05-28 12:58:08] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 119 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 86/167 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 34/119 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 85/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 204 constraints, problems are : Problem set: 0 solved, 85 unsolved in 4326 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 6460ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 6461ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6727 ms. Remains : 81/81 places, 86/86 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 81 transition count 79
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 76 transition count 79
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 12 place count 76 transition count 66
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 63 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 57 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 57 transition count 60
Applied a total of 51 rules in 12 ms. Remains 57 /81 variables (removed 24) and now considering 60/86 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 57 cols
[2024-05-28 12:58:14] [INFO ] Computed 6 invariants in 2 ms
[2024-05-28 12:58:14] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-28 12:58:14] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 12:58:14] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 12:58:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 12:58:14] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 12:58:14] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 12:58:14] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-05-28 12:58:14] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-28 12:58:14] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-28 12:58:14] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
[2024-05-28 12:58:14] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-28 12:58:14] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:58:14] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-28 12:58:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 302 ms
TRAPS : Iteration 1
[2024-05-28 12:58:14] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 12:58:14] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 456 ms.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 81 transition count 79
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 76 transition count 79
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 12 place count 76 transition count 66
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 38 place count 63 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 57 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 57 transition count 60
Applied a total of 51 rules in 13 ms. Remains 57 /81 variables (removed 24) and now considering 60/86 (removed 26) transitions.
Running SMT prover for 1 properties.
[2024-05-28 12:58:14] [INFO ] Invariant cache hit.
[2024-05-28 12:58:14] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-28 12:58:14] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 12:58:15] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 12:58:15] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-05-28 12:58:15] [INFO ] After 83ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 12:58:15] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 12:58:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-28 12:58:15] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 12:58:15] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 12:58:15] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
[2024-05-28 12:58:15] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-28 12:58:15] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-28 12:58:15] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-28 12:58:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 176 ms
TRAPS : Iteration 1
[2024-05-28 12:58:15] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 12:58:15] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-28 12:58:15] [INFO ] Flatten gal took : 5 ms
[2024-05-28 12:58:15] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:58:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1125953316746712525.gal : 2 ms
[2024-05-28 12:58:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality223514461315131810.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1125953316746712525.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality223514461315131810.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality223514461315131810.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 168
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :168 after 228
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :228 after 683
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :683 after 2789
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2789 after 15865
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :15865 after 129192
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :129192 after 1.5165e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.5165e+06 after 4.49143e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.49143e+06 after 5.28841e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.35152e+09 after 2.37658e+09
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.53087e+09,4.01896,77636,2,13376,19,331224,7,0,291,293285,0
Total reachable state count : 2530871103

Verifying 1 reachability properties.
Invariant property SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-10 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-10,7324,4.02069,77636,2,1436,19,331224,7,0,293,293285,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 4453 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 12:58:19] [INFO ] Flatten gal took : 4 ms
[2024-05-28 12:58:19] [INFO ] Applying decomposition
[2024-05-28 12:58:19] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4763601346546815925.txt' '-o' '/tmp/graph4763601346546815925.bin' '-w' '/tmp/graph4763601346546815925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4763601346546815925.bin' '-l' '-1' '-v' '-w' '/tmp/graph4763601346546815925.weights' '-q' '0' '-e' '0.001'
[2024-05-28 12:58:19] [INFO ] Decomposing Gal with order
[2024-05-28 12:58:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 12:58:19] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-28 12:58:19] [INFO ] Flatten gal took : 12 ms
[2024-05-28 12:58:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 5 ms.
[2024-05-28 12:58:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2413701935748437252.gal : 3 ms
[2024-05-28 12:58:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3759973557637164028.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2413701935748437252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3759973557637164028.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3759973557637164028.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 201
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5811 after 6655
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :171191 after 280457
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.82314e+06 after 7.08386e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.84541e+08 after 4.64297e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.26281e+10 after 3.2649e+10
Detected timeout of ITS tools.
[2024-05-28 13:08:19] [INFO ] Flatten gal took : 9 ms
[2024-05-28 13:08:19] [INFO ] Flatten gal took : 7 ms
[2024-05-28 13:08:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality5455364419447363020.gal : 8 ms
[2024-05-28 13:08:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality2514459817734823716.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5455364419447363020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2514459817734823716.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:08:49] [INFO ] Flatten gal took : 4 ms
[2024-05-28 13:08:49] [INFO ] Applying decomposition
[2024-05-28 13:08:49] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13788316741234441832.txt' '-o' '/tmp/graph13788316741234441832.bin' '-w' '/tmp/graph13788316741234441832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13788316741234441832.bin' '-l' '-1' '-v' '-w' '/tmp/graph13788316741234441832.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:08:49] [INFO ] Decomposing Gal with order
[2024-05-28 13:08:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:08:49] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-28 13:08:49] [INFO ] Flatten gal took : 10 ms
[2024-05-28 13:08:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 47 labels/synchronizations in 4 ms.
[2024-05-28 13:08:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality11439217085111665116.gal : 2 ms
[2024-05-28 13:08:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality11637291398221763081.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11439217085111665116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11637291398221763081.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:09:19] [INFO ] Flatten gal took : 5 ms
[2024-05-28 13:09:19] [INFO ] Flatten gal took : 4 ms
[2024-05-28 13:09:19] [INFO ] Applying decomposition
[2024-05-28 13:09:19] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2064816733614801193.txt' '-o' '/tmp/graph2064816733614801193.bin' '-w' '/tmp/graph2064816733614801193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2064816733614801193.bin' '-l' '-1' '-v' '-w' '/tmp/graph2064816733614801193.weights' '-q' '0' '-e' '0.001'
[2024-05-28 13:09:19] [INFO ] Decomposing Gal with order
[2024-05-28 13:09:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 13:09:19] [INFO ] Removed a total of 107 redundant transitions.
[2024-05-28 13:09:19] [INFO ] Flatten gal took : 12 ms
[2024-05-28 13:09:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 4 ms.
[2024-05-28 13:09:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality17814056223461291157.gal : 2 ms
[2024-05-28 13:09:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality13826095104878230872.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17814056223461291157.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13826095104878230872.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 13:34:46] [INFO ] Flatten gal took : 5 ms
[2024-05-28 13:34:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality3822080852737060439.gal : 2 ms
[2024-05-28 13:34:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality9339505336016363655.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3822080852737060439.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9339505336016363655.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.00042e+14,132.163,1519652,2,27860,5,7.57318e+06,6,0,494,8.36791e+06,0


Converting to forward existential form...Done !
original formula: EX(EX(EG(AX(FALSE))))
=> equivalent forward existential formula: [FwdG(EY(EY(Init)),!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t18, t22, t30, t31, t35, t44, t45, t46, t58, t59, t71, t81, t82, t83, t84, t85, t86, ...324
(forward)formula 0,1,145.942,1519652,1,0,249,7.57318e+06,239,100,3731,8.36791e+06,276
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: EF(AG(AF((l25<=0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!((l25<=0))))))))] != FALSE
(forward)formula 1,1,146.062,1519652,1,0,311,7.57318e+06,250,136,3807,8.36791e+06,381
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: E(AG(EF(AX((l920<=0)))) U AX(AX(EF((s2<=0)))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(E(TRUE U !(EX(!((l920<=0))))))))) * !(EX(!(!(EX(!(E(TRUE U (s2<=0)))))))))] != FALSE
(forward)formula 2,1,244.875,1909292,1,0,331,9.27197e+06,254,149,3899,9.77438e+06,411
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

original formula: AG((l969<29))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !((l969<29)))] = FALSE
(forward)formula 3,0,244.952,1910084,1,0,334,9.27421e+06,256,151,3901,9.77993e+06,412
FORMULA SieveSingleMsgMbox-PT-d1m36-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Total runtime 2751729 ms.

BK_STOP 1716903531752

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m36"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m36, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683810700073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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