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.r356-tall-171683760700281.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 ShieldIIPt-PT-020B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760700281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 20:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K 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 ShieldIIPt-PT-020B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPt-PT-020B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716932880197

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 21:48:01] [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 21:48:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:48:01] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-28 21:48:01] [INFO ] Transformed 1403 places.
[2024-05-28 21:48:01] [INFO ] Transformed 1303 transitions.
[2024-05-28 21:48:01] [INFO ] Found NUPN structural information;
[2024-05-28 21:48:01] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
FORMULA ShieldIIPt-PT-020B-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 96 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 202 places :
Symmetric choice reduction at 0 with 202 rule applications. Total rules 202 place count 1201 transition count 1101
Iterating global reduction 0 with 202 rules applied. Total rules applied 404 place count 1201 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 405 place count 1200 transition count 1100
Iterating global reduction 0 with 1 rules applied. Total rules applied 406 place count 1200 transition count 1100
Applied a total of 406 rules in 368 ms. Remains 1200 /1403 variables (removed 203) and now considering 1100/1303 (removed 203) transitions.
// Phase 1: matrix 1100 rows 1200 cols
[2024-05-28 21:48:02] [INFO ] Computed 181 invariants in 27 ms
[2024-05-28 21:48:02] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-28 21:48:02] [INFO ] Invariant cache hit.
[2024-05-28 21:48:03] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
Running 1099 sub problems to find dead transitions.
[2024-05-28 21:48:03] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
SMT process timed out in 30250ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30273ms
Starting structural reductions in LTL mode, iteration 1 : 1200/1403 places, 1100/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32039 ms. Remains : 1200/1403 places, 1100/1303 transitions.
Support contains 96 out of 1200 places after structural reductions.
[2024-05-28 21:48:33] [INFO ] Flatten gal took : 95 ms
[2024-05-28 21:48:34] [INFO ] Flatten gal took : 53 ms
[2024-05-28 21:48:34] [INFO ] Input system was already deterministic with 1100 transitions.
Support contains 94 out of 1200 places (down from 96) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2171 ms. (18 steps per ms) remains 17/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
[2024-05-28 21:48:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 314/343 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 857/1200 variables, 144/181 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1200 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1100/2300 variables, 1200/1381 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2300 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/2300 variables, 0/1381 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2300/2300 variables, and 1381 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2290 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1200/1200 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 314/343 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 857/1200 variables, 144/181 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-28 21:48:38] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 26 ms to minimize.
[2024-05-28 21:48:38] [INFO ] Deduced a trap composed of 27 places in 167 ms of which 3 ms to minimize.
[2024-05-28 21:48:38] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 4 ms to minimize.
[2024-05-28 21:48:38] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 11 ms to minimize.
[2024-05-28 21:48:38] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-28 21:48:38] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 3 ms to minimize.
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 2 ms to minimize.
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 8 ms to minimize.
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 2 ms to minimize.
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:48:39] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 2 ms to minimize.
[2024-05-28 21:48:40] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-28 21:48:40] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-28 21:48:40] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-05-28 21:48:40] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1200 variables, 16/197 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1200 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1100/2300 variables, 1200/1397 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2300 variables, 17/1414 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-28 21:48:41] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 4 ms to minimize.
[2024-05-28 21:48:41] [INFO ] Deduced a trap composed of 33 places in 201 ms of which 5 ms to minimize.
[2024-05-28 21:48:42] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 4 ms to minimize.
[2024-05-28 21:48:42] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2300/2300 variables, and 1418 constraints, problems are : Problem set: 0 solved, 17 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1200/1200 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 20/20 constraints]
After SMT, in 7316ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 1200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1200/1200 places, 1100/1100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 219 place count 1200 transition count 881
Reduce places removed 219 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 224 rules applied. Total rules applied 443 place count 981 transition count 876
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 448 place count 976 transition count 876
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 448 place count 976 transition count 728
Deduced a syphon composed of 148 places in 1 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 744 place count 828 transition count 728
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 752 place count 820 transition count 720
Iterating global reduction 3 with 8 rules applied. Total rules applied 760 place count 820 transition count 720
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 760 place count 820 transition count 713
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 774 place count 813 transition count 713
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 1450 place count 475 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1451 place count 475 transition count 374
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1453 place count 474 transition count 373
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1559 place count 421 transition count 400
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1560 place count 421 transition count 399
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1561 place count 421 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1562 place count 420 transition count 398
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 1580 place count 420 transition count 398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1581 place count 419 transition count 397
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1583 place count 417 transition count 397
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1583 place count 417 transition count 396
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1585 place count 416 transition count 396
Applied a total of 1585 rules in 262 ms. Remains 416 /1200 variables (removed 784) and now considering 396/1100 (removed 704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 416/1200 places, 396/1100 transitions.
RANDOM walk for 40000 steps (8 resets) in 757 ms. (52 steps per ms) remains 5/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
// Phase 1: matrix 396 rows 416 cols
[2024-05-28 21:48:43] [INFO ] Computed 179 invariants in 2 ms
[2024-05-28 21:48:43] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/52 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 70/122 variables, 52/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 124/246 variables, 60/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 24/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 9/255 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 10/265 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/265 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 142/407 variables, 82/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/407 variables, 23/284 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/407 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 10/417 variables, 9/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/417 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/417 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 17/434 variables, 8/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/434 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 103/537 variables, 65/371 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/537 variables, 17/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/537 variables, 7/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/537 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 4/541 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/541 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/541 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 6/547 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/547 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 78/625 variables, 41/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/625 variables, 13/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/625 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/625 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 6/631 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/631 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/631 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 3/634 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/634 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/634 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 78/712 variables, 42/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/712 variables, 12/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/712 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 8/720 variables, 6/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/720 variables, 4/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/720 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 6/726 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/726 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 51/777 variables, 34/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/777 variables, 11/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/777 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 1/778 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/778 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/778 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 2/780 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/780 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 22/802 variables, 14/599 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/802 variables, 5/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/802 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 1/803 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/803 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/803 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 2/805 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/805 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (OVERLAPS) 7/812 variables, 6/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/812 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/812 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 0/812 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 615 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 416/416 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/52 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 70/122 variables, 52/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 21:48:44] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 124/246 variables, 60/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 24/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 21:48:44] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-28 21:48:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 9/255 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/255 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 21:48:44] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/255 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/255 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 10/265 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/265 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 142/407 variables, 82/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/407 variables, 23/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/407 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/407 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 10/417 variables, 9/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/417 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/417 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 17/434 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/434 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 103/537 variables, 65/379 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/537 variables, 17/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/537 variables, 7/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/537 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 4/541 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/541 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/541 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 6/547 variables, 3/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/547 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 78/625 variables, 41/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/625 variables, 13/468 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/625 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/625 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 6/631 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/631 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/631 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 3/634 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/634 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/634 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 78/712 variables, 42/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/712 variables, 12/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/712 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 8/720 variables, 6/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/720 variables, 4/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/720 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 6/726 variables, 3/545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/726 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 51/777 variables, 34/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/777 variables, 11/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/777 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 1/778 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/778 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/778 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 2/780 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/780 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 22/802 variables, 14/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/802 variables, 5/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/802 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (OVERLAPS) 1/803 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/803 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/803 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 2/805 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/805 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 7/812 variables, 6/621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/812 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/812 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (OVERLAPS) 0/812 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 623 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1518 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 416/416 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 2589ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 316 ms.
Support contains 9 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 396/396 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 5 rules applied. Total rules applied 5 place count 416 transition count 391
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 411 transition count 391
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 10 place count 411 transition count 383
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 403 transition count 383
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 395 transition count 375
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 391 transition count 382
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 388 transition count 379
Applied a total of 53 rules in 56 ms. Remains 388 /416 variables (removed 28) and now considering 379/396 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 388/416 places, 379/396 transitions.
RANDOM walk for 40000 steps (8 resets) in 334 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 252870 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 4
Probabilistic random walk after 252870 steps, saw 160713 distinct states, run finished after 3004 ms. (steps per millisecond=84 ) properties seen :0
// Phase 1: matrix 379 rows 388 cols
[2024-05-28 21:48:49] [INFO ] Computed 179 invariants in 2 ms
[2024-05-28 21:48:49] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/52 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 72/124 variables, 52/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 122/246 variables, 60/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 29/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/247 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/249 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 134/383 variables, 69/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/383 variables, 27/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/383 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 4/387 variables, 6/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/387 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/387 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 4/391 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/391 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 106/497 variables, 54/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/497 variables, 21/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/497 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 4/501 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/501 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/501 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 8/509 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/509 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 81/590 variables, 46/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/590 variables, 17/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/590 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/590 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 2/592 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/592 variables, 2/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/592 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 3/595 variables, 2/440 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/595 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/595 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 76/671 variables, 38/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/671 variables, 15/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/671 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 3/674 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/674 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/674 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 6/680 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/680 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 52/732 variables, 32/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/732 variables, 12/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/732 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 1/733 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/733 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/733 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 2/735 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/735 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 22/757 variables, 14/564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/757 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/757 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (OVERLAPS) 1/758 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/758 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/758 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 2/760 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/760 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 7/767 variables, 6/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/767 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/767 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 0/767 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 767/767 variables, and 580 constraints, problems are : Problem set: 0 solved, 4 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 388/388 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/52 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 21:48:50] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 72/124 variables, 52/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 122/246 variables, 60/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 29/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 21:48:50] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:48:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-28 21:48:50] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/247 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/249 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/249 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 134/383 variables, 69/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/383 variables, 27/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/383 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 4/387 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/387 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/387 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 4/391 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/391 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 106/497 variables, 54/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/497 variables, 21/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/497 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 4/501 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/501 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/501 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 8/509 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/509 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 81/590 variables, 46/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/590 variables, 17/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/590 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/590 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 2/592 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/592 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/592 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 3/595 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/595 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/595 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 76/671 variables, 38/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/671 variables, 15/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/671 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 3/674 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/674 variables, 3/508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/674 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 6/680 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/680 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 52/732 variables, 32/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/732 variables, 12/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/732 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 1/733 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/733 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/733 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 2/735 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/735 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 22/757 variables, 14/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/757 variables, 5/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/757 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 1/758 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/758 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/758 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (OVERLAPS) 2/760 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/760 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 7/767 variables, 6/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/767 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/767 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 0/767 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 767/767 variables, and 588 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 388/388 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 2308ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 307 ms.
Support contains 9 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 379/379 transitions.
Applied a total of 0 rules in 21 ms. Remains 388 /388 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 388/388 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 379/379 transitions.
Applied a total of 0 rules in 11 ms. Remains 388 /388 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2024-05-28 21:48:52] [INFO ] Invariant cache hit.
[2024-05-28 21:48:52] [INFO ] Implicit Places using invariants in 218 ms returned [377]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 228 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 387/388 places, 379/379 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 386 transition count 378
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 386 transition count 378
Applied a total of 2 rules in 17 ms. Remains 386 /387 variables (removed 1) and now considering 378/379 (removed 1) transitions.
// Phase 1: matrix 378 rows 386 cols
[2024-05-28 21:48:52] [INFO ] Computed 178 invariants in 1 ms
[2024-05-28 21:48:52] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-28 21:48:52] [INFO ] Invariant cache hit.
[2024-05-28 21:48:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-28 21:48:53] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 386/388 places, 378/379 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 874 ms. Remains : 386/388 places, 378/379 transitions.
RANDOM walk for 40000 steps (8 resets) in 334 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 264415 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 4
Probabilistic random walk after 264415 steps, saw 168344 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-28 21:48:56] [INFO ] Invariant cache hit.
[2024-05-28 21:48:56] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/52 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 72/124 variables, 52/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 122/246 variables, 60/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 29/169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/247 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/249 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 134/383 variables, 69/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/383 variables, 27/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/383 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 4/387 variables, 6/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/387 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/387 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 4/391 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/391 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 106/497 variables, 54/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/497 variables, 21/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/497 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 4/501 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/501 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/501 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 8/509 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/509 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 80/589 variables, 46/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/589 variables, 18/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/589 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 1/590 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/590 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/590 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 2/592 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/592 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 76/668 variables, 38/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/668 variables, 15/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/668 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 3/671 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/671 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/671 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 6/677 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/677 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 52/729 variables, 32/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/729 variables, 12/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/729 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 1/730 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/730 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/730 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 2/732 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/732 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 22/754 variables, 14/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/754 variables, 5/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/754 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 1/755 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/755 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/755 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 2/757 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/757 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 7/764 variables, 6/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/764 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/764 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 0/764 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 576 constraints, problems are : Problem set: 0 solved, 4 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 386/386 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/48 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/52 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 21:48:57] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 72/124 variables, 52/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 122/246 variables, 60/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 29/172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 21:48:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-28 21:48:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-28 21:48:57] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/247 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/249 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/249 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 134/383 variables, 69/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/383 variables, 27/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/383 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 4/387 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/387 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/387 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 4/391 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/391 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 106/497 variables, 54/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/497 variables, 21/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/497 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 4/501 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/501 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/501 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 8/509 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/509 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 80/589 variables, 46/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/589 variables, 18/442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/589 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 1/590 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/590 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/590 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 2/592 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/592 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 76/668 variables, 38/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/668 variables, 15/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/668 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 3/671 variables, 3/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/671 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/671 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 6/677 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/677 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 52/729 variables, 32/539 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/729 variables, 12/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/729 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 1/730 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/730 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/730 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 2/732 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/732 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 22/754 variables, 14/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/754 variables, 5/573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/754 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 1/755 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/755 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/755 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 2/757 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/757 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (OVERLAPS) 7/764 variables, 6/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/764 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/764 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 0/764 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 584 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1334 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 386/386 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 2258ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 441 ms.
Support contains 9 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 378/378 transitions.
Applied a total of 0 rules in 9 ms. Remains 386 /386 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 386/386 places, 378/378 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 378/378 transitions.
Applied a total of 0 rules in 11 ms. Remains 386 /386 variables (removed 0) and now considering 378/378 (removed 0) transitions.
[2024-05-28 21:48:59] [INFO ] Invariant cache hit.
[2024-05-28 21:48:59] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-28 21:48:59] [INFO ] Invariant cache hit.
[2024-05-28 21:48:59] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-28 21:48:59] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2024-05-28 21:48:59] [INFO ] Redundant transitions in 21 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-28 21:48:59] [INFO ] Invariant cache hit.
[2024-05-28 21:48:59] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 168/168 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 2/386 variables, 10/178 constraints. Problems are: Problem set: 0 solved, 373 unsolved
[2024-05-28 21:49:04] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-05-28 21:49:04] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 378/764 variables, 386/566 constraints. Problems are: Problem set: 0 solved, 373 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 12/578 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 8 (OVERLAPS) 0/764 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 578 constraints, problems are : Problem set: 0 solved, 373 unsolved in 18786 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 386/386 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 168/168 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (OVERLAPS) 2/386 variables, 10/180 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (OVERLAPS) 378/764 variables, 386/566 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 12/578 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 373/951 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 9 (OVERLAPS) 0/764 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 951 constraints, problems are : Problem set: 0 solved, 373 unsolved in 23504 ms.
Refiners :[Positive P Invariants (semi-flows): 178/178 constraints, State Equation: 386/386 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 2/2 constraints]
After SMT, in 42358ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 42362ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43077 ms. Remains : 386/386 places, 378/378 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 386 transition count 378
Applied a total of 42 rules in 21 ms. Remains 386 /386 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 378 rows 386 cols
[2024-05-28 21:49:42] [INFO ] Computed 178 invariants in 4 ms
[2024-05-28 21:49:42] [INFO ] [Real]Absence check using 178 positive place invariants in 21 ms returned sat
[2024-05-28 21:49:42] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-28 21:49:42] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-28 21:49:42] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-28 21:49:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-28 21:49:42] [INFO ] After 92ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-28 21:49:42] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-28 21:49:42] [INFO ] After 559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 710 ms.
[2024-05-28 21:49:42] [INFO ] Flatten gal took : 37 ms
[2024-05-28 21:49:42] [INFO ] Flatten gal took : 40 ms
[2024-05-28 21:49:43] [INFO ] Input system was already deterministic with 1100 transitions.
Computed a total of 322 stabilizing places and 322 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1200/1200 places, 1100/1100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1199 transition count 859
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 959 transition count 858
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 958 transition count 858
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 152 Pre rules applied. Total rules applied 482 place count 958 transition count 706
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 786 place count 806 transition count 706
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 799 place count 793 transition count 693
Iterating global reduction 3 with 13 rules applied. Total rules applied 812 place count 793 transition count 693
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 812 place count 793 transition count 683
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 832 place count 783 transition count 683
Performed 319 Post agglomeration using F-continuation condition.Transition count delta: 319
Deduced a syphon composed of 319 places in 0 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1470 place count 464 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1471 place count 464 transition count 363
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1473 place count 463 transition count 362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1475 place count 461 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1477 place count 459 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1477 place count 459 transition count 359
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1479 place count 458 transition count 359
Applied a total of 1479 rules in 110 ms. Remains 458 /1200 variables (removed 742) and now considering 359/1100 (removed 741) transitions.
// Phase 1: matrix 359 rows 458 cols
[2024-05-28 21:49:43] [INFO ] Computed 179 invariants in 1 ms
[2024-05-28 21:49:43] [INFO ] Implicit Places using invariants in 461 ms returned [444]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 463 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 457/1200 places, 359/1100 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 456 transition count 358
Applied a total of 2 rules in 14 ms. Remains 456 /457 variables (removed 1) and now considering 358/359 (removed 1) transitions.
// Phase 1: matrix 358 rows 456 cols
[2024-05-28 21:49:43] [INFO ] Computed 178 invariants in 1 ms
[2024-05-28 21:49:43] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-28 21:49:43] [INFO ] Invariant cache hit.
[2024-05-28 21:49:44] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 456/1200 places, 358/1100 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1075 ms. Remains : 456/1200 places, 358/1100 transitions.
[2024-05-28 21:49:44] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:49:44] [INFO ] Flatten gal took : 15 ms
[2024-05-28 21:49:44] [INFO ] Input system was already deterministic with 358 transitions.
[2024-05-28 21:49:44] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:49:44] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:49:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality131681710946400962.gal : 8 ms
[2024-05-28 21:49:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality1448350662665219567.ctl : 2 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/CTLCardinality131681710946400962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1448350662665219567.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 -...282
No direction supplied, using forward translation only.
Parsed 1 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,2.38359e+69,0.538133,22432,2,1678,5,80589,6,0,2184,112367,0


Converting to forward existential form...Done !
original formula: EG((p254==0))
=> equivalent forward existential formula: [FwdG(Init,(p254==0))] != FALSE
Hit Full ! (commute/partial/dont) 356/0/2
(forward)formula 0,1,2.04649,64420,1,0,9,427362,19,3,10900,112367,8
FORMULA ShieldIIPt-PT-020B-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1100/1100 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1182 transition count 1082
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1182 transition count 1082
Applied a total of 36 rules in 60 ms. Remains 1182 /1200 variables (removed 18) and now considering 1082/1100 (removed 18) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-28 21:49:46] [INFO ] Computed 181 invariants in 13 ms
[2024-05-28 21:49:46] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-05-28 21:49:46] [INFO ] Invariant cache hit.
[2024-05-28 21:49:47] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Running 1081 sub problems to find dead transitions.
[2024-05-28 21:49:47] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
SMT process timed out in 30169ms, After SMT, problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 30180ms
Starting structural reductions in LTL mode, iteration 1 : 1182/1200 places, 1082/1100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31397 ms. Remains : 1182/1200 places, 1082/1100 transitions.
[2024-05-28 21:50:17] [INFO ] Flatten gal took : 30 ms
[2024-05-28 21:50:17] [INFO ] Flatten gal took : 26 ms
[2024-05-28 21:50:17] [INFO ] Input system was already deterministic with 1082 transitions.
[2024-05-28 21:50:17] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:50:17] [INFO ] Flatten gal took : 26 ms
[2024-05-28 21:50:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality3599760699843073874.gal : 7 ms
[2024-05-28 21:50:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality4037499172221060055.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/CTLCardinality3599760699843073874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4037499172221060055.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 21:50:48] [INFO ] Flatten gal took : 35 ms
[2024-05-28 21:50:48] [INFO ] Applying decomposition
[2024-05-28 21:50:48] [INFO ] Flatten gal took : 26 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/graph8245615081086348776.txt' '-o' '/tmp/graph8245615081086348776.bin' '-w' '/tmp/graph8245615081086348776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8245615081086348776.bin' '-l' '-1' '-v' '-w' '/tmp/graph8245615081086348776.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:50:48] [INFO ] Decomposing Gal with order
[2024-05-28 21:50:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:50:48] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-28 21:50:48] [INFO ] Flatten gal took : 87 ms
[2024-05-28 21:50:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-28 21:50:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality6809194262180685864.gal : 17 ms
[2024-05-28 21:50:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality10726389238539424158.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/CTLCardinality6809194262180685864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10726389238539424158.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 : 1200/1200 places, 1100/1100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 233 place count 1199 transition count 866
Reduce places removed 233 places and 0 transitions.
Iterating post reduction 1 with 233 rules applied. Total rules applied 466 place count 966 transition count 866
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 466 place count 966 transition count 713
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 772 place count 813 transition count 713
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 784 place count 801 transition count 701
Iterating global reduction 2 with 12 rules applied. Total rules applied 796 place count 801 transition count 701
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 796 place count 801 transition count 691
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 816 place count 791 transition count 691
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Deduced a syphon composed of 318 places in 0 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1452 place count 473 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1453 place count 473 transition count 372
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1455 place count 472 transition count 371
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1457 place count 470 transition count 369
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1459 place count 468 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1459 place count 468 transition count 368
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1461 place count 467 transition count 368
Applied a total of 1461 rules in 113 ms. Remains 467 /1200 variables (removed 733) and now considering 368/1100 (removed 732) transitions.
// Phase 1: matrix 368 rows 467 cols
[2024-05-28 21:51:18] [INFO ] Computed 179 invariants in 1 ms
[2024-05-28 21:51:19] [INFO ] Implicit Places using invariants in 394 ms returned [453]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 395 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 466/1200 places, 368/1100 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 465 transition count 367
Applied a total of 2 rules in 13 ms. Remains 465 /466 variables (removed 1) and now considering 367/368 (removed 1) transitions.
// Phase 1: matrix 367 rows 465 cols
[2024-05-28 21:51:19] [INFO ] Computed 178 invariants in 1 ms
[2024-05-28 21:51:19] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-28 21:51:19] [INFO ] Invariant cache hit.
[2024-05-28 21:51:19] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 465/1200 places, 367/1100 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1177 ms. Remains : 465/1200 places, 367/1100 transitions.
[2024-05-28 21:51:19] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:51:19] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:51:19] [INFO ] Input system was already deterministic with 367 transitions.
[2024-05-28 21:51:19] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:51:19] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:51:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16714356783651643334.gal : 3 ms
[2024-05-28 21:51:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality14952050703849513035.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/CTLCardinality16714356783651643334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14952050703849513035.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 -...285
No direction supplied, using forward translation only.
Parsed 1 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,1.4553e+70,0.527057,22916,2,1887,5,84000,6,0,2227,115054,0


Converting to forward existential form...Done !
original formula: AF(((p259==1) * ((AG(((p714==0)&&(p941==1))) + (p957==0)) + (EF((p960==0)) * ((p269==0)||((p688==0)&&(p568==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((p259==1) * ((!(E(TRUE U !(((p714==0)&&(p941==1))))) + (p957==0)) + (E(TRUE U (p960==0)) * ((p269=...197
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t20, t23, t86, t89, t91, t94, t96, t99...575
Detected timeout of ITS tools.
[2024-05-28 21:51:49] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:51:49] [INFO ] Applying decomposition
[2024-05-28 21:51:49] [INFO ] Flatten gal took : 9 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/graph8346031476340573638.txt' '-o' '/tmp/graph8346031476340573638.bin' '-w' '/tmp/graph8346031476340573638.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8346031476340573638.bin' '-l' '-1' '-v' '-w' '/tmp/graph8346031476340573638.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:51:49] [INFO ] Decomposing Gal with order
[2024-05-28 21:51:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:51:49] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-28 21:51:50] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:51:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 21:51:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality6872201595123258796.gal : 12 ms
[2024-05-28 21:51:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality10307564591516994510.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/CTLCardinality6872201595123258796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10307564591516994510.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.
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,1.4553e+70,0.537965,25344,230,22,44457,189,592,106779,42,1001,0


Converting to forward existential form...Done !
original formula: AF(((i3.i0.u30.p259==1) * ((AG(((i10.u85.p714==0)&&(i14.i3.u113.p941==1))) + (i13.i3.u116.p957==0)) + (EF((i13.i3.u115.p960==0)) * ((i3.i...218
=> equivalent forward existential formula: [FwdG(Init,!(((i3.i0.u30.p259==1) * ((!(E(TRUE U !(((i10.u85.p714==0)&&(i14.i3.u113.p941==1))))) + (i13.i3.u116....281
Reverse transition relation is NOT exact ! Due to transitions t328, t331, t337, t343, i0.i0.u7.t91, i0.i1.u2.t0, i0.i1.u6.t89, i0.i2.u8.t94, i0.i3.u5.t86, ...1266
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1200/1200 places, 1100/1100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1199 transition count 859
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 959 transition count 859
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 480 place count 959 transition count 708
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 782 place count 808 transition count 708
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 795 place count 795 transition count 695
Iterating global reduction 2 with 13 rules applied. Total rules applied 808 place count 795 transition count 695
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 808 place count 795 transition count 685
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 828 place count 785 transition count 685
Performed 321 Post agglomeration using F-continuation condition.Transition count delta: 321
Deduced a syphon composed of 321 places in 0 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 2 with 642 rules applied. Total rules applied 1470 place count 464 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1471 place count 464 transition count 363
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1473 place count 463 transition count 362
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1474 place count 463 transition count 362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1476 place count 461 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1478 place count 459 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1478 place count 459 transition count 359
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1480 place count 458 transition count 359
Applied a total of 1480 rules in 112 ms. Remains 458 /1200 variables (removed 742) and now considering 359/1100 (removed 741) transitions.
// Phase 1: matrix 359 rows 458 cols
[2024-05-28 21:52:20] [INFO ] Computed 179 invariants in 2 ms
[2024-05-28 21:52:20] [INFO ] Implicit Places using invariants in 211 ms returned [444]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 212 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 457/1200 places, 359/1100 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 456 transition count 358
Applied a total of 2 rules in 12 ms. Remains 456 /457 variables (removed 1) and now considering 358/359 (removed 1) transitions.
// Phase 1: matrix 358 rows 456 cols
[2024-05-28 21:52:20] [INFO ] Computed 178 invariants in 2 ms
[2024-05-28 21:52:20] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-28 21:52:20] [INFO ] Invariant cache hit.
[2024-05-28 21:52:20] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 456/1200 places, 358/1100 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 861 ms. Remains : 456/1200 places, 358/1100 transitions.
[2024-05-28 21:52:20] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:52:20] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:52:21] [INFO ] Input system was already deterministic with 358 transitions.
[2024-05-28 21:52:21] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:52:21] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:52:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality11547813594101824369.gal : 1 ms
[2024-05-28 21:52:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality1234747053712662146.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/CTLCardinality11547813594101824369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1234747053712662146.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.
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,3.85227e+69,0.403228,18300,2,1510,5,64229,6,0,2185,83692,0


Converting to forward existential form...Done !
original formula: AG(AF(((p408==0)&&(p815==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p408==0)&&(p815==1))))] = FALSE
Hit Full ! (commute/partial/dont) 353/0/5
(forward)formula 0,0,1.55794,53740,1,0,9,369610,20,3,10898,83692,8
FORMULA ShieldIIPt-PT-020B-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1100/1100 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1185 transition count 1085
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1185 transition count 1085
Applied a total of 30 rules in 71 ms. Remains 1185 /1200 variables (removed 15) and now considering 1085/1100 (removed 15) transitions.
// Phase 1: matrix 1085 rows 1185 cols
[2024-05-28 21:52:22] [INFO ] Computed 181 invariants in 4 ms
[2024-05-28 21:52:22] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-28 21:52:22] [INFO ] Invariant cache hit.
[2024-05-28 21:52:23] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
Running 1084 sub problems to find dead transitions.
[2024-05-28 21:52:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
SMT process timed out in 30155ms, After SMT, problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 30166ms
Starting structural reductions in LTL mode, iteration 1 : 1185/1200 places, 1085/1100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31289 ms. Remains : 1185/1200 places, 1085/1100 transitions.
[2024-05-28 21:52:53] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:52:53] [INFO ] Flatten gal took : 21 ms
[2024-05-28 21:52:53] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-28 21:52:54] [INFO ] Flatten gal took : 21 ms
[2024-05-28 21:52:54] [INFO ] Flatten gal took : 22 ms
[2024-05-28 21:52:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality11245314791930800388.gal : 5 ms
[2024-05-28 21:52:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality14459418807237767208.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/CTLCardinality11245314791930800388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14459418807237767208.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 21:53:24] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:53:24] [INFO ] Applying decomposition
[2024-05-28 21:53:24] [INFO ] Flatten gal took : 20 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/graph15935784315661109023.txt' '-o' '/tmp/graph15935784315661109023.bin' '-w' '/tmp/graph15935784315661109023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15935784315661109023.bin' '-l' '-1' '-v' '-w' '/tmp/graph15935784315661109023.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:53:24] [INFO ] Decomposing Gal with order
[2024-05-28 21:53:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:53:24] [INFO ] Removed a total of 195 redundant transitions.
[2024-05-28 21:53:24] [INFO ] Flatten gal took : 43 ms
[2024-05-28 21:53:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 21:53:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality826543094008209081.gal : 10 ms
[2024-05-28 21:53:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality9301719598850173644.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/CTLCardinality826543094008209081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9301719598850173644.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 -...261
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 : 1200/1200 places, 1100/1100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1199 transition count 858
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 958 transition count 858
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 482 place count 958 transition count 706
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 786 place count 806 transition count 706
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 799 place count 793 transition count 693
Iterating global reduction 2 with 13 rules applied. Total rules applied 812 place count 793 transition count 693
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 812 place count 793 transition count 683
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 832 place count 783 transition count 683
Performed 321 Post agglomeration using F-continuation condition.Transition count delta: 321
Deduced a syphon composed of 321 places in 0 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 2 with 642 rules applied. Total rules applied 1474 place count 462 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1475 place count 462 transition count 361
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1477 place count 461 transition count 360
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1479 place count 459 transition count 358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1481 place count 457 transition count 358
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1481 place count 457 transition count 357
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1483 place count 456 transition count 357
Applied a total of 1483 rules in 92 ms. Remains 456 /1200 variables (removed 744) and now considering 357/1100 (removed 743) transitions.
// Phase 1: matrix 357 rows 456 cols
[2024-05-28 21:53:54] [INFO ] Computed 179 invariants in 1 ms
[2024-05-28 21:53:54] [INFO ] Implicit Places using invariants in 255 ms returned [442]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 256 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 455/1200 places, 357/1100 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 454 transition count 356
Applied a total of 2 rules in 11 ms. Remains 454 /455 variables (removed 1) and now considering 356/357 (removed 1) transitions.
// Phase 1: matrix 356 rows 454 cols
[2024-05-28 21:53:54] [INFO ] Computed 178 invariants in 1 ms
[2024-05-28 21:53:54] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-28 21:53:54] [INFO ] Invariant cache hit.
[2024-05-28 21:53:55] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 454/1200 places, 356/1100 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 865 ms. Remains : 454/1200 places, 356/1100 transitions.
[2024-05-28 21:53:55] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:53:55] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:53:55] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-28 21:53:55] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:53:55] [INFO ] Flatten gal took : 17 ms
[2024-05-28 21:53:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3072751174094047738.gal : 2 ms
[2024-05-28 21:53:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4008595929632254603.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3072751174094047738.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4008595929632254603.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 ...328
Loading property file /tmp/ReachabilityCardinality4008595929632254603.prop.
RANDOM walk for 40000 steps (8 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
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 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 25
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :25 after 48
Invariant property ShieldIIPt-PT-020B-CTLCardinality-2024-05 does not hold.
FORMULA ShieldIIPt-PT-020B-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
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,82,0.104449,6536,2,1090,10,3674,6,0,2175,1201,0
Total reachable state count : 82

Verifying 1 reachability properties.
Invariant property ShieldIIPt-PT-020B-CTLCardinality-2024-05 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
ShieldIIPt-PT-020B-CTLCardinality-2024-05,1,0.10563,6788,2,455,10,3674,7,0,2178,1201,0
Interrupted probabilistic random walk after 563017 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 563017 steps, saw 392880 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1100/1100 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1182 transition count 1082
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1182 transition count 1082
Applied a total of 36 rules in 79 ms. Remains 1182 /1200 variables (removed 18) and now considering 1082/1100 (removed 18) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-28 21:53:58] [INFO ] Computed 181 invariants in 9 ms
[2024-05-28 21:53:58] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-28 21:53:58] [INFO ] Invariant cache hit.
[2024-05-28 21:53:59] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
Running 1081 sub problems to find dead transitions.
[2024-05-28 21:53:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Starting structural reductions in LTL mode, iteration 1 : 1182/1200 places, 1082/1100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31349 ms. Remains : 1182/1200 places, 1082/1100 transitions.
[2024-05-28 21:54:29] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:54:29] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:54:29] [INFO ] Input system was already deterministic with 1082 transitions.
[2024-05-28 21:54:29] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:54:30] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:54:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality4357411908582889791.gal : 8 ms
[2024-05-28 21:54:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11635736156249676356.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/CTLCardinality4357411908582889791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11635736156249676356.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 21:55:00] [INFO ] Flatten gal took : 22 ms
[2024-05-28 21:55:00] [INFO ] Applying decomposition
[2024-05-28 21:55:00] [INFO ] Flatten gal took : 18 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/graph9390980707487186863.txt' '-o' '/tmp/graph9390980707487186863.bin' '-w' '/tmp/graph9390980707487186863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9390980707487186863.bin' '-l' '-1' '-v' '-w' '/tmp/graph9390980707487186863.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:55:00] [INFO ] Decomposing Gal with order
[2024-05-28 21:55:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:55:00] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-28 21:55:00] [INFO ] Flatten gal took : 44 ms
[2024-05-28 21:55:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-28 21:55:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality12697705763313280399.gal : 109 ms
[2024-05-28 21:55:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality4190404044880778405.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/CTLCardinality12697705763313280399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4190404044880778405.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 : 1200/1200 places, 1100/1100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 1199 transition count 865
Reduce places removed 234 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 236 rules applied. Total rules applied 470 place count 965 transition count 863
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 472 place count 963 transition count 863
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 472 place count 963 transition count 714
Deduced a syphon composed of 149 places in 1 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 770 place count 814 transition count 714
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 782 place count 802 transition count 702
Iterating global reduction 3 with 12 rules applied. Total rules applied 794 place count 802 transition count 702
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 794 place count 802 transition count 692
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 814 place count 792 transition count 692
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 1 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 3 with 644 rules applied. Total rules applied 1458 place count 470 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1459 place count 470 transition count 369
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1461 place count 469 transition count 368
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1463 place count 467 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1465 place count 465 transition count 366
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1465 place count 465 transition count 365
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1467 place count 464 transition count 365
Applied a total of 1467 rules in 83 ms. Remains 464 /1200 variables (removed 736) and now considering 365/1100 (removed 735) transitions.
// Phase 1: matrix 365 rows 464 cols
[2024-05-28 21:55:30] [INFO ] Computed 179 invariants in 3 ms
[2024-05-28 21:55:30] [INFO ] Implicit Places using invariants in 214 ms returned [450]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 463/1200 places, 365/1100 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 462 transition count 364
Applied a total of 2 rules in 11 ms. Remains 462 /463 variables (removed 1) and now considering 364/365 (removed 1) transitions.
// Phase 1: matrix 364 rows 462 cols
[2024-05-28 21:55:30] [INFO ] Computed 178 invariants in 1 ms
[2024-05-28 21:55:30] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-28 21:55:30] [INFO ] Invariant cache hit.
[2024-05-28 21:55:31] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 462/1200 places, 364/1100 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 842 ms. Remains : 462/1200 places, 364/1100 transitions.
[2024-05-28 21:55:31] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:55:31] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:55:31] [INFO ] Input system was already deterministic with 364 transitions.
[2024-05-28 21:55:31] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:55:31] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:55:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality8948457048337105900.gal : 3 ms
[2024-05-28 21:55:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality14007637644212377487.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/CTLCardinality8948457048337105900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14007637644212377487.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.
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,1.09148e+70,0.417458,19124,2,1607,5,67479,6,0,2214,88142,0


Converting to forward existential form...Done !
original formula: EF(AG((((p696==0)&&(p1241==1)) + (((p173==1) * AG((p364==1))) * (p709==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p696==0)&&(p1241==1)) + (((p173==1) * !(E(TRUE U !((p364==1))))) * (p709==1)...171
Reverse transition relation is NOT exact ! Due to transitions t17, t89, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tot...171
(forward)formula 0,0,3.37732,112600,1,0,659,787989,753,290,13355,374844,745
FORMULA ShieldIIPt-PT-020B-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1200/1200 places, 1100/1100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1199 transition count 859
Reduce places removed 240 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 481 place count 959 transition count 858
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 482 place count 958 transition count 858
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 152 Pre rules applied. Total rules applied 482 place count 958 transition count 706
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 786 place count 806 transition count 706
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 798 place count 794 transition count 694
Iterating global reduction 3 with 12 rules applied. Total rules applied 810 place count 794 transition count 694
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 810 place count 794 transition count 685
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 828 place count 785 transition count 685
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 0 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 3 with 644 rules applied. Total rules applied 1472 place count 463 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1473 place count 463 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1475 place count 462 transition count 361
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1477 place count 460 transition count 359
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1479 place count 458 transition count 359
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1479 place count 458 transition count 358
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1481 place count 457 transition count 358
Applied a total of 1481 rules in 82 ms. Remains 457 /1200 variables (removed 743) and now considering 358/1100 (removed 742) transitions.
// Phase 1: matrix 358 rows 457 cols
[2024-05-28 21:55:34] [INFO ] Computed 179 invariants in 1 ms
[2024-05-28 21:55:35] [INFO ] Implicit Places using invariants in 190 ms returned [443]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 190 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 456/1200 places, 358/1100 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 455 transition count 357
Applied a total of 2 rules in 13 ms. Remains 455 /456 variables (removed 1) and now considering 357/358 (removed 1) transitions.
// Phase 1: matrix 357 rows 455 cols
[2024-05-28 21:55:35] [INFO ] Computed 178 invariants in 2 ms
[2024-05-28 21:55:35] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-28 21:55:35] [INFO ] Invariant cache hit.
[2024-05-28 21:55:35] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 455/1200 places, 357/1100 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 795 ms. Remains : 455/1200 places, 357/1100 transitions.
[2024-05-28 21:55:35] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:55:35] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:55:35] [INFO ] Input system was already deterministic with 357 transitions.
[2024-05-28 21:55:35] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:55:35] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:55:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9441920330004029718.gal : 2 ms
[2024-05-28 21:55:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality1974014379118522035.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/CTLCardinality9441920330004029718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1974014379118522035.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.
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,2.8892e+69,0.385302,17764,2,1516,5,60836,6,0,2180,79495,0


Converting to forward existential form...Done !
original formula: EG(((p109==0)||(p296==1)))
=> equivalent forward existential formula: [FwdG(Init,((p109==0)||(p296==1)))] != FALSE
Hit Full ! (commute/partial/dont) 353/0/4
(forward)formula 0,1,1.9911,67568,1,0,9,435304,19,4,10860,138325,8
FORMULA ShieldIIPt-PT-020B-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1100/1100 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1181 transition count 1081
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1181 transition count 1081
Applied a total of 38 rules in 55 ms. Remains 1181 /1200 variables (removed 19) and now considering 1081/1100 (removed 19) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2024-05-28 21:55:37] [INFO ] Computed 181 invariants in 10 ms
[2024-05-28 21:55:37] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-28 21:55:38] [INFO ] Invariant cache hit.
[2024-05-28 21:55:38] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-05-28 21:55:38] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
SMT process timed out in 30143ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 30153ms
Starting structural reductions in LTL mode, iteration 1 : 1181/1200 places, 1081/1100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31288 ms. Remains : 1181/1200 places, 1081/1100 transitions.
[2024-05-28 21:56:08] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:56:08] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:56:09] [INFO ] Input system was already deterministic with 1081 transitions.
[2024-05-28 21:56:09] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:56:09] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:56:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality9932356270872821285.gal : 4 ms
[2024-05-28 21:56:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality18422510614494570080.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/CTLCardinality9932356270872821285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18422510614494570080.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 21:56:39] [INFO ] Flatten gal took : 24 ms
[2024-05-28 21:56:39] [INFO ] Applying decomposition
[2024-05-28 21:56:39] [INFO ] Flatten gal took : 19 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/graph15242312694520054832.txt' '-o' '/tmp/graph15242312694520054832.bin' '-w' '/tmp/graph15242312694520054832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15242312694520054832.bin' '-l' '-1' '-v' '-w' '/tmp/graph15242312694520054832.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:56:39] [INFO ] Decomposing Gal with order
[2024-05-28 21:56:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:56:39] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-28 21:56:39] [INFO ] Flatten gal took : 38 ms
[2024-05-28 21:56:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 21:56:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality6907190905869289587.gal : 7 ms
[2024-05-28 21:56:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality9495912238936997303.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/CTLCardinality6907190905869289587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9495912238936997303.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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1100/1100 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1184 transition count 1084
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1184 transition count 1084
Applied a total of 32 rules in 55 ms. Remains 1184 /1200 variables (removed 16) and now considering 1084/1100 (removed 16) transitions.
// Phase 1: matrix 1084 rows 1184 cols
[2024-05-28 21:57:09] [INFO ] Computed 181 invariants in 7 ms
[2024-05-28 21:57:09] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-28 21:57:09] [INFO ] Invariant cache hit.
[2024-05-28 21:57:10] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 1083 sub problems to find dead transitions.
[2024-05-28 21:57:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1083 unsolved
SMT process timed out in 30144ms, After SMT, problems are : Problem set: 0 solved, 1083 unsolved
Search for dead transitions found 0 dead transitions in 30159ms
Starting structural reductions in LTL mode, iteration 1 : 1184/1200 places, 1084/1100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31276 ms. Remains : 1184/1200 places, 1084/1100 transitions.
[2024-05-28 21:57:40] [INFO ] Flatten gal took : 20 ms
[2024-05-28 21:57:40] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:57:40] [INFO ] Input system was already deterministic with 1084 transitions.
[2024-05-28 21:57:40] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:57:40] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:57:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality14238141505345221243.gal : 5 ms
[2024-05-28 21:57:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality478731446553651491.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/CTLCardinality14238141505345221243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality478731446553651491.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 21:58:10] [INFO ] Flatten gal took : 21 ms
[2024-05-28 21:58:10] [INFO ] Applying decomposition
[2024-05-28 21:58:10] [INFO ] Flatten gal took : 19 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/graph11156216091516653839.txt' '-o' '/tmp/graph11156216091516653839.bin' '-w' '/tmp/graph11156216091516653839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11156216091516653839.bin' '-l' '-1' '-v' '-w' '/tmp/graph11156216091516653839.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:58:10] [INFO ] Decomposing Gal with order
[2024-05-28 21:58:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:58:11] [INFO ] Removed a total of 197 redundant transitions.
[2024-05-28 21:58:11] [INFO ] Flatten gal took : 47 ms
[2024-05-28 21:58:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 21:58:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality16833119527705188612.gal : 8 ms
[2024-05-28 21:58:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality12969031866290907092.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/CTLCardinality16833119527705188612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12969031866290907092.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 : 1200/1200 places, 1100/1100 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1185 transition count 1085
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1185 transition count 1085
Applied a total of 30 rules in 61 ms. Remains 1185 /1200 variables (removed 15) and now considering 1085/1100 (removed 15) transitions.
// Phase 1: matrix 1085 rows 1185 cols
[2024-05-28 21:58:41] [INFO ] Computed 181 invariants in 13 ms
[2024-05-28 21:58:41] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-28 21:58:41] [INFO ] Invariant cache hit.
[2024-05-28 21:58:42] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Running 1084 sub problems to find dead transitions.
[2024-05-28 21:58:42] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1084 unsolved
SMT process timed out in 30144ms, After SMT, problems are : Problem set: 0 solved, 1084 unsolved
Search for dead transitions found 0 dead transitions in 30153ms
Starting structural reductions in LTL mode, iteration 1 : 1185/1200 places, 1085/1100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31269 ms. Remains : 1185/1200 places, 1085/1100 transitions.
[2024-05-28 21:59:12] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:59:12] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:59:12] [INFO ] Input system was already deterministic with 1085 transitions.
[2024-05-28 21:59:12] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:59:12] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:59:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality16359493698442843716.gal : 4 ms
[2024-05-28 21:59:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7707983721662317954.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/CTLCardinality16359493698442843716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7707983721662317954.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 21:59:42] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:59:42] [INFO ] Applying decomposition
[2024-05-28 21:59:42] [INFO ] Flatten gal took : 19 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/graph5788385399251130091.txt' '-o' '/tmp/graph5788385399251130091.bin' '-w' '/tmp/graph5788385399251130091.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5788385399251130091.bin' '-l' '-1' '-v' '-w' '/tmp/graph5788385399251130091.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:59:42] [INFO ] Decomposing Gal with order
[2024-05-28 21:59:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:59:42] [INFO ] Removed a total of 197 redundant transitions.
[2024-05-28 21:59:42] [INFO ] Flatten gal took : 34 ms
[2024-05-28 21:59:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 21:59:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality15467597559448064237.gal : 6 ms
[2024-05-28 21:59:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality10774476801159328564.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/CTLCardinality15467597559448064237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10774476801159328564.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 : 1200/1200 places, 1100/1100 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1182 transition count 1082
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1182 transition count 1082
Applied a total of 36 rules in 63 ms. Remains 1182 /1200 variables (removed 18) and now considering 1082/1100 (removed 18) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-28 22:00:12] [INFO ] Computed 181 invariants in 8 ms
[2024-05-28 22:00:13] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-28 22:00:13] [INFO ] Invariant cache hit.
[2024-05-28 22:00:14] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
Running 1081 sub problems to find dead transitions.
[2024-05-28 22:00:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1081 unsolved
SMT process timed out in 30144ms, After SMT, problems are : Problem set: 0 solved, 1081 unsolved
Search for dead transitions found 0 dead transitions in 30153ms
Starting structural reductions in LTL mode, iteration 1 : 1182/1200 places, 1082/1100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31265 ms. Remains : 1182/1200 places, 1082/1100 transitions.
[2024-05-28 22:00:44] [INFO ] Flatten gal took : 21 ms
[2024-05-28 22:00:44] [INFO ] Flatten gal took : 19 ms
[2024-05-28 22:00:44] [INFO ] Input system was already deterministic with 1082 transitions.
[2024-05-28 22:00:44] [INFO ] Flatten gal took : 21 ms
[2024-05-28 22:00:44] [INFO ] Flatten gal took : 18 ms
[2024-05-28 22:00:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality354964387518688844.gal : 3 ms
[2024-05-28 22:00:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality18126400508457657811.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/CTLCardinality354964387518688844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18126400508457657811.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 22:01:14] [INFO ] Flatten gal took : 18 ms
[2024-05-28 22:01:14] [INFO ] Applying decomposition
[2024-05-28 22:01:14] [INFO ] Flatten gal took : 19 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/graph7535663885940929672.txt' '-o' '/tmp/graph7535663885940929672.bin' '-w' '/tmp/graph7535663885940929672.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7535663885940929672.bin' '-l' '-1' '-v' '-w' '/tmp/graph7535663885940929672.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:01:14] [INFO ] Decomposing Gal with order
[2024-05-28 22:01:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:01:14] [INFO ] Removed a total of 202 redundant transitions.
[2024-05-28 22:01:14] [INFO ] Flatten gal took : 37 ms
[2024-05-28 22:01:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 22:01:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality1266956717455491522.gal : 7 ms
[2024-05-28 22:01:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality4229560914902432365.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/CTLCardinality1266956717455491522.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4229560914902432365.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 -...262
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 : 1200/1200 places, 1100/1100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1199 transition count 859
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 959 transition count 859
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 480 place count 959 transition count 707
Deduced a syphon composed of 152 places in 1 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 784 place count 807 transition count 707
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 797 place count 794 transition count 694
Iterating global reduction 2 with 13 rules applied. Total rules applied 810 place count 794 transition count 694
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 810 place count 794 transition count 684
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 830 place count 784 transition count 684
Performed 317 Post agglomeration using F-continuation condition.Transition count delta: 317
Deduced a syphon composed of 317 places in 0 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1464 place count 467 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1465 place count 467 transition count 366
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1467 place count 466 transition count 365
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1469 place count 464 transition count 363
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1471 place count 462 transition count 363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1471 place count 462 transition count 362
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1473 place count 461 transition count 362
Applied a total of 1473 rules in 73 ms. Remains 461 /1200 variables (removed 739) and now considering 362/1100 (removed 738) transitions.
// Phase 1: matrix 362 rows 461 cols
[2024-05-28 22:01:44] [INFO ] Computed 179 invariants in 0 ms
[2024-05-28 22:01:44] [INFO ] Implicit Places using invariants in 176 ms returned [447]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 460/1200 places, 362/1100 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 459 transition count 361
Applied a total of 2 rules in 10 ms. Remains 459 /460 variables (removed 1) and now considering 361/362 (removed 1) transitions.
// Phase 1: matrix 361 rows 459 cols
[2024-05-28 22:01:44] [INFO ] Computed 178 invariants in 1 ms
[2024-05-28 22:01:45] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-28 22:01:45] [INFO ] Invariant cache hit.
[2024-05-28 22:01:45] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 459/1200 places, 361/1100 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 779 ms. Remains : 459/1200 places, 361/1100 transitions.
[2024-05-28 22:01:45] [INFO ] Flatten gal took : 8 ms
[2024-05-28 22:01:45] [INFO ] Flatten gal took : 8 ms
[2024-05-28 22:01:45] [INFO ] Input system was already deterministic with 361 transitions.
[2024-05-28 22:01:45] [INFO ] Flatten gal took : 8 ms
[2024-05-28 22:01:45] [INFO ] Flatten gal took : 8 ms
[2024-05-28 22:01:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality9896365796760161943.gal : 4 ms
[2024-05-28 22:01:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality789969515717254810.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/CTLCardinality9896365796760161943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality789969515717254810.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 -...282
No direction supplied, using forward translation only.
Parsed 1 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.5248e+69,0.654941,27296,2,1705,5,100785,6,0,2198,145293,0


Converting to forward existential form...Done !
original formula: AG(E(((p1256==0)&&((p22==0)||(p664==1))) U ((p1076==1)||(p386==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p1256==0)&&((p22==0)||(p664==1))) U ((p1076==1)||(p386==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t124, t127, t220, t223, t299, t305, t339, t345, Intersection with reachable at each step ena...209
Detected timeout of ITS tools.
[2024-05-28 22:02:15] [INFO ] Flatten gal took : 12 ms
[2024-05-28 22:02:15] [INFO ] Applying decomposition
[2024-05-28 22:02:15] [INFO ] Flatten gal took : 8 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/graph3520542679171662786.txt' '-o' '/tmp/graph3520542679171662786.bin' '-w' '/tmp/graph3520542679171662786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3520542679171662786.bin' '-l' '-1' '-v' '-w' '/tmp/graph3520542679171662786.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:02:15] [INFO ] Decomposing Gal with order
[2024-05-28 22:02:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:02:15] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-28 22:02:15] [INFO ] Flatten gal took : 12 ms
[2024-05-28 22:02:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 22:02:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality5209657940845962722.gal : 3 ms
[2024-05-28 22:02:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality8621233043521607983.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/CTLCardinality5209657940845962722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8621233043521607983.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 -...262
No direction supplied, using forward translation only.
Parsed 1 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.5248e+69,0.385943,19444,105,18,32682,153,513,74779,44,717,0


Converting to forward existential form...Done !
original formula: AG(E(((i17.i0.u144.p1256==0)&&((i0.i0.u0.p22==0)||(i8.i3.u75.p664==1))) U ((i14.i2.u123.p1076==1)||(i4.i1.u43.p386==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((i17.i0.u144.p1256==0)&&((i0.i0.u0.p22==0)||(i8.i3.u75.p664==1))) U ((i14.i2.u123.p1076...193
Reverse transition relation is NOT exact ! Due to transitions t299, t305, t339, t345, i5.i0.u46.t127, i5.i1.u45.t124, i15.i0.u125.t220, i15.i1.u126.t223, ...253
(forward)formula 0,0,21.0286,560908,1,0,797036,241,3339,2.62992e+06,226,1027,395189
FORMULA ShieldIIPt-PT-020B-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1200/1200 places, 1100/1100 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1183 transition count 1083
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1183 transition count 1083
Applied a total of 34 rules in 62 ms. Remains 1183 /1200 variables (removed 17) and now considering 1083/1100 (removed 17) transitions.
// Phase 1: matrix 1083 rows 1183 cols
[2024-05-28 22:02:36] [INFO ] Computed 181 invariants in 7 ms
[2024-05-28 22:02:37] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-28 22:02:37] [INFO ] Invariant cache hit.
[2024-05-28 22:02:37] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
Running 1082 sub problems to find dead transitions.
[2024-05-28 22:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1082 unsolved
SMT process timed out in 30152ms, After SMT, problems are : Problem set: 0 solved, 1082 unsolved
Search for dead transitions found 0 dead transitions in 30162ms
Starting structural reductions in LTL mode, iteration 1 : 1183/1200 places, 1083/1100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31256 ms. Remains : 1183/1200 places, 1083/1100 transitions.
[2024-05-28 22:03:07] [INFO ] Flatten gal took : 22 ms
[2024-05-28 22:03:08] [INFO ] Flatten gal took : 19 ms
[2024-05-28 22:03:08] [INFO ] Input system was already deterministic with 1083 transitions.
[2024-05-28 22:03:08] [INFO ] Flatten gal took : 20 ms
[2024-05-28 22:03:08] [INFO ] Flatten gal took : 19 ms
[2024-05-28 22:03:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality16624849852065291536.gal : 4 ms
[2024-05-28 22:03:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality10871669027425623507.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/CTLCardinality16624849852065291536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10871669027425623507.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 22:03:38] [INFO ] Flatten gal took : 23 ms
[2024-05-28 22:03:38] [INFO ] Applying decomposition
[2024-05-28 22:03:38] [INFO ] Flatten gal took : 19 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/graph2623223000888424431.txt' '-o' '/tmp/graph2623223000888424431.bin' '-w' '/tmp/graph2623223000888424431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2623223000888424431.bin' '-l' '-1' '-v' '-w' '/tmp/graph2623223000888424431.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:03:38] [INFO ] Decomposing Gal with order
[2024-05-28 22:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:03:38] [INFO ] Removed a total of 197 redundant transitions.
[2024-05-28 22:03:38] [INFO ] Flatten gal took : 34 ms
[2024-05-28 22:03:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 22:03:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality6725930602622032007.gal : 7 ms
[2024-05-28 22:03:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality16330394861842238207.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/CTLCardinality6725930602622032007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16330394861842238207.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.
[2024-05-28 22:04:08] [INFO ] Flatten gal took : 22 ms
[2024-05-28 22:04:08] [INFO ] Flatten gal took : 19 ms
[2024-05-28 22:04:08] [INFO ] Applying decomposition
[2024-05-28 22:04:08] [INFO ] Flatten gal took : 20 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/graph14096544240385165176.txt' '-o' '/tmp/graph14096544240385165176.bin' '-w' '/tmp/graph14096544240385165176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14096544240385165176.bin' '-l' '-1' '-v' '-w' '/tmp/graph14096544240385165176.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:04:08] [INFO ] Decomposing Gal with order
[2024-05-28 22:04:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:04:08] [INFO ] Removed a total of 177 redundant transitions.
[2024-05-28 22:04:08] [INFO ] Flatten gal took : 33 ms
[2024-05-28 22:04:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 22:04:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality17490530388956515651.gal : 6 ms
[2024-05-28 22:04:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality11945329404229275508.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/CTLCardinality17490530388956515651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11945329404229275508.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 9 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 22:12:08] [INFO ] Applying decomposition
[2024-05-28 22:12:08] [INFO ] Flatten gal took : 22 ms
[2024-05-28 22:12:08] [INFO ] Decomposing Gal with order
[2024-05-28 22:12:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:12:08] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-28 22:12:08] [INFO ] Flatten gal took : 30 ms
[2024-05-28 22:12:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 22:12:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality12264705869688842332.gal : 14 ms
[2024-05-28 22:12:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality11638176954492352030.ctl : 2 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/CTLCardinality12264705869688842332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11638176954492352030.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 9 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 22:22:24] [INFO ] Flatten gal took : 27 ms
[2024-05-28 22:22:24] [INFO ] Input system was already deterministic with 1100 transitions.
[2024-05-28 22:22:24] [INFO ] Transformed 1200 places.
[2024-05-28 22:22:24] [INFO ] Transformed 1100 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 22:22:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality10157673695591028552.gal : 10 ms
[2024-05-28 22:22:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality15276483723841346449.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/CTLCardinality10157673695591028552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15276483723841346449.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2648828 ms.

BK_STOP 1716935530201

--------------------
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="ShieldIIPt-PT-020B"
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 ShieldIIPt-PT-020B, 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 r356-tall-171683760700281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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