Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654446000449.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-PT-S05J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 23K Apr 12 09:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 09:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Apr 12 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 193K Apr 12 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 55K Apr 12 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 12 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118K Apr 12 10:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 512K Apr 12 10:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 PolyORBNT-PT-S05J30-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S05J30-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716885449986

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 08:37:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 08:37:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 08:37:31] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2024-05-28 08:37:31] [INFO ] Transformed 489 places.
[2024-05-28 08:37:31] [INFO ] Transformed 1400 transitions.
[2024-05-28 08:37:31] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 390 out of 489 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 485 transition count 745
Applied a total of 4 rules in 47 ms. Remains 485 /489 variables (removed 4) and now considering 745/745 (removed 0) transitions.
Running 739 sub problems to find dead transitions.
[2024-05-28 08:37:32] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 485 cols
[2024-05-28 08:37:32] [INFO ] Computed 78 invariants in 47 ms
[2024-05-28 08:37:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 739 unsolved
Problem TDEAD17 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
At refinement iteration 3 (OVERLAPS) 7/485 variables, 7/78 constraints. Problems are: Problem set: 95 solved, 644 unsolved
[2024-05-28 08:37:51] [INFO ] Deduced a trap composed of 87 places in 264 ms of which 29 ms to minimize.
[2024-05-28 08:37:53] [INFO ] Deduced a trap composed of 292 places in 260 ms of which 3 ms to minimize.
[2024-05-28 08:37:53] [INFO ] Deduced a trap composed of 271 places in 287 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 3/81 constraints. Problems are: Problem set: 95 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/1226 variables, and 81 constraints, problems are : Problem set: 95 solved, 644 unsolved in 20077 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/485 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 739/739 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 95 solved, 644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 59/59 constraints. Problems are: Problem set: 95 solved, 644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 12/71 constraints. Problems are: Problem set: 95 solved, 644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 0/71 constraints. Problems are: Problem set: 95 solved, 644 unsolved
At refinement iteration 3 (OVERLAPS) 7/485 variables, 7/78 constraints. Problems are: Problem set: 95 solved, 644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 3/81 constraints. Problems are: Problem set: 95 solved, 644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/1226 variables, and 81 constraints, problems are : Problem set: 95 solved, 644 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/485 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/739 constraints, Known Traps: 3/3 constraints]
After SMT, in 41698ms problems are : Problem set: 95 solved, 644 unsolved
Search for dead transitions found 95 dead transitions in 41742ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2024-05-28 08:38:13] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
// Phase 1: matrix 646 rows 485 cols
[2024-05-28 08:38:13] [INFO ] Computed 78 invariants in 31 ms
[2024-05-28 08:38:14] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-28 08:38:14] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-28 08:38:14] [INFO ] Invariant cache hit.
[2024-05-28 08:38:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 08:38:14] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 485/489 places, 650/745 transitions.
Applied a total of 0 rules in 7 ms. Remains 485 /485 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42999 ms. Remains : 485/489 places, 650/745 transitions.
Support contains 390 out of 485 places after structural reductions.
[2024-05-28 08:38:15] [INFO ] Flatten gal took : 156 ms
[2024-05-28 08:38:15] [INFO ] Flatten gal took : 66 ms
[2024-05-28 08:38:15] [INFO ] Input system was already deterministic with 650 transitions.
RANDOM walk for 40000 steps (2748 resets) in 2492 ms. (16 steps per ms) remains 68/88 properties
BEST_FIRST walk for 4003 steps (72 resets) in 52 ms. (75 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (75 resets) in 62 ms. (63 steps per ms) remains 66/68 properties
BEST_FIRST walk for 4003 steps (54 resets) in 69 ms. (57 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (70 resets) in 47 ms. (83 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (103 resets) in 39 ms. (100 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (77 resets) in 24 ms. (160 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4004 steps (61 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (56 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (63 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (54 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (73 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (90 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (63 resets) in 70 ms. (56 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (74 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (54 resets) in 32 ms. (121 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (120 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (61 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (68 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (73 resets) in 41 ms. (95 steps per ms) remains 64/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (59 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (75 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (83 resets) in 51 ms. (76 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (108 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (87 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (85 resets) in 21 ms. (181 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (72 resets) in 21 ms. (181 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (60 resets) in 21 ms. (182 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (65 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (60 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (65 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (78 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (70 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (15 resets) in 21 ms. (181 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (54 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (87 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (74 resets) in 28 ms. (138 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (82 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (53 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (68 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (90 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (73 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (59 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (72 resets) in 21 ms. (181 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (63 resets) in 22 ms. (174 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (76 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (70 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (57 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (69 resets) in 41 ms. (95 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (60 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (45 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (83 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (72 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (66 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (54 resets) in 19 ms. (200 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (74 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (67 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (73 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (63 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (71 resets) in 20 ms. (190 steps per ms) remains 64/64 properties
[2024-05-28 08:38:17] [INFO ] Flow matrix only has 646 transitions (discarded 4 similar events)
[2024-05-28 08:38:17] [INFO ] Invariant cache hit.
[2024-05-28 08:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp86 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/352 variables, 32/32 constraints. Problems are: Problem set: 22 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/352 variables, 0/32 constraints. Problems are: Problem set: 22 solved, 42 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 2 (OVERLAPS) 94/446 variables, 27/59 constraints. Problems are: Problem set: 43 solved, 21 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp74 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 3/62 constraints. Problems are: Problem set: 46 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 0/62 constraints. Problems are: Problem set: 46 solved, 18 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp87 is UNSAT
At refinement iteration 5 (OVERLAPS) 39/485 variables, 16/78 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/78 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 646/1131 variables, 485/563 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1131 variables, 1/564 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 0/564 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1131 variables, 0/564 constraints. Problems are: Problem set: 61 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 564 constraints, problems are : Problem set: 61 solved, 3 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 485/485 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 61 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 138/149 variables, 10/10 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 138/287 variables, 24/34 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/34 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 90/377 variables, 18/52 constraints. Problems are: Problem set: 61 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/52 constraints. Problems are: Problem set: 61 solved, 3 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 7 (OVERLAPS) 100/477 variables, 19/71 constraints. Problems are: Problem set: 62 solved, 2 unsolved
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 88 places in 421 ms of which 33 ms to minimize.
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 88 places in 297 ms of which 3 ms to minimize.
[2024-05-28 08:38:20] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 3/74 constraints. Problems are: Problem set: 62 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/74 constraints. Problems are: Problem set: 62 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/484 variables, 7/81 constraints. Problems are: Problem set: 62 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 0/81 constraints. Problems are: Problem set: 62 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 646/1130 variables, 484/565 constraints. Problems are: Problem set: 62 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1130 variables, 1/566 constraints. Problems are: Problem set: 62 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1130 variables, 2/568 constraints. Problems are: Problem set: 62 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1130 variables, 0/568 constraints. Problems are: Problem set: 62 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/1131 variables, 1/569 constraints. Problems are: Problem set: 62 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1131 variables, 0/569 constraints. Problems are: Problem set: 62 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1131 variables, 0/569 constraints. Problems are: Problem set: 62 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 569 constraints, problems are : Problem set: 62 solved, 2 unsolved in 3070 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 485/485 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/64 constraints, Known Traps: 3/3 constraints]
After SMT, in 4936ms problems are : Problem set: 62 solved, 2 unsolved
Parikh walk visited 1 properties in 120 ms.
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 73 place count 448 transition count 580
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 141 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 413 transition count 579
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 413 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 411 transition count 577
Applied a total of 147 rules in 145 ms. Remains 411 /485 variables (removed 74) and now considering 577/650 (removed 73) transitions.
Running 571 sub problems to find dead transitions.
[2024-05-28 08:38:22] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-28 08:38:22] [INFO ] Computed 77 invariants in 25 ms
[2024-05-28 08:38:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 08:38:26] [INFO ] Deduced a trap composed of 112 places in 179 ms of which 3 ms to minimize.
[2024-05-28 08:38:27] [INFO ] Deduced a trap composed of 150 places in 130 ms of which 2 ms to minimize.
[2024-05-28 08:38:27] [INFO ] Deduced a trap composed of 129 places in 137 ms of which 2 ms to minimize.
[2024-05-28 08:38:27] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 3 ms to minimize.
[2024-05-28 08:38:27] [INFO ] Deduced a trap composed of 107 places in 224 ms of which 4 ms to minimize.
[2024-05-28 08:38:28] [INFO ] Deduced a trap composed of 107 places in 220 ms of which 6 ms to minimize.
[2024-05-28 08:38:28] [INFO ] Deduced a trap composed of 107 places in 301 ms of which 2 ms to minimize.
[2024-05-28 08:38:28] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 2 ms to minimize.
[2024-05-28 08:38:28] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2024-05-28 08:38:28] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
[2024-05-28 08:38:29] [INFO ] Deduced a trap composed of 132 places in 157 ms of which 3 ms to minimize.
[2024-05-28 08:38:29] [INFO ] Deduced a trap composed of 111 places in 149 ms of which 2 ms to minimize.
[2024-05-28 08:38:29] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 2 ms to minimize.
[2024-05-28 08:38:29] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 2 ms to minimize.
[2024-05-28 08:38:29] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 2 ms to minimize.
[2024-05-28 08:38:29] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 2 ms to minimize.
[2024-05-28 08:38:30] [INFO ] Deduced a trap composed of 119 places in 131 ms of which 2 ms to minimize.
[2024-05-28 08:38:30] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 2 ms to minimize.
[2024-05-28 08:38:30] [INFO ] Deduced a trap composed of 127 places in 128 ms of which 2 ms to minimize.
[2024-05-28 08:38:30] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 08:38:31] [INFO ] Deduced a trap composed of 115 places in 169 ms of which 3 ms to minimize.
[2024-05-28 08:38:31] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 4 ms to minimize.
[2024-05-28 08:38:31] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
[2024-05-28 08:38:31] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 2 ms to minimize.
[2024-05-28 08:38:31] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 2 ms to minimize.
[2024-05-28 08:38:32] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 2 ms to minimize.
[2024-05-28 08:38:32] [INFO ] Deduced a trap composed of 112 places in 178 ms of which 3 ms to minimize.
[2024-05-28 08:38:32] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 3 ms to minimize.
[2024-05-28 08:38:32] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 3 ms to minimize.
[2024-05-28 08:38:32] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 2 ms to minimize.
[2024-05-28 08:38:32] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 3 ms to minimize.
[2024-05-28 08:38:33] [INFO ] Deduced a trap composed of 107 places in 183 ms of which 2 ms to minimize.
[2024-05-28 08:38:33] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 3 ms to minimize.
[2024-05-28 08:38:33] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 3 ms to minimize.
[2024-05-28 08:38:33] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 3 ms to minimize.
[2024-05-28 08:38:33] [INFO ] Deduced a trap composed of 107 places in 195 ms of which 2 ms to minimize.
[2024-05-28 08:38:33] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 3 ms to minimize.
[2024-05-28 08:38:34] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 2 ms to minimize.
[2024-05-28 08:38:34] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 2 ms to minimize.
[2024-05-28 08:38:34] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 08:38:39] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 2 ms to minimize.
[2024-05-28 08:38:39] [INFO ] Deduced a trap composed of 76 places in 243 ms of which 5 ms to minimize.
[2024-05-28 08:38:40] [INFO ] Deduced a trap composed of 121 places in 254 ms of which 5 ms to minimize.
[2024-05-28 08:38:40] [INFO ] Deduced a trap composed of 121 places in 220 ms of which 4 ms to minimize.
[2024-05-28 08:38:40] [INFO ] Deduced a trap composed of 108 places in 217 ms of which 5 ms to minimize.
[2024-05-28 08:38:40] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 2 ms to minimize.
[2024-05-28 08:38:40] [INFO ] Deduced a trap composed of 107 places in 194 ms of which 2 ms to minimize.
[2024-05-28 08:38:41] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 3 ms to minimize.
[2024-05-28 08:38:41] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 3 ms to minimize.
[2024-05-28 08:38:41] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 3 ms to minimize.
[2024-05-28 08:38:41] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 2 ms to minimize.
[2024-05-28 08:38:41] [INFO ] Deduced a trap composed of 107 places in 206 ms of which 3 ms to minimize.
[2024-05-28 08:38:42] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 3 ms to minimize.
[2024-05-28 08:38:42] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 3 ms to minimize.
[2024-05-28 08:38:42] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 2 ms to minimize.
[2024-05-28 08:38:42] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 2 ms to minimize.
[2024-05-28 08:38:42] [INFO ] Deduced a trap composed of 107 places in 214 ms of which 2 ms to minimize.
[2024-05-28 08:38:43] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 8 ms to minimize.
[2024-05-28 08:38:43] [INFO ] Deduced a trap composed of 76 places in 237 ms of which 5 ms to minimize.
[2024-05-28 08:38:43] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 6 ms to minimize.
SMT process timed out in 20951ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 20956ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21103 ms. Remains : 411/485 places, 577/650 transitions.
RANDOM walk for 37408 steps (1951 resets) in 913 ms. (40 steps per ms) remains 0/1 properties
Successfully simplified 62 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 08:38:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 08:38:44] [INFO ] Flatten gal took : 91 ms
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 08:38:44] [INFO ] Flatten gal took : 81 ms
[2024-05-28 08:38:44] [INFO ] Input system was already deterministic with 650 transitions.
Support contains 201 out of 485 places (down from 232) after GAL structural reductions.
FORMULA PolyORBNT-PT-S05J30-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 57 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2024-05-28 08:38:44] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-28 08:38:44] [INFO ] Computed 77 invariants in 13 ms
[2024-05-28 08:38:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:38:59] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 3 ms to minimize.
[2024-05-28 08:39:00] [INFO ] Deduced a trap composed of 204 places in 151 ms of which 2 ms to minimize.
[2024-05-28 08:39:00] [INFO ] Deduced a trap composed of 207 places in 187 ms of which 3 ms to minimize.
[2024-05-28 08:39:00] [INFO ] Deduced a trap composed of 196 places in 160 ms of which 3 ms to minimize.
[2024-05-28 08:39:00] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 3 ms to minimize.
[2024-05-28 08:39:00] [INFO ] Deduced a trap composed of 197 places in 165 ms of which 3 ms to minimize.
[2024-05-28 08:39:01] [INFO ] Deduced a trap composed of 206 places in 172 ms of which 3 ms to minimize.
[2024-05-28 08:39:01] [INFO ] Deduced a trap composed of 197 places in 158 ms of which 3 ms to minimize.
[2024-05-28 08:39:01] [INFO ] Deduced a trap composed of 184 places in 162 ms of which 3 ms to minimize.
[2024-05-28 08:39:01] [INFO ] Deduced a trap composed of 206 places in 162 ms of which 2 ms to minimize.
[2024-05-28 08:39:01] [INFO ] Deduced a trap composed of 203 places in 166 ms of which 2 ms to minimize.
[2024-05-28 08:39:02] [INFO ] Deduced a trap composed of 134 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 89 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:39:08] [INFO ] Deduced a trap composed of 77 places in 178 ms of which 3 ms to minimize.
[2024-05-28 08:39:08] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2024-05-28 08:39:09] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 2 ms to minimize.
[2024-05-28 08:39:10] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 2 ms to minimize.
[2024-05-28 08:39:10] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-28 08:39:10] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:39:15] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-28 08:39:15] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 1 ms to minimize.
[2024-05-28 08:39:15] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 1 ms to minimize.
[2024-05-28 08:39:16] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:39:18] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 2 ms to minimize.
[2024-05-28 08:39:21] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 2 ms to minimize.
[2024-05-28 08:39:21] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-28 08:39:23] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
[2024-05-28 08:39:23] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/1128 variables, and 86 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 13/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 15/27 constraints]
After SMT, in 40885ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 40903ms
Finished structural reductions in LTL mode , in 1 iterations and 40962 ms. Remains : 483/485 places, 649/650 transitions.
[2024-05-28 08:39:25] [INFO ] Flatten gal took : 49 ms
[2024-05-28 08:39:25] [INFO ] Flatten gal took : 38 ms
[2024-05-28 08:39:25] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 40 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2024-05-28 08:39:25] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-28 08:39:25] [INFO ] Invariant cache hit.
[2024-05-28 08:39:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:39:40] [INFO ] Deduced a trap composed of 111 places in 183 ms of which 2 ms to minimize.
[2024-05-28 08:39:41] [INFO ] Deduced a trap composed of 109 places in 182 ms of which 3 ms to minimize.
[2024-05-28 08:39:41] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:39:45] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 3 ms to minimize.
[2024-05-28 08:39:45] [INFO ] Deduced a trap composed of 199 places in 177 ms of which 3 ms to minimize.
[2024-05-28 08:39:45] [INFO ] Deduced a trap composed of 197 places in 161 ms of which 3 ms to minimize.
[2024-05-28 08:39:46] [INFO ] Deduced a trap composed of 191 places in 171 ms of which 3 ms to minimize.
[2024-05-28 08:39:46] [INFO ] Deduced a trap composed of 196 places in 151 ms of which 2 ms to minimize.
[2024-05-28 08:39:46] [INFO ] Deduced a trap composed of 199 places in 172 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 86 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:39:47] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 1 ms to minimize.
[2024-05-28 08:39:49] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 1 ms to minimize.
[2024-05-28 08:39:49] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 1 ms to minimize.
[2024-05-28 08:39:50] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-05-28 08:39:50] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 1 ms to minimize.
[2024-05-28 08:39:50] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 1 ms to minimize.
[2024-05-28 08:39:51] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 1 ms to minimize.
[2024-05-28 08:39:52] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 1 ms to minimize.
[2024-05-28 08:39:52] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:39:56] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 1 ms to minimize.
[2024-05-28 08:39:57] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 1 ms to minimize.
[2024-05-28 08:39:57] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 1 ms to minimize.
[2024-05-28 08:39:57] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 5 (OVERLAPS) 6/483 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1128 variables, and 99 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 22/22 constraints]
After SMT, in 40843ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 40852ms
Finished structural reductions in LTL mode , in 1 iterations and 40895 ms. Remains : 483/485 places, 649/650 transitions.
[2024-05-28 08:40:06] [INFO ] Flatten gal took : 35 ms
[2024-05-28 08:40:06] [INFO ] Flatten gal took : 32 ms
[2024-05-28 08:40:06] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 484 transition count 615
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 449 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 448 transition count 614
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 448 transition count 580
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 414 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 413 transition count 579
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 413 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 411 transition count 577
Applied a total of 146 rules in 71 ms. Remains 411 /485 variables (removed 74) and now considering 577/650 (removed 73) transitions.
Running 571 sub problems to find dead transitions.
[2024-05-28 08:40:06] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2024-05-28 08:40:06] [INFO ] Computed 77 invariants in 12 ms
[2024-05-28 08:40:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 08:40:11] [INFO ] Deduced a trap composed of 110 places in 155 ms of which 3 ms to minimize.
[2024-05-28 08:40:11] [INFO ] Deduced a trap composed of 138 places in 155 ms of which 2 ms to minimize.
[2024-05-28 08:40:11] [INFO ] Deduced a trap composed of 108 places in 178 ms of which 3 ms to minimize.
[2024-05-28 08:40:11] [INFO ] Deduced a trap composed of 108 places in 167 ms of which 3 ms to minimize.
[2024-05-28 08:40:12] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 3 ms to minimize.
[2024-05-28 08:40:12] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 3 ms to minimize.
[2024-05-28 08:40:12] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 3 ms to minimize.
[2024-05-28 08:40:12] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 3 ms to minimize.
[2024-05-28 08:40:12] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 2 ms to minimize.
[2024-05-28 08:40:13] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 3 ms to minimize.
[2024-05-28 08:40:13] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 3 ms to minimize.
[2024-05-28 08:40:13] [INFO ] Deduced a trap composed of 116 places in 170 ms of which 3 ms to minimize.
[2024-05-28 08:40:13] [INFO ] Deduced a trap composed of 144 places in 150 ms of which 3 ms to minimize.
[2024-05-28 08:40:13] [INFO ] Deduced a trap composed of 108 places in 180 ms of which 5 ms to minimize.
[2024-05-28 08:40:14] [INFO ] Deduced a trap composed of 109 places in 191 ms of which 4 ms to minimize.
[2024-05-28 08:40:14] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 2 ms to minimize.
[2024-05-28 08:40:14] [INFO ] Deduced a trap composed of 128 places in 176 ms of which 3 ms to minimize.
[2024-05-28 08:40:14] [INFO ] Deduced a trap composed of 129 places in 171 ms of which 3 ms to minimize.
[2024-05-28 08:40:14] [INFO ] Deduced a trap composed of 128 places in 175 ms of which 3 ms to minimize.
[2024-05-28 08:40:15] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 08:40:15] [INFO ] Deduced a trap composed of 127 places in 153 ms of which 3 ms to minimize.
[2024-05-28 08:40:15] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 2 ms to minimize.
[2024-05-28 08:40:16] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 3 ms to minimize.
[2024-05-28 08:40:16] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 3 ms to minimize.
[2024-05-28 08:40:16] [INFO ] Deduced a trap composed of 107 places in 183 ms of which 3 ms to minimize.
[2024-05-28 08:40:16] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 3 ms to minimize.
[2024-05-28 08:40:16] [INFO ] Deduced a trap composed of 107 places in 174 ms of which 2 ms to minimize.
[2024-05-28 08:40:17] [INFO ] Deduced a trap composed of 107 places in 173 ms of which 4 ms to minimize.
[2024-05-28 08:40:17] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 3 ms to minimize.
[2024-05-28 08:40:17] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 3 ms to minimize.
[2024-05-28 08:40:17] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
[2024-05-28 08:40:18] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 3 ms to minimize.
[2024-05-28 08:40:18] [INFO ] Deduced a trap composed of 107 places in 162 ms of which 3 ms to minimize.
[2024-05-28 08:40:18] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 3 ms to minimize.
[2024-05-28 08:40:18] [INFO ] Deduced a trap composed of 107 places in 184 ms of which 3 ms to minimize.
[2024-05-28 08:40:19] [INFO ] Deduced a trap composed of 107 places in 182 ms of which 3 ms to minimize.
[2024-05-28 08:40:19] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 2 ms to minimize.
[2024-05-28 08:40:19] [INFO ] Deduced a trap composed of 108 places in 169 ms of which 3 ms to minimize.
[2024-05-28 08:40:19] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 3 ms to minimize.
[2024-05-28 08:40:19] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (OVERLAPS) 5/411 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/984 variables, and 117 constraints, problems are : Problem set: 0 solved, 571 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 111 places in 169 ms of which 3 ms to minimize.
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 2 ms to minimize.
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 111 places in 207 ms of which 3 ms to minimize.
[2024-05-28 08:40:29] [INFO ] Deduced a trap composed of 107 places in 183 ms of which 5 ms to minimize.
[2024-05-28 08:40:30] [INFO ] Deduced a trap composed of 111 places in 165 ms of which 2 ms to minimize.
[2024-05-28 08:40:30] [INFO ] Deduced a trap composed of 107 places in 179 ms of which 3 ms to minimize.
[2024-05-28 08:40:30] [INFO ] Deduced a trap composed of 77 places in 192 ms of which 3 ms to minimize.
[2024-05-28 08:40:30] [INFO ] Deduced a trap composed of 78 places in 209 ms of which 4 ms to minimize.
[2024-05-28 08:40:31] [INFO ] Deduced a trap composed of 77 places in 198 ms of which 3 ms to minimize.
[2024-05-28 08:40:31] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 2 ms to minimize.
[2024-05-28 08:40:31] [INFO ] Deduced a trap composed of 111 places in 216 ms of which 3 ms to minimize.
[2024-05-28 08:40:31] [INFO ] Deduced a trap composed of 77 places in 195 ms of which 3 ms to minimize.
[2024-05-28 08:40:31] [INFO ] Deduced a trap composed of 111 places in 195 ms of which 3 ms to minimize.
[2024-05-28 08:40:32] [INFO ] Deduced a trap composed of 77 places in 216 ms of which 4 ms to minimize.
[2024-05-28 08:40:32] [INFO ] Deduced a trap composed of 77 places in 191 ms of which 3 ms to minimize.
[2024-05-28 08:40:32] [INFO ] Deduced a trap composed of 107 places in 182 ms of which 2 ms to minimize.
[2024-05-28 08:40:32] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 2 ms to minimize.
[2024-05-28 08:40:32] [INFO ] Deduced a trap composed of 81 places in 167 ms of which 2 ms to minimize.
[2024-05-28 08:40:32] [INFO ] Deduced a trap composed of 107 places in 152 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 08:40:34] [INFO ] Deduced a trap composed of 83 places in 217 ms of which 3 ms to minimize.
[2024-05-28 08:40:34] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 3 ms to minimize.
[2024-05-28 08:40:34] [INFO ] Deduced a trap composed of 111 places in 167 ms of which 2 ms to minimize.
[2024-05-28 08:40:34] [INFO ] Deduced a trap composed of 130 places in 214 ms of which 3 ms to minimize.
[2024-05-28 08:40:35] [INFO ] Deduced a trap composed of 115 places in 183 ms of which 3 ms to minimize.
[2024-05-28 08:40:35] [INFO ] Deduced a trap composed of 111 places in 204 ms of which 3 ms to minimize.
[2024-05-28 08:40:35] [INFO ] Deduced a trap composed of 85 places in 173 ms of which 2 ms to minimize.
[2024-05-28 08:40:35] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 3 ms to minimize.
[2024-05-28 08:40:35] [INFO ] Deduced a trap composed of 81 places in 183 ms of which 3 ms to minimize.
[2024-05-28 08:40:36] [INFO ] Deduced a trap composed of 107 places in 202 ms of which 3 ms to minimize.
[2024-05-28 08:40:36] [INFO ] Deduced a trap composed of 77 places in 184 ms of which 3 ms to minimize.
[2024-05-28 08:40:36] [INFO ] Deduced a trap composed of 80 places in 184 ms of which 3 ms to minimize.
[2024-05-28 08:40:36] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 3 ms to minimize.
[2024-05-28 08:40:37] [INFO ] Deduced a trap composed of 77 places in 236 ms of which 3 ms to minimize.
[2024-05-28 08:40:37] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 3 ms to minimize.
[2024-05-28 08:40:37] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 3 ms to minimize.
[2024-05-28 08:40:37] [INFO ] Deduced a trap composed of 89 places in 177 ms of which 3 ms to minimize.
[2024-05-28 08:40:37] [INFO ] Deduced a trap composed of 83 places in 203 ms of which 3 ms to minimize.
[2024-05-28 08:40:38] [INFO ] Deduced a trap composed of 135 places in 189 ms of which 3 ms to minimize.
[2024-05-28 08:40:38] [INFO ] Deduced a trap composed of 81 places in 174 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 08:40:40] [INFO ] Deduced a trap composed of 117 places in 215 ms of which 3 ms to minimize.
[2024-05-28 08:40:41] [INFO ] Deduced a trap composed of 112 places in 182 ms of which 3 ms to minimize.
[2024-05-28 08:40:41] [INFO ] Deduced a trap composed of 112 places in 182 ms of which 3 ms to minimize.
[2024-05-28 08:40:41] [INFO ] Deduced a trap composed of 113 places in 183 ms of which 2 ms to minimize.
[2024-05-28 08:40:41] [INFO ] Deduced a trap composed of 112 places in 160 ms of which 2 ms to minimize.
[2024-05-28 08:40:41] [INFO ] Deduced a trap composed of 116 places in 194 ms of which 3 ms to minimize.
[2024-05-28 08:40:42] [INFO ] Deduced a trap composed of 108 places in 147 ms of which 3 ms to minimize.
[2024-05-28 08:40:42] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 3 ms to minimize.
[2024-05-28 08:40:42] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 3 ms to minimize.
[2024-05-28 08:40:42] [INFO ] Deduced a trap composed of 113 places in 157 ms of which 3 ms to minimize.
[2024-05-28 08:40:42] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 3 ms to minimize.
[2024-05-28 08:40:43] [INFO ] Deduced a trap composed of 111 places in 186 ms of which 3 ms to minimize.
[2024-05-28 08:40:43] [INFO ] Deduced a trap composed of 110 places in 158 ms of which 3 ms to minimize.
[2024-05-28 08:40:43] [INFO ] Deduced a trap composed of 89 places in 194 ms of which 3 ms to minimize.
[2024-05-28 08:40:43] [INFO ] Deduced a trap composed of 84 places in 163 ms of which 3 ms to minimize.
[2024-05-28 08:40:43] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 3 ms to minimize.
[2024-05-28 08:40:44] [INFO ] Deduced a trap composed of 85 places in 192 ms of which 3 ms to minimize.
[2024-05-28 08:40:44] [INFO ] Deduced a trap composed of 112 places in 166 ms of which 3 ms to minimize.
[2024-05-28 08:40:44] [INFO ] Deduced a trap composed of 82 places in 224 ms of which 4 ms to minimize.
[2024-05-28 08:40:44] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/984 variables, and 172 constraints, problems are : Problem set: 0 solved, 571 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/571 constraints, Known Traps: 100/100 constraints]
After SMT, in 40731ms problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 40737ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 40811 ms. Remains : 411/485 places, 577/650 transitions.
[2024-05-28 08:40:47] [INFO ] Flatten gal took : 41 ms
[2024-05-28 08:40:47] [INFO ] Flatten gal took : 35 ms
[2024-05-28 08:40:47] [INFO ] Input system was already deterministic with 577 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 18 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2024-05-28 08:40:47] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
// Phase 1: matrix 645 rows 483 cols
[2024-05-28 08:40:47] [INFO ] Computed 77 invariants in 17 ms
[2024-05-28 08:40:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:41:03] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 3 ms to minimize.
[2024-05-28 08:41:04] [INFO ] Deduced a trap composed of 204 places in 202 ms of which 4 ms to minimize.
[2024-05-28 08:41:04] [INFO ] Deduced a trap composed of 207 places in 173 ms of which 3 ms to minimize.
[2024-05-28 08:41:04] [INFO ] Deduced a trap composed of 196 places in 168 ms of which 4 ms to minimize.
[2024-05-28 08:41:05] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 3 ms to minimize.
[2024-05-28 08:41:05] [INFO ] Deduced a trap composed of 197 places in 161 ms of which 3 ms to minimize.
[2024-05-28 08:41:05] [INFO ] Deduced a trap composed of 206 places in 167 ms of which 3 ms to minimize.
[2024-05-28 08:41:05] [INFO ] Deduced a trap composed of 197 places in 170 ms of which 3 ms to minimize.
[2024-05-28 08:41:05] [INFO ] Deduced a trap composed of 184 places in 152 ms of which 3 ms to minimize.
[2024-05-28 08:41:06] [INFO ] Deduced a trap composed of 206 places in 179 ms of which 3 ms to minimize.
[2024-05-28 08:41:06] [INFO ] Deduced a trap composed of 203 places in 178 ms of which 3 ms to minimize.
[2024-05-28 08:41:06] [INFO ] Deduced a trap composed of 134 places in 205 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 89 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:41:11] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 2 ms to minimize.
[2024-05-28 08:41:11] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 3 ms to minimize.
[2024-05-28 08:41:12] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 2 ms to minimize.
[2024-05-28 08:41:14] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 1 ms to minimize.
[2024-05-28 08:41:14] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 3 ms to minimize.
[2024-05-28 08:41:14] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:41:19] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-28 08:41:19] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-05-28 08:41:19] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 2 ms to minimize.
[2024-05-28 08:41:20] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:41:22] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 2 ms to minimize.
[2024-05-28 08:41:25] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 1 ms to minimize.
[2024-05-28 08:41:25] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 2 ms to minimize.
[2024-05-28 08:41:27] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 1 ms to minimize.
[2024-05-28 08:41:27] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/1128 variables, and 86 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 13/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 15/27 constraints]
After SMT, in 40937ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 40943ms
Finished structural reductions in LTL mode , in 1 iterations and 40964 ms. Remains : 483/485 places, 649/650 transitions.
[2024-05-28 08:41:28] [INFO ] Flatten gal took : 37 ms
[2024-05-28 08:41:28] [INFO ] Flatten gal took : 47 ms
[2024-05-28 08:41:28] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 34 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2024-05-28 08:41:28] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-28 08:41:28] [INFO ] Invariant cache hit.
[2024-05-28 08:41:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:41:45] [INFO ] Deduced a trap composed of 111 places in 328 ms of which 19 ms to minimize.
[2024-05-28 08:41:46] [INFO ] Deduced a trap composed of 109 places in 268 ms of which 3 ms to minimize.
[2024-05-28 08:41:46] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 80 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:41:51] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 3 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
[2024-05-28 08:41:53] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 2 ms to minimize.
[2024-05-28 08:41:54] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 2 ms to minimize.
[2024-05-28 08:41:55] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-28 08:41:55] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-28 08:41:55] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 2 ms to minimize.
[2024-05-28 08:41:57] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-28 08:41:58] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:42:02] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 1 ms to minimize.
[2024-05-28 08:42:03] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 4 ms to minimize.
[2024-05-28 08:42:03] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 2 ms to minimize.
[2024-05-28 08:42:03] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 643 unsolved
(s395 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 9)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 3)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 3)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 10)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 1)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 1)
(s281 0)
(s282 0)
(s284 1)
(s285 1)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 1)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 1)
(s366 1)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 1)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/1128 variables, and 84 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 13/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 13/16 constraints]
After SMT, in 40789ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 40797ms
Finished structural reductions in LTL mode , in 1 iterations and 40833 ms. Remains : 483/485 places, 649/650 transitions.
[2024-05-28 08:42:09] [INFO ] Flatten gal took : 21 ms
[2024-05-28 08:42:09] [INFO ] Flatten gal took : 23 ms
[2024-05-28 08:42:09] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 19 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2024-05-28 08:42:09] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-28 08:42:09] [INFO ] Invariant cache hit.
[2024-05-28 08:42:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:42:25] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 3 ms to minimize.
[2024-05-28 08:42:25] [INFO ] Deduced a trap composed of 109 places in 285 ms of which 4 ms to minimize.
[2024-05-28 08:42:25] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 80 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:42:31] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 2 ms to minimize.
[2024-05-28 08:42:33] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-28 08:42:33] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-05-28 08:42:34] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 3 ms to minimize.
[2024-05-28 08:42:34] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-28 08:42:35] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-05-28 08:42:35] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 2 ms to minimize.
[2024-05-28 08:42:36] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 2 ms to minimize.
[2024-05-28 08:42:37] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:42:41] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-28 08:42:42] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-28 08:42:42] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-05-28 08:42:42] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 5 (OVERLAPS) 6/483 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/1128 variables, and 93 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 16/16 constraints]
After SMT, in 40764ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 40769ms
Finished structural reductions in LTL mode , in 1 iterations and 40791 ms. Remains : 483/485 places, 649/650 transitions.
[2024-05-28 08:42:50] [INFO ] Flatten gal took : 28 ms
[2024-05-28 08:42:50] [INFO ] Flatten gal took : 21 ms
[2024-05-28 08:42:50] [INFO ] Input system was already deterministic with 649 transitions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 650/650 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 483 transition count 649
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 483 transition count 649
Applied a total of 3 rules in 14 ms. Remains 483 /485 variables (removed 2) and now considering 649/650 (removed 1) transitions.
Running 643 sub problems to find dead transitions.
[2024-05-28 08:42:50] [INFO ] Flow matrix only has 645 transitions (discarded 4 similar events)
[2024-05-28 08:42:50] [INFO ] Invariant cache hit.
[2024-05-28 08:42:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 3 (OVERLAPS) 6/483 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:43:04] [INFO ] Deduced a trap composed of 111 places in 275 ms of which 4 ms to minimize.
[2024-05-28 08:43:05] [INFO ] Deduced a trap composed of 109 places in 239 ms of which 4 ms to minimize.
[2024-05-28 08:43:05] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:43:09] [INFO ] Deduced a trap composed of 76 places in 223 ms of which 4 ms to minimize.
[2024-05-28 08:43:10] [INFO ] Deduced a trap composed of 199 places in 146 ms of which 2 ms to minimize.
[2024-05-28 08:43:10] [INFO ] Deduced a trap composed of 197 places in 199 ms of which 3 ms to minimize.
[2024-05-28 08:43:10] [INFO ] Deduced a trap composed of 191 places in 225 ms of which 3 ms to minimize.
[2024-05-28 08:43:10] [INFO ] Deduced a trap composed of 196 places in 204 ms of which 4 ms to minimize.
[2024-05-28 08:43:11] [INFO ] Deduced a trap composed of 199 places in 195 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/1128 variables, and 86 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 643/643 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 643 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 643 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/477 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:43:12] [INFO ] Deduced a trap composed of 77 places in 178 ms of which 3 ms to minimize.
[2024-05-28 08:43:14] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 2 ms to minimize.
[2024-05-28 08:43:14] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2024-05-28 08:43:15] [INFO ] Deduced a trap composed of 77 places in 178 ms of which 3 ms to minimize.
[2024-05-28 08:43:16] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-28 08:43:16] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-05-28 08:43:16] [INFO ] Deduced a trap composed of 77 places in 173 ms of which 2 ms to minimize.
[2024-05-28 08:43:18] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 3 ms to minimize.
[2024-05-28 08:43:19] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 643 unsolved
[2024-05-28 08:43:23] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-28 08:43:23] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-05-28 08:43:23] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-05-28 08:43:24] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 643 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/1128 variables, and 84 constraints, problems are : Problem set: 0 solved, 643 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 13/19 constraints, State Equation: 0/483 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/643 constraints, Known Traps: 13/22 constraints]
After SMT, in 40745ms problems are : Problem set: 0 solved, 643 unsolved
Search for dead transitions found 0 dead transitions in 40752ms
Finished structural reductions in LTL mode , in 1 iterations and 40768 ms. Remains : 483/485 places, 649/650 transitions.
[2024-05-28 08:43:31] [INFO ] Flatten gal took : 20 ms
[2024-05-28 08:43:31] [INFO ] Flatten gal took : 21 ms
[2024-05-28 08:43:31] [INFO ] Input system was already deterministic with 649 transitions.
[2024-05-28 08:43:31] [INFO ] Flatten gal took : 20 ms
[2024-05-28 08:43:31] [INFO ] Flatten gal took : 20 ms
[2024-05-28 08:43:31] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-28 08:43:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 485 places, 650 transitions and 3136 arcs took 6 ms.
Total runtime 360085 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-PT-S05J30

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 485
TRANSITIONS: 650
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.030s, Sys 0.000s]


SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.004s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1540
MODEL NAME: /home/mcc/execution/419/model
485 places, 650 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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="PolyORBNT-PT-S05J30"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBNT-PT-S05J30, 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 r289-tajo-171654446000449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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