About the Execution of GreatSPN+red for PolyORBNT-PT-S05J40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10029.279 | 3600000.00 | 13119850.00 | 261.10 | ?????TF?TTTFF??F | normal |
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-171654446000458.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-S05J40, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000458
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 17K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Apr 12 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 346K Apr 12 09:52 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 28K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 92K 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 46K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 253K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 100K Apr 12 10:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 438K Apr 12 10:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K 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.3M 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-S05J40-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S05J40-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716886257599
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 08:50:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 08:50:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 08:51:00] [INFO ] Load time of PNML (sax parser for PT used): 298 ms
[2024-05-28 08:51:00] [INFO ] Transformed 629 places.
[2024-05-28 08:51:00] [INFO ] Transformed 1590 transitions.
[2024-05-28 08:51:00] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 509 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 47 ms.
[2024-05-28 08:51:00] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 08:51:00] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 08:51:00] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 08:51:00] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 08:51:00] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 08:51:00] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 08:51:00] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 626 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Applied a total of 0 rules in 65 ms. Remains 629 /629 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Running 929 sub problems to find dead transitions.
[2024-05-28 08:51:01] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2024-05-28 08:51:01] [INFO ] Computed 102 invariants in 89 ms
[2024-05-28 08:51:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1560 variables, and 91 constraints, problems are : Problem set: 0 solved, 929 unsolved in 20170 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 929 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/629 variables, 11/102 constraints. Problems are: Problem set: 95 solved, 834 unsolved
[2024-05-28 08:51:39] [INFO ] Deduced a trap composed of 100 places in 235 ms of which 25 ms to minimize.
[2024-05-28 08:51:39] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 12 ms to minimize.
[2024-05-28 08:51:40] [INFO ] Deduced a trap composed of 24 places in 338 ms of which 6 ms to minimize.
[2024-05-28 08:51:41] [INFO ] Deduced a trap composed of 101 places in 341 ms of which 5 ms to minimize.
[2024-05-28 08:51:41] [INFO ] Deduced a trap composed of 16 places in 300 ms of which 5 ms to minimize.
[2024-05-28 08:51:41] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 4 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 Int declared 629/1560 variables, and 108 constraints, problems are : Problem set: 95 solved, 834 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/929 constraints, Known Traps: 6/6 constraints]
After SMT, in 43272ms problems are : Problem set: 95 solved, 834 unsolved
Search for dead transitions found 95 dead transitions in 43344ms
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:51:44] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 629 cols
[2024-05-28 08:51:44] [INFO ] Computed 102 invariants in 37 ms
[2024-05-28 08:51:44] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-28 08:51:44] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-05-28 08:51:44] [INFO ] Invariant cache hit.
[2024-05-28 08:51:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 08:51:45] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1318 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 629/629 places, 840/935 transitions.
Applied a total of 0 rules in 13 ms. Remains 629 /629 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44837 ms. Remains : 629/629 places, 840/935 transitions.
Support contains 626 out of 629 places after structural reductions.
[2024-05-28 08:51:46] [INFO ] Flatten gal took : 183 ms
[2024-05-28 08:51:46] [INFO ] Flatten gal took : 91 ms
[2024-05-28 08:51:46] [INFO ] Input system was already deterministic with 840 transitions.
Reduction of identical properties reduced properties to check from 81 to 78
RANDOM walk for 40000 steps (2745 resets) in 3713 ms. (10 steps per ms) remains 33/78 properties
BEST_FIRST walk for 4004 steps (26 resets) in 417 ms. (9 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (100 resets) in 43 ms. (90 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (14 resets) in 224 ms. (17 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (60 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (100 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (43 resets) in 112 ms. (35 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (120 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (93 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (100 resets) in 84 ms. (47 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (71 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (65 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (48 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (72 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (93 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (67 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
[2024-05-28 08:51:48] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2024-05-28 08:51:48] [INFO ] Invariant cache hit.
[2024-05-28 08:51:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 3 (OVERLAPS) 202/601 variables, 75/77 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 2/79 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 31 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 6 (OVERLAPS) 28/629 variables, 23/102 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 0/102 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 836/1465 variables, 629/731 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1465 variables, 1/732 constraints. Problems are: Problem set: 26 solved, 6 unsolved
[2024-05-28 08:51:51] [INFO ] Deduced a trap composed of 263 places in 318 ms of which 4 ms to minimize.
[2024-05-28 08:51:51] [INFO ] Deduced a trap composed of 27 places in 304 ms of which 4 ms to minimize.
[2024-05-28 08:51:52] [INFO ] Deduced a trap composed of 24 places in 323 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1465 variables, 3/735 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1465 variables, 0/735 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1465 variables, 0/735 constraints. Problems are: Problem set: 26 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1465/1465 variables, and 735 constraints, problems are : Problem set: 26 solved, 6 unsolved in 4832 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 26 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 60/70 variables, 9/9 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 117/187 variables, 2/11 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/11 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 162/349 variables, 27/38 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/38 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 135/484 variables, 27/65 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/65 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 133/617 variables, 26/91 constraints. Problems are: Problem set: 26 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/617 variables, 3/94 constraints. Problems are: Problem set: 26 solved, 6 unsolved
[2024-05-28 08:51:54] [INFO ] Deduced a trap composed of 262 places in 235 ms of which 4 ms to minimize.
[2024-05-28 08:51:54] [INFO ] Deduced a trap composed of 263 places in 288 ms of which 7 ms to minimize.
[2024-05-28 08:51:55] [INFO ] Deduced a trap composed of 281 places in 249 ms of which 5 ms to minimize.
[2024-05-28 08:51:55] [INFO ] Deduced a trap composed of 262 places in 246 ms of which 4 ms to minimize.
[2024-05-28 08:51:55] [INFO ] Deduced a trap composed of 270 places in 260 ms of which 4 ms to minimize.
[2024-05-28 08:51:55] [INFO ] Deduced a trap composed of 260 places in 244 ms of which 4 ms to minimize.
[2024-05-28 08:51:56] [INFO ] Deduced a trap composed of 260 places in 256 ms of which 4 ms to minimize.
[2024-05-28 08:51:56] [INFO ] Deduced a trap composed of 267 places in 400 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/617 variables, 8/102 constraints. Problems are: Problem set: 26 solved, 6 unsolved
[2024-05-28 08:51:56] [INFO ] Deduced a trap composed of 256 places in 270 ms of which 5 ms to minimize.
[2024-05-28 08:51:57] [INFO ] Deduced a trap composed of 254 places in 219 ms of which 3 ms to minimize.
[2024-05-28 08:51:57] [INFO ] Deduced a trap composed of 274 places in 249 ms of which 5 ms to minimize.
[2024-05-28 08:51:57] [INFO ] Deduced a trap composed of 267 places in 252 ms of which 4 ms to minimize.
[2024-05-28 08:51:58] [INFO ] Deduced a trap composed of 254 places in 255 ms of which 4 ms to minimize.
[2024-05-28 08:51:58] [INFO ] Deduced a trap composed of 287 places in 273 ms of which 4 ms to minimize.
[2024-05-28 08:51:58] [INFO ] Deduced a trap composed of 260 places in 274 ms of which 5 ms to minimize.
[2024-05-28 08:51:58] [INFO ] Deduced a trap composed of 292 places in 267 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1465 variables, and 110 constraints, problems are : Problem set: 26 solved, 6 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 65/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/629 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/32 constraints, Known Traps: 19/19 constraints]
After SMT, in 10374ms problems are : Problem set: 26 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 799
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 88 place count 583 transition count 798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 582 transition count 798
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 89 place count 582 transition count 754
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 177 place count 538 transition count 754
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 537 transition count 753
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 537 transition count 753
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 535 transition count 751
Applied a total of 183 rules in 197 ms. Remains 535 /629 variables (removed 94) and now considering 751/840 (removed 89) transitions.
Running 745 sub problems to find dead transitions.
[2024-05-28 08:51:59] [INFO ] Flow matrix only has 747 transitions (discarded 4 similar events)
// Phase 1: matrix 747 rows 535 cols
[2024-05-28 08:51:59] [INFO ] Computed 97 invariants in 20 ms
[2024-05-28 08:51:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-28 08:52:06] [INFO ] Deduced a trap composed of 165 places in 237 ms of which 4 ms to minimize.
[2024-05-28 08:52:07] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 3 ms to minimize.
[2024-05-28 08:52:07] [INFO ] Deduced a trap composed of 141 places in 205 ms of which 4 ms to minimize.
[2024-05-28 08:52:07] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 8 ms to minimize.
[2024-05-28 08:52:07] [INFO ] Deduced a trap composed of 148 places in 216 ms of which 4 ms to minimize.
[2024-05-28 08:52:08] [INFO ] Deduced a trap composed of 141 places in 232 ms of which 4 ms to minimize.
[2024-05-28 08:52:08] [INFO ] Deduced a trap composed of 171 places in 208 ms of which 3 ms to minimize.
[2024-05-28 08:52:08] [INFO ] Deduced a trap composed of 179 places in 209 ms of which 4 ms to minimize.
[2024-05-28 08:52:08] [INFO ] Deduced a trap composed of 148 places in 203 ms of which 4 ms to minimize.
[2024-05-28 08:52:08] [INFO ] Deduced a trap composed of 153 places in 213 ms of which 7 ms to minimize.
[2024-05-28 08:52:09] [INFO ] Deduced a trap composed of 147 places in 185 ms of which 3 ms to minimize.
[2024-05-28 08:52:09] [INFO ] Deduced a trap composed of 169 places in 185 ms of which 3 ms to minimize.
[2024-05-28 08:52:09] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 4 ms to minimize.
[2024-05-28 08:52:09] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 3 ms to minimize.
[2024-05-28 08:52:10] [INFO ] Deduced a trap composed of 146 places in 178 ms of which 4 ms to minimize.
[2024-05-28 08:52:10] [INFO ] Deduced a trap composed of 145 places in 250 ms of which 22 ms to minimize.
[2024-05-28 08:52:10] [INFO ] Deduced a trap composed of 180 places in 173 ms of which 3 ms to minimize.
[2024-05-28 08:52:10] [INFO ] Deduced a trap composed of 149 places in 217 ms of which 4 ms to minimize.
[2024-05-28 08:52:11] [INFO ] Deduced a trap composed of 172 places in 201 ms of which 3 ms to minimize.
[2024-05-28 08:52:11] [INFO ] Deduced a trap composed of 180 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-28 08:52:12] [INFO ] Deduced a trap composed of 145 places in 223 ms of which 4 ms to minimize.
[2024-05-28 08:52:12] [INFO ] Deduced a trap composed of 145 places in 208 ms of which 4 ms to minimize.
[2024-05-28 08:52:13] [INFO ] Deduced a trap composed of 150 places in 212 ms of which 4 ms to minimize.
[2024-05-28 08:52:13] [INFO ] Deduced a trap composed of 146 places in 187 ms of which 3 ms to minimize.
[2024-05-28 08:52:13] [INFO ] Deduced a trap composed of 141 places in 179 ms of which 3 ms to minimize.
[2024-05-28 08:52:13] [INFO ] Deduced a trap composed of 145 places in 223 ms of which 4 ms to minimize.
[2024-05-28 08:52:13] [INFO ] Deduced a trap composed of 141 places in 207 ms of which 4 ms to minimize.
[2024-05-28 08:52:14] [INFO ] Deduced a trap composed of 148 places in 205 ms of which 4 ms to minimize.
[2024-05-28 08:52:14] [INFO ] Deduced a trap composed of 159 places in 218 ms of which 4 ms to minimize.
[2024-05-28 08:52:14] [INFO ] Deduced a trap composed of 170 places in 234 ms of which 6 ms to minimize.
[2024-05-28 08:52:14] [INFO ] Deduced a trap composed of 180 places in 202 ms of which 3 ms to minimize.
[2024-05-28 08:52:15] [INFO ] Deduced a trap composed of 163 places in 221 ms of which 4 ms to minimize.
[2024-05-28 08:52:15] [INFO ] Deduced a trap composed of 172 places in 224 ms of which 3 ms to minimize.
[2024-05-28 08:52:15] [INFO ] Deduced a trap composed of 171 places in 197 ms of which 3 ms to minimize.
[2024-05-28 08:52:15] [INFO ] Deduced a trap composed of 147 places in 231 ms of which 4 ms to minimize.
[2024-05-28 08:52:15] [INFO ] Deduced a trap composed of 179 places in 208 ms of which 4 ms to minimize.
[2024-05-28 08:52:16] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 4 ms to minimize.
[2024-05-28 08:52:16] [INFO ] Deduced a trap composed of 178 places in 224 ms of which 3 ms to minimize.
[2024-05-28 08:52:16] [INFO ] Deduced a trap composed of 154 places in 266 ms of which 5 ms to minimize.
[2024-05-28 08:52:17] [INFO ] Deduced a trap composed of 148 places in 232 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1282 variables, and 132 constraints, problems are : Problem set: 0 solved, 745 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/535 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 745 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 745 unsolved
[2024-05-28 08:52:23] [INFO ] Deduced a trap composed of 184 places in 219 ms of which 4 ms to minimize.
[2024-05-28 08:52:23] [INFO ] Deduced a trap composed of 180 places in 177 ms of which 3 ms to minimize.
[2024-05-28 08:52:24] [INFO ] Deduced a trap composed of 196 places in 190 ms of which 3 ms to minimize.
[2024-05-28 08:52:24] [INFO ] Deduced a trap composed of 163 places in 214 ms of which 4 ms to minimize.
[2024-05-28 08:52:24] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 4 ms to minimize.
[2024-05-28 08:52:24] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 3 ms to minimize.
[2024-05-28 08:52:25] [INFO ] Deduced a trap composed of 179 places in 249 ms of which 4 ms to minimize.
[2024-05-28 08:52:25] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 3 ms to minimize.
[2024-05-28 08:52:25] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 3 ms to minimize.
[2024-05-28 08:52:25] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 4 ms to minimize.
[2024-05-28 08:52:25] [INFO ] Deduced a trap composed of 169 places in 225 ms of which 3 ms to minimize.
[2024-05-28 08:52:26] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-28 08:52:26] [INFO ] Deduced a trap composed of 141 places in 239 ms of which 4 ms to minimize.
[2024-05-28 08:52:26] [INFO ] Deduced a trap composed of 141 places in 226 ms of which 4 ms to minimize.
[2024-05-28 08:52:26] [INFO ] Deduced a trap composed of 145 places in 228 ms of which 3 ms to minimize.
[2024-05-28 08:52:27] [INFO ] Deduced a trap composed of 142 places in 218 ms of which 3 ms to minimize.
[2024-05-28 08:52:27] [INFO ] Deduced a trap composed of 145 places in 195 ms of which 3 ms to minimize.
[2024-05-28 08:52:27] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 3 ms to minimize.
[2024-05-28 08:52:27] [INFO ] Deduced a trap composed of 141 places in 195 ms of which 3 ms to minimize.
[2024-05-28 08:52:27] [INFO ] Deduced a trap composed of 141 places in 199 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1282 variables, and 152 constraints, problems are : Problem set: 0 solved, 745 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/535 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/745 constraints, Known Traps: 60/60 constraints]
After SMT, in 41730ms problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 41743ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41944 ms. Remains : 535/629 places, 751/840 transitions.
RANDOM walk for 40000 steps (2069 resets) in 1226 ms. (32 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (162 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
[2024-05-28 08:52:41] [INFO ] Flow matrix only has 747 transitions (discarded 4 similar events)
[2024-05-28 08:52:41] [INFO ] Invariant cache hit.
[2024-05-28 08:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/245 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 264/509 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 08:52:41] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/534 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 747/1281 variables, 534/632 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1281 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1281 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1282 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1282 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1282 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1282/1282 variables, and 634 constraints, problems are : Problem set: 0 solved, 1 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 535/535 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 236/245 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 264/509 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/534 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 08:52:42] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 4 ms to minimize.
[2024-05-28 08:52:42] [INFO ] Deduced a trap composed of 151 places in 198 ms of which 3 ms to minimize.
[2024-05-28 08:52:42] [INFO ] Deduced a trap composed of 175 places in 195 ms of which 3 ms to minimize.
[2024-05-28 08:52:43] [INFO ] Deduced a trap composed of 172 places in 231 ms of which 4 ms to minimize.
[2024-05-28 08:52:43] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 3 ms to minimize.
[2024-05-28 08:52:43] [INFO ] Deduced a trap composed of 93 places in 199 ms of which 2 ms to minimize.
[2024-05-28 08:52:43] [INFO ] Deduced a trap composed of 163 places in 173 ms of which 3 ms to minimize.
[2024-05-28 08:52:43] [INFO ] Deduced a trap composed of 177 places in 171 ms of which 3 ms to minimize.
[2024-05-28 08:52:44] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 3 ms to minimize.
[2024-05-28 08:52:44] [INFO ] Deduced a trap composed of 163 places in 188 ms of which 3 ms to minimize.
[2024-05-28 08:52:44] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 4 ms to minimize.
[2024-05-28 08:52:44] [INFO ] Deduced a trap composed of 175 places in 174 ms of which 3 ms to minimize.
[2024-05-28 08:52:44] [INFO ] Deduced a trap composed of 181 places in 169 ms of which 3 ms to minimize.
[2024-05-28 08:52:45] [INFO ] Deduced a trap composed of 184 places in 178 ms of which 3 ms to minimize.
[2024-05-28 08:52:45] [INFO ] Deduced a trap composed of 178 places in 200 ms of which 2 ms to minimize.
[2024-05-28 08:52:45] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 5 ms to minimize.
[2024-05-28 08:52:45] [INFO ] Deduced a trap composed of 175 places in 246 ms of which 4 ms to minimize.
[2024-05-28 08:52:45] [INFO ] Deduced a trap composed of 169 places in 208 ms of which 3 ms to minimize.
[2024-05-28 08:52:46] [INFO ] Deduced a trap composed of 181 places in 203 ms of which 3 ms to minimize.
[2024-05-28 08:52:46] [INFO ] Deduced a trap composed of 169 places in 352 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 08:52:46] [INFO ] Deduced a trap composed of 181 places in 359 ms of which 5 ms to minimize.
[2024-05-28 08:52:47] [INFO ] Deduced a trap composed of 169 places in 226 ms of which 4 ms to minimize.
[2024-05-28 08:52:47] [INFO ] Deduced a trap composed of 172 places in 353 ms of which 4 ms to minimize.
[2024-05-28 08:52:47] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 3 ms to minimize.
[2024-05-28 08:52:48] [INFO ] Deduced a trap composed of 181 places in 209 ms of which 3 ms to minimize.
[2024-05-28 08:52:48] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 3 ms to minimize.
[2024-05-28 08:52:48] [INFO ] Deduced a trap composed of 187 places in 316 ms of which 3 ms to minimize.
[2024-05-28 08:52:48] [INFO ] Deduced a trap composed of 172 places in 267 ms of which 4 ms to minimize.
[2024-05-28 08:52:49] [INFO ] Deduced a trap composed of 181 places in 245 ms of which 4 ms to minimize.
[2024-05-28 08:52:49] [INFO ] Deduced a trap composed of 163 places in 216 ms of which 3 ms to minimize.
[2024-05-28 08:52:49] [INFO ] Deduced a trap composed of 160 places in 313 ms of which 19 ms to minimize.
[2024-05-28 08:52:50] [INFO ] Deduced a trap composed of 130 places in 383 ms of which 7 ms to minimize.
[2024-05-28 08:52:50] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 3 ms to minimize.
[2024-05-28 08:52:50] [INFO ] Deduced a trap composed of 172 places in 212 ms of which 4 ms to minimize.
[2024-05-28 08:52:51] [INFO ] Deduced a trap composed of 185 places in 323 ms of which 19 ms to minimize.
[2024-05-28 08:52:51] [INFO ] Deduced a trap composed of 160 places in 314 ms of which 6 ms to minimize.
[2024-05-28 08:52:51] [INFO ] Deduced a trap composed of 93 places in 313 ms of which 6 ms to minimize.
[2024-05-28 08:52:52] [INFO ] Deduced a trap composed of 181 places in 331 ms of which 33 ms to minimize.
[2024-05-28 08:52:52] [INFO ] Deduced a trap composed of 93 places in 283 ms of which 3 ms to minimize.
[2024-05-28 08:52:52] [INFO ] Deduced a trap composed of 184 places in 204 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 08:52:52] [INFO ] Deduced a trap composed of 175 places in 243 ms of which 3 ms to minimize.
[2024-05-28 08:52:53] [INFO ] Deduced a trap composed of 184 places in 177 ms of which 3 ms to minimize.
[2024-05-28 08:52:53] [INFO ] Deduced a trap composed of 176 places in 177 ms of which 3 ms to minimize.
[2024-05-28 08:52:53] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 3 ms to minimize.
[2024-05-28 08:52:53] [INFO ] Deduced a trap composed of 189 places in 242 ms of which 4 ms to minimize.
[2024-05-28 08:52:54] [INFO ] Deduced a trap composed of 180 places in 315 ms of which 19 ms to minimize.
[2024-05-28 08:52:54] [INFO ] Deduced a trap composed of 178 places in 266 ms of which 6 ms to minimize.
[2024-05-28 08:52:54] [INFO ] Deduced a trap composed of 172 places in 308 ms of which 5 ms to minimize.
[2024-05-28 08:52:55] [INFO ] Deduced a trap composed of 181 places in 225 ms of which 3 ms to minimize.
[2024-05-28 08:52:55] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 5 ms to minimize.
[2024-05-28 08:52:55] [INFO ] Deduced a trap composed of 185 places in 235 ms of which 4 ms to minimize.
[2024-05-28 08:52:56] [INFO ] Deduced a trap composed of 183 places in 222 ms of which 4 ms to minimize.
[2024-05-28 08:52:56] [INFO ] Deduced a trap composed of 176 places in 291 ms of which 4 ms to minimize.
[2024-05-28 08:52:57] [INFO ] Deduced a trap composed of 169 places in 316 ms of which 5 ms to minimize.
[2024-05-28 08:52:57] [INFO ] Deduced a trap composed of 169 places in 280 ms of which 4 ms to minimize.
[2024-05-28 08:52:58] [INFO ] Deduced a trap composed of 161 places in 325 ms of which 4 ms to minimize.
[2024-05-28 08:52:58] [INFO ] Deduced a trap composed of 160 places in 298 ms of which 3 ms to minimize.
[2024-05-28 08:52:59] [INFO ] Deduced a trap composed of 172 places in 274 ms of which 5 ms to minimize.
[2024-05-28 08:52:59] [INFO ] Deduced a trap composed of 172 places in 281 ms of which 3 ms to minimize.
[2024-05-28 08:53:00] [INFO ] Deduced a trap composed of 169 places in 269 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 08:53:00] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 4 ms to minimize.
[2024-05-28 08:53:00] [INFO ] Deduced a trap composed of 169 places in 226 ms of which 3 ms to minimize.
[2024-05-28 08:53:01] [INFO ] Deduced a trap composed of 175 places in 276 ms of which 3 ms to minimize.
[2024-05-28 08:53:01] [INFO ] Deduced a trap composed of 177 places in 246 ms of which 3 ms to minimize.
[2024-05-28 08:53:01] [INFO ] Deduced a trap composed of 199 places in 256 ms of which 3 ms to minimize.
[2024-05-28 08:53:01] [INFO ] Deduced a trap composed of 172 places in 316 ms of which 4 ms to minimize.
[2024-05-28 08:53:02] [INFO ] Deduced a trap composed of 172 places in 323 ms of which 4 ms to minimize.
[2024-05-28 08:53:02] [INFO ] Deduced a trap composed of 175 places in 264 ms of which 4 ms to minimize.
[2024-05-28 08:53:03] [INFO ] Deduced a trap composed of 172 places in 274 ms of which 4 ms to minimize.
[2024-05-28 08:53:03] [INFO ] Deduced a trap composed of 157 places in 303 ms of which 6 ms to minimize.
[2024-05-28 08:53:04] [INFO ] Deduced a trap composed of 157 places in 259 ms of which 4 ms to minimize.
[2024-05-28 08:53:05] [INFO ] Deduced a trap composed of 172 places in 310 ms of which 4 ms to minimize.
[2024-05-28 08:53:05] [INFO ] Deduced a trap composed of 166 places in 248 ms of which 3 ms to minimize.
[2024-05-28 08:53:05] [INFO ] Deduced a trap composed of 157 places in 200 ms of which 3 ms to minimize.
[2024-05-28 08:53:06] [INFO ] Deduced a trap composed of 184 places in 259 ms of which 3 ms to minimize.
[2024-05-28 08:53:06] [INFO ] Deduced a trap composed of 93 places in 202 ms of which 3 ms to minimize.
[2024-05-28 08:53:07] [INFO ] Deduced a trap composed of 169 places in 310 ms of which 4 ms to minimize.
[2024-05-28 08:53:07] [INFO ] Deduced a trap composed of 169 places in 262 ms of which 4 ms to minimize.
[2024-05-28 08:53:07] [INFO ] Deduced a trap composed of 172 places in 224 ms of which 3 ms to minimize.
[2024-05-28 08:53:08] [INFO ] Deduced a trap composed of 184 places in 227 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 08:53:08] [INFO ] Deduced a trap composed of 149 places in 221 ms of which 4 ms to minimize.
[2024-05-28 08:53:08] [INFO ] Deduced a trap composed of 169 places in 251 ms of which 3 ms to minimize.
[2024-05-28 08:53:08] [INFO ] Deduced a trap composed of 178 places in 243 ms of which 4 ms to minimize.
[2024-05-28 08:53:09] [INFO ] Deduced a trap composed of 160 places in 239 ms of which 3 ms to minimize.
[2024-05-28 08:53:09] [INFO ] Deduced a trap composed of 166 places in 259 ms of which 3 ms to minimize.
[2024-05-28 08:53:09] [INFO ] Deduced a trap composed of 187 places in 221 ms of which 4 ms to minimize.
[2024-05-28 08:53:10] [INFO ] Deduced a trap composed of 166 places in 222 ms of which 4 ms to minimize.
[2024-05-28 08:53:10] [INFO ] Deduced a trap composed of 166 places in 270 ms of which 4 ms to minimize.
[2024-05-28 08:53:11] [INFO ] Deduced a trap composed of 166 places in 263 ms of which 4 ms to minimize.
[2024-05-28 08:53:11] [INFO ] Deduced a trap composed of 170 places in 248 ms of which 3 ms to minimize.
[2024-05-28 08:53:11] [INFO ] Deduced a trap composed of 181 places in 243 ms of which 4 ms to minimize.
[2024-05-28 08:53:14] [INFO ] Deduced a trap composed of 166 places in 288 ms of which 4 ms to minimize.
[2024-05-28 08:53:15] [INFO ] Deduced a trap composed of 169 places in 278 ms of which 4 ms to minimize.
[2024-05-28 08:53:15] [INFO ] Deduced a trap composed of 167 places in 240 ms of which 4 ms to minimize.
[2024-05-28 08:53:16] [INFO ] Deduced a trap composed of 182 places in 341 ms of which 7 ms to minimize.
[2024-05-28 08:53:17] [INFO ] Deduced a trap composed of 190 places in 335 ms of which 4 ms to minimize.
[2024-05-28 08:53:18] [INFO ] Deduced a trap composed of 163 places in 266 ms of which 3 ms to minimize.
[2024-05-28 08:53:18] [INFO ] Deduced a trap composed of 176 places in 299 ms of which 4 ms to minimize.
[2024-05-28 08:53:20] [INFO ] Deduced a trap composed of 163 places in 235 ms of which 3 ms to minimize.
[2024-05-28 08:53:20] [INFO ] Deduced a trap composed of 176 places in 284 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 08:53:20] [INFO ] Deduced a trap composed of 178 places in 240 ms of which 3 ms to minimize.
[2024-05-28 08:53:21] [INFO ] Deduced a trap composed of 181 places in 308 ms of which 7 ms to minimize.
[2024-05-28 08:53:21] [INFO ] Deduced a trap composed of 185 places in 280 ms of which 3 ms to minimize.
[2024-05-28 08:53:21] [INFO ] Deduced a trap composed of 169 places in 258 ms of which 3 ms to minimize.
[2024-05-28 08:53:22] [INFO ] Deduced a trap composed of 170 places in 298 ms of which 3 ms to minimize.
[2024-05-28 08:53:22] [INFO ] Deduced a trap composed of 169 places in 269 ms of which 3 ms to minimize.
[2024-05-28 08:53:23] [INFO ] Deduced a trap composed of 172 places in 266 ms of which 3 ms to minimize.
[2024-05-28 08:53:23] [INFO ] Deduced a trap composed of 188 places in 258 ms of which 4 ms to minimize.
[2024-05-28 08:53:23] [INFO ] Deduced a trap composed of 169 places in 266 ms of which 4 ms to minimize.
[2024-05-28 08:53:24] [INFO ] Deduced a trap composed of 173 places in 284 ms of which 3 ms to minimize.
[2024-05-28 08:53:24] [INFO ] Deduced a trap composed of 168 places in 314 ms of which 4 ms to minimize.
[2024-05-28 08:53:26] [INFO ] Deduced a trap composed of 176 places in 268 ms of which 4 ms to minimize.
[2024-05-28 08:53:27] [INFO ] Deduced a trap composed of 179 places in 400 ms of which 7 ms to minimize.
SMT process timed out in 45999ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 535 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 535/535 places, 751/751 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 535 transition count 746
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 530 transition count 746
Applied a total of 10 rules in 104 ms. Remains 530 /535 variables (removed 5) and now considering 746/751 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 530/535 places, 746/751 transitions.
Successfully simplified 26 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 08:53:27] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 08:53:27] [INFO ] Flatten gal took : 127 ms
[2024-05-28 08:53:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 08:53:27] [INFO ] Flatten gal took : 110 ms
[2024-05-28 08:53:27] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 151 out of 629 places (down from 441) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 51 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-05-28 08:53:28] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-05-28 08:53:28] [INFO ] Computed 97 invariants in 12 ms
[2024-05-28 08:53:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 08:53:51] [INFO ] Deduced a trap composed of 97 places in 189 ms of which 4 ms to minimize.
[2024-05-28 08:53:51] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 2 ms to minimize.
[2024-05-28 08:53:56] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 7 ms to minimize.
[2024-05-28 08:53:57] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-28 08:53:57] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 1 ms to minimize.
[2024-05-28 08:53:57] [INFO ] Deduced a trap composed of 97 places in 253 ms of which 6 ms to minimize.
[2024-05-28 08:54:00] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 7 ms to minimize.
[2024-05-28 08:54:00] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-28 08:54:00] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 4 ms to minimize.
[2024-05-28 08:54:00] [INFO ] Deduced a trap composed of 97 places in 163 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 08:54:05] [INFO ] Deduced a trap composed of 97 places in 174 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41598ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41622ms
Finished structural reductions in LTL mode , in 1 iterations and 41676 ms. Remains : 623/629 places, 839/840 transitions.
[2024-05-28 08:54:09] [INFO ] Flatten gal took : 40 ms
[2024-05-28 08:54:09] [INFO ] Flatten gal took : 40 ms
[2024-05-28 08:54:09] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Applied a total of 5 rules in 28 ms. Remains 624 /629 variables (removed 5) and now considering 840/840 (removed 0) transitions.
Running 834 sub problems to find dead transitions.
[2024-05-28 08:54:10] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2024-05-28 08:54:10] [INFO ] Computed 97 invariants in 12 ms
[2024-05-28 08:54:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 3 (OVERLAPS) 6/624 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 624/1460 variables, and 97 constraints, problems are : Problem set: 0 solved, 834 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/624 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 834/834 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 834 unsolved
[2024-05-28 08:54:38] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-28 08:54:38] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-05-28 08:54:39] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 2 ms to minimize.
[2024-05-28 08:54:40] [INFO ] Deduced a trap composed of 97 places in 190 ms of which 3 ms to minimize.
[2024-05-28 08:54:40] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-28 08:54:42] [INFO ] Deduced a trap composed of 97 places in 201 ms of which 4 ms to minimize.
[2024-05-28 08:54:42] [INFO ] Deduced a trap composed of 97 places in 206 ms of which 3 ms to minimize.
[2024-05-28 08:54:49] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-28 08:54:50] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 2 ms to minimize.
[2024-05-28 08:54:50] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-28 08:54:51] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-28 08:54:51] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 2 ms to minimize.
[2024-05-28 08:54:52] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 2 ms to minimize.
SMT process timed out in 42061ms, After SMT, problems are : Problem set: 0 solved, 834 unsolved
Search for dead transitions found 0 dead transitions in 42073ms
Finished structural reductions in LTL mode , in 1 iterations and 42103 ms. Remains : 624/629 places, 840/840 transitions.
[2024-05-28 08:54:52] [INFO ] Flatten gal took : 44 ms
[2024-05-28 08:54:52] [INFO ] Flatten gal took : 44 ms
[2024-05-28 08:54:52] [INFO ] Input system was already deterministic with 840 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 27 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-05-28 08:54:52] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-05-28 08:54:52] [INFO ] Computed 97 invariants in 17 ms
[2024-05-28 08:54:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 08:55:15] [INFO ] Deduced a trap composed of 97 places in 163 ms of which 3 ms to minimize.
[2024-05-28 08:55:15] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 5 ms to minimize.
[2024-05-28 08:55:20] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 2 ms to minimize.
[2024-05-28 08:55:20] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-05-28 08:55:20] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-05-28 08:55:20] [INFO ] Deduced a trap composed of 97 places in 178 ms of which 2 ms to minimize.
[2024-05-28 08:55:23] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 2 ms to minimize.
[2024-05-28 08:55:23] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-05-28 08:55:23] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-28 08:55:24] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 08:55:29] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41595ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41618ms
Finished structural reductions in LTL mode , in 1 iterations and 41660 ms. Remains : 623/629 places, 839/840 transitions.
[2024-05-28 08:55:34] [INFO ] Flatten gal took : 61 ms
[2024-05-28 08:55:34] [INFO ] Flatten gal took : 96 ms
[2024-05-28 08:55:34] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 45 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-05-28 08:55:34] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2024-05-28 08:55:34] [INFO ] Invariant cache hit.
[2024-05-28 08:55:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 08:55:57] [INFO ] Deduced a trap composed of 97 places in 204 ms of which 2 ms to minimize.
[2024-05-28 08:55:58] [INFO ] Deduced a trap composed of 97 places in 210 ms of which 5 ms to minimize.
[2024-05-28 08:55:58] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 3 ms to minimize.
[2024-05-28 08:56:03] [INFO ] Deduced a trap composed of 98 places in 294 ms of which 21 ms to minimize.
[2024-05-28 08:56:05] [INFO ] Deduced a trap composed of 97 places in 163 ms of which 4 ms to minimize.
[2024-05-28 08:56:06] [INFO ] Deduced a trap composed of 97 places in 198 ms of which 3 ms to minimize.
[2024-05-28 08:56:06] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 2 ms to minimize.
[2024-05-28 08:56:06] [INFO ] Deduced a trap composed of 97 places in 162 ms of which 5 ms to minimize.
[2024-05-28 08:56:07] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-05-28 08:56:07] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-28 08:56:07] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-05-28 08:56:07] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 5 ms to minimize.
[2024-05-28 08:56:08] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 4 ms to minimize.
[2024-05-28 08:56:08] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 3 ms to minimize.
[2024-05-28 08:56:09] [INFO ] Deduced a trap composed of 97 places in 251 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 08:56:10] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 107 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 16/16 constraints]
After SMT, in 41378ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41388ms
Finished structural reductions in LTL mode , in 1 iterations and 41445 ms. Remains : 623/629 places, 839/840 transitions.
[2024-05-28 08:56:15] [INFO ] Flatten gal took : 29 ms
[2024-05-28 08:56:15] [INFO ] Flatten gal took : 30 ms
[2024-05-28 08:56:15] [INFO ] Input system was already deterministic with 839 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 90 place count 579 transition count 752
Deduced a syphon composed of 43 places in 14 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 176 place count 536 transition count 752
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 535 transition count 751
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 535 transition count 751
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 182 place count 533 transition count 749
Applied a total of 182 rules in 148 ms. Remains 533 /629 variables (removed 96) and now considering 749/840 (removed 91) transitions.
Running 743 sub problems to find dead transitions.
[2024-05-28 08:56:16] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2024-05-28 08:56:16] [INFO ] Computed 97 invariants in 15 ms
[2024-05-28 08:56:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 08:56:23] [INFO ] Deduced a trap composed of 166 places in 326 ms of which 9 ms to minimize.
[2024-05-28 08:56:23] [INFO ] Deduced a trap composed of 164 places in 298 ms of which 5 ms to minimize.
[2024-05-28 08:56:23] [INFO ] Deduced a trap composed of 157 places in 323 ms of which 19 ms to minimize.
[2024-05-28 08:56:24] [INFO ] Deduced a trap composed of 169 places in 317 ms of which 9 ms to minimize.
[2024-05-28 08:56:24] [INFO ] Deduced a trap composed of 139 places in 307 ms of which 9 ms to minimize.
[2024-05-28 08:56:24] [INFO ] Deduced a trap composed of 139 places in 329 ms of which 33 ms to minimize.
[2024-05-28 08:56:25] [INFO ] Deduced a trap composed of 139 places in 310 ms of which 6 ms to minimize.
[2024-05-28 08:56:25] [INFO ] Deduced a trap composed of 139 places in 307 ms of which 6 ms to minimize.
[2024-05-28 08:56:25] [INFO ] Deduced a trap composed of 139 places in 283 ms of which 3 ms to minimize.
[2024-05-28 08:56:26] [INFO ] Deduced a trap composed of 139 places in 219 ms of which 4 ms to minimize.
[2024-05-28 08:56:26] [INFO ] Deduced a trap composed of 139 places in 307 ms of which 8 ms to minimize.
[2024-05-28 08:56:26] [INFO ] Deduced a trap composed of 139 places in 309 ms of which 6 ms to minimize.
[2024-05-28 08:56:27] [INFO ] Deduced a trap composed of 139 places in 295 ms of which 6 ms to minimize.
[2024-05-28 08:56:27] [INFO ] Deduced a trap composed of 139 places in 285 ms of which 6 ms to minimize.
[2024-05-28 08:56:27] [INFO ] Deduced a trap composed of 139 places in 319 ms of which 6 ms to minimize.
[2024-05-28 08:56:27] [INFO ] Deduced a trap composed of 175 places in 229 ms of which 4 ms to minimize.
[2024-05-28 08:56:28] [INFO ] Deduced a trap composed of 139 places in 293 ms of which 6 ms to minimize.
[2024-05-28 08:56:28] [INFO ] Deduced a trap composed of 139 places in 308 ms of which 6 ms to minimize.
[2024-05-28 08:56:28] [INFO ] Deduced a trap composed of 139 places in 301 ms of which 11 ms to minimize.
[2024-05-28 08:56:29] [INFO ] Deduced a trap composed of 139 places in 310 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 08:56:30] [INFO ] Deduced a trap composed of 139 places in 325 ms of which 8 ms to minimize.
[2024-05-28 08:56:30] [INFO ] Deduced a trap composed of 139 places in 298 ms of which 3 ms to minimize.
[2024-05-28 08:56:31] [INFO ] Deduced a trap composed of 139 places in 371 ms of which 4 ms to minimize.
[2024-05-28 08:56:31] [INFO ] Deduced a trap composed of 143 places in 220 ms of which 4 ms to minimize.
[2024-05-28 08:56:31] [INFO ] Deduced a trap composed of 139 places in 239 ms of which 3 ms to minimize.
[2024-05-28 08:56:31] [INFO ] Deduced a trap composed of 139 places in 237 ms of which 3 ms to minimize.
[2024-05-28 08:56:32] [INFO ] Deduced a trap composed of 139 places in 192 ms of which 3 ms to minimize.
[2024-05-28 08:56:32] [INFO ] Deduced a trap composed of 139 places in 205 ms of which 3 ms to minimize.
[2024-05-28 08:56:32] [INFO ] Deduced a trap composed of 139 places in 217 ms of which 4 ms to minimize.
[2024-05-28 08:56:32] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 3 ms to minimize.
[2024-05-28 08:56:32] [INFO ] Deduced a trap composed of 139 places in 215 ms of which 3 ms to minimize.
[2024-05-28 08:56:33] [INFO ] Deduced a trap composed of 139 places in 315 ms of which 18 ms to minimize.
[2024-05-28 08:56:33] [INFO ] Deduced a trap composed of 139 places in 316 ms of which 18 ms to minimize.
[2024-05-28 08:56:33] [INFO ] Deduced a trap composed of 139 places in 250 ms of which 4 ms to minimize.
[2024-05-28 08:56:34] [INFO ] Deduced a trap composed of 139 places in 252 ms of which 4 ms to minimize.
[2024-05-28 08:56:34] [INFO ] Deduced a trap composed of 176 places in 301 ms of which 6 ms to minimize.
[2024-05-28 08:56:34] [INFO ] Deduced a trap composed of 174 places in 319 ms of which 6 ms to minimize.
[2024-05-28 08:56:35] [INFO ] Deduced a trap composed of 178 places in 233 ms of which 3 ms to minimize.
[2024-05-28 08:56:35] [INFO ] Deduced a trap composed of 139 places in 210 ms of which 3 ms to minimize.
[2024-05-28 08:56:35] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 743 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/1278 variables, and 132 constraints, problems are : Problem set: 0 solved, 743 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/533 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 743/743 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 743 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 743 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 743 unsolved
[2024-05-28 08:56:49] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-28 08:56:50] [INFO ] Deduced a trap composed of 19 places in 429 ms of which 7 ms to minimize.
[2024-05-28 08:56:53] [INFO ] Deduced a trap composed of 121 places in 294 ms of which 4 ms to minimize.
[2024-05-28 08:56:53] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 3 ms to minimize.
[2024-05-28 08:56:53] [INFO ] Deduced a trap composed of 146 places in 288 ms of which 3 ms to minimize.
[2024-05-28 08:56:54] [INFO ] Deduced a trap composed of 127 places in 287 ms of which 4 ms to minimize.
[2024-05-28 08:56:54] [INFO ] Deduced a trap composed of 249 places in 327 ms of which 7 ms to minimize.
[2024-05-28 08:56:54] [INFO ] Deduced a trap composed of 247 places in 387 ms of which 6 ms to minimize.
[2024-05-28 08:56:55] [INFO ] Deduced a trap composed of 244 places in 237 ms of which 3 ms to minimize.
[2024-05-28 08:56:55] [INFO ] Deduced a trap composed of 236 places in 208 ms of which 3 ms to minimize.
[2024-05-28 08:56:56] [INFO ] Deduced a trap composed of 96 places in 256 ms of which 4 ms to minimize.
[2024-05-28 08:56:57] [INFO ] Deduced a trap composed of 169 places in 330 ms of which 6 ms to minimize.
[2024-05-28 08:56:57] [INFO ] Deduced a trap composed of 139 places in 250 ms of which 4 ms to minimize.
SMT process timed out in 41485ms, After SMT, problems are : Problem set: 0 solved, 743 unsolved
Search for dead transitions found 0 dead transitions in 41506ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41657 ms. Remains : 533/629 places, 749/840 transitions.
[2024-05-28 08:56:57] [INFO ] Flatten gal took : 46 ms
[2024-05-28 08:56:57] [INFO ] Flatten gal took : 39 ms
[2024-05-28 08:56:57] [INFO ] Input system was already deterministic with 749 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 579 transition count 751
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 178 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 534 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 120 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-05-28 08:56:57] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2024-05-28 08:56:57] [INFO ] Computed 97 invariants in 10 ms
[2024-05-28 08:56:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 08:57:05] [INFO ] Deduced a trap composed of 162 places in 304 ms of which 4 ms to minimize.
[2024-05-28 08:57:05] [INFO ] Deduced a trap composed of 139 places in 192 ms of which 3 ms to minimize.
[2024-05-28 08:57:06] [INFO ] Deduced a trap composed of 157 places in 319 ms of which 7 ms to minimize.
[2024-05-28 08:57:06] [INFO ] Deduced a trap composed of 138 places in 301 ms of which 9 ms to minimize.
[2024-05-28 08:57:06] [INFO ] Deduced a trap composed of 138 places in 299 ms of which 9 ms to minimize.
[2024-05-28 08:57:07] [INFO ] Deduced a trap composed of 138 places in 215 ms of which 3 ms to minimize.
[2024-05-28 08:57:07] [INFO ] Deduced a trap composed of 139 places in 242 ms of which 3 ms to minimize.
[2024-05-28 08:57:07] [INFO ] Deduced a trap composed of 139 places in 295 ms of which 4 ms to minimize.
[2024-05-28 08:57:07] [INFO ] Deduced a trap composed of 138 places in 316 ms of which 7 ms to minimize.
[2024-05-28 08:57:08] [INFO ] Deduced a trap composed of 141 places in 188 ms of which 3 ms to minimize.
[2024-05-28 08:57:08] [INFO ] Deduced a trap composed of 145 places in 205 ms of which 4 ms to minimize.
[2024-05-28 08:57:08] [INFO ] Deduced a trap composed of 184 places in 211 ms of which 4 ms to minimize.
[2024-05-28 08:57:09] [INFO ] Deduced a trap composed of 138 places in 209 ms of which 4 ms to minimize.
[2024-05-28 08:57:09] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 3 ms to minimize.
[2024-05-28 08:57:09] [INFO ] Deduced a trap composed of 153 places in 216 ms of which 6 ms to minimize.
[2024-05-28 08:57:09] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 3 ms to minimize.
[2024-05-28 08:57:10] [INFO ] Deduced a trap composed of 161 places in 219 ms of which 4 ms to minimize.
[2024-05-28 08:57:11] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 4 ms to minimize.
[2024-05-28 08:57:12] [INFO ] Deduced a trap composed of 138 places in 225 ms of which 4 ms to minimize.
[2024-05-28 08:57:12] [INFO ] Deduced a trap composed of 138 places in 243 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 08:57:14] [INFO ] Deduced a trap composed of 139 places in 263 ms of which 4 ms to minimize.
[2024-05-28 08:57:15] [INFO ] Deduced a trap composed of 138 places in 272 ms of which 3 ms to minimize.
[2024-05-28 08:57:15] [INFO ] Deduced a trap composed of 142 places in 301 ms of which 8 ms to minimize.
[2024-05-28 08:57:15] [INFO ] Deduced a trap composed of 143 places in 310 ms of which 7 ms to minimize.
[2024-05-28 08:57:16] [INFO ] Deduced a trap composed of 143 places in 304 ms of which 9 ms to minimize.
[2024-05-28 08:57:16] [INFO ] Deduced a trap composed of 144 places in 288 ms of which 7 ms to minimize.
[2024-05-28 08:57:16] [INFO ] Deduced a trap composed of 146 places in 329 ms of which 8 ms to minimize.
[2024-05-28 08:57:17] [INFO ] Deduced a trap composed of 145 places in 248 ms of which 4 ms to minimize.
[2024-05-28 08:57:17] [INFO ] Deduced a trap composed of 145 places in 253 ms of which 4 ms to minimize.
[2024-05-28 08:57:18] [INFO ] Deduced a trap composed of 169 places in 246 ms of which 4 ms to minimize.
[2024-05-28 08:57:18] [INFO ] Deduced a trap composed of 145 places in 263 ms of which 4 ms to minimize.
[2024-05-28 08:57:18] [INFO ] Deduced a trap composed of 142 places in 211 ms of which 3 ms to minimize.
[2024-05-28 08:57:19] [INFO ] Deduced a trap composed of 180 places in 234 ms of which 3 ms to minimize.
[2024-05-28 08:57:19] [INFO ] Deduced a trap composed of 158 places in 249 ms of which 3 ms to minimize.
SMT process timed out in 21520ms, After SMT, problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 21528ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 21664 ms. Remains : 532/629 places, 748/840 transitions.
[2024-05-28 08:57:19] [INFO ] Flatten gal took : 25 ms
[2024-05-28 08:57:19] [INFO ] Flatten gal took : 26 ms
[2024-05-28 08:57:19] [INFO ] Input system was already deterministic with 748 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 579 transition count 751
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 178 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 534 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 82 ms. Remains 532 /629 variables (removed 97) and now considering 748/840 (removed 92) transitions.
Running 742 sub problems to find dead transitions.
[2024-05-28 08:57:19] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2024-05-28 08:57:19] [INFO ] Invariant cache hit.
[2024-05-28 08:57:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 08:57:28] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 3 ms to minimize.
[2024-05-28 08:57:28] [INFO ] Deduced a trap composed of 139 places in 209 ms of which 4 ms to minimize.
[2024-05-28 08:57:28] [INFO ] Deduced a trap composed of 157 places in 206 ms of which 4 ms to minimize.
[2024-05-28 08:57:28] [INFO ] Deduced a trap composed of 157 places in 218 ms of which 4 ms to minimize.
[2024-05-28 08:57:29] [INFO ] Deduced a trap composed of 138 places in 240 ms of which 4 ms to minimize.
[2024-05-28 08:57:29] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 3 ms to minimize.
[2024-05-28 08:57:29] [INFO ] Deduced a trap composed of 138 places in 236 ms of which 4 ms to minimize.
[2024-05-28 08:57:29] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 4 ms to minimize.
[2024-05-28 08:57:30] [INFO ] Deduced a trap composed of 138 places in 240 ms of which 4 ms to minimize.
[2024-05-28 08:57:30] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 4 ms to minimize.
[2024-05-28 08:57:30] [INFO ] Deduced a trap composed of 138 places in 214 ms of which 4 ms to minimize.
[2024-05-28 08:57:30] [INFO ] Deduced a trap composed of 138 places in 230 ms of which 4 ms to minimize.
[2024-05-28 08:57:31] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 6 ms to minimize.
[2024-05-28 08:57:31] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 2 ms to minimize.
[2024-05-28 08:57:31] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 3 ms to minimize.
[2024-05-28 08:57:31] [INFO ] Deduced a trap composed of 175 places in 239 ms of which 4 ms to minimize.
[2024-05-28 08:57:31] [INFO ] Deduced a trap composed of 138 places in 195 ms of which 3 ms to minimize.
[2024-05-28 08:57:32] [INFO ] Deduced a trap composed of 138 places in 184 ms of which 3 ms to minimize.
[2024-05-28 08:57:32] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-28 08:57:32] [INFO ] Deduced a trap composed of 138 places in 229 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 08:57:33] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 4 ms to minimize.
[2024-05-28 08:57:34] [INFO ] Deduced a trap composed of 140 places in 232 ms of which 4 ms to minimize.
[2024-05-28 08:57:34] [INFO ] Deduced a trap composed of 163 places in 267 ms of which 3 ms to minimize.
[2024-05-28 08:57:34] [INFO ] Deduced a trap composed of 138 places in 205 ms of which 3 ms to minimize.
[2024-05-28 08:57:34] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 4 ms to minimize.
[2024-05-28 08:57:35] [INFO ] Deduced a trap composed of 169 places in 220 ms of which 3 ms to minimize.
[2024-05-28 08:57:35] [INFO ] Deduced a trap composed of 138 places in 204 ms of which 3 ms to minimize.
[2024-05-28 08:57:35] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 4 ms to minimize.
[2024-05-28 08:57:35] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 3 ms to minimize.
[2024-05-28 08:57:36] [INFO ] Deduced a trap composed of 138 places in 223 ms of which 3 ms to minimize.
[2024-05-28 08:57:36] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 4 ms to minimize.
[2024-05-28 08:57:36] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 3 ms to minimize.
[2024-05-28 08:57:36] [INFO ] Deduced a trap composed of 138 places in 193 ms of which 3 ms to minimize.
[2024-05-28 08:57:37] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 3 ms to minimize.
[2024-05-28 08:57:37] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 3 ms to minimize.
[2024-05-28 08:57:37] [INFO ] Deduced a trap composed of 178 places in 250 ms of which 4 ms to minimize.
[2024-05-28 08:57:38] [INFO ] Deduced a trap composed of 138 places in 221 ms of which 4 ms to minimize.
[2024-05-28 08:57:38] [INFO ] Deduced a trap composed of 184 places in 218 ms of which 4 ms to minimize.
[2024-05-28 08:57:38] [INFO ] Deduced a trap composed of 138 places in 239 ms of which 3 ms to minimize.
[2024-05-28 08:57:39] [INFO ] Deduced a trap composed of 138 places in 311 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/1276 variables, and 132 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 742/742 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 742 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 742 unsolved
[2024-05-28 08:57:50] [INFO ] Deduced a trap composed of 220 places in 312 ms of which 4 ms to minimize.
[2024-05-28 08:57:51] [INFO ] Deduced a trap composed of 158 places in 344 ms of which 3 ms to minimize.
[2024-05-28 08:57:51] [INFO ] Deduced a trap composed of 153 places in 235 ms of which 3 ms to minimize.
[2024-05-28 08:57:51] [INFO ] Deduced a trap composed of 206 places in 263 ms of which 4 ms to minimize.
[2024-05-28 08:57:53] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 3 ms to minimize.
[2024-05-28 08:57:53] [INFO ] Deduced a trap composed of 158 places in 256 ms of which 3 ms to minimize.
[2024-05-28 08:57:53] [INFO ] Deduced a trap composed of 153 places in 232 ms of which 4 ms to minimize.
[2024-05-28 08:57:54] [INFO ] Deduced a trap composed of 157 places in 254 ms of which 4 ms to minimize.
[2024-05-28 08:57:54] [INFO ] Deduced a trap composed of 218 places in 275 ms of which 4 ms to minimize.
[2024-05-28 08:57:54] [INFO ] Deduced a trap composed of 163 places in 237 ms of which 3 ms to minimize.
[2024-05-28 08:57:55] [INFO ] Deduced a trap composed of 152 places in 237 ms of which 5 ms to minimize.
[2024-05-28 08:57:55] [INFO ] Deduced a trap composed of 212 places in 251 ms of which 4 ms to minimize.
[2024-05-28 08:57:55] [INFO ] Deduced a trap composed of 171 places in 227 ms of which 4 ms to minimize.
[2024-05-28 08:57:55] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 7 ms to minimize.
[2024-05-28 08:57:56] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 3 ms to minimize.
[2024-05-28 08:57:56] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 4 ms to minimize.
[2024-05-28 08:57:56] [INFO ] Deduced a trap composed of 153 places in 253 ms of which 4 ms to minimize.
[2024-05-28 08:57:57] [INFO ] Deduced a trap composed of 207 places in 260 ms of which 4 ms to minimize.
[2024-05-28 08:57:57] [INFO ] Deduced a trap composed of 206 places in 214 ms of which 3 ms to minimize.
[2024-05-28 08:57:57] [INFO ] Deduced a trap composed of 154 places in 260 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/527 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/1276 variables, and 152 constraints, problems are : Problem set: 0 solved, 742 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 16/21 constraints, State Equation: 0/532 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/742 constraints, Known Traps: 60/60 constraints]
After SMT, in 41815ms problems are : Problem set: 0 solved, 742 unsolved
Search for dead transitions found 0 dead transitions in 41824ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41909 ms. Remains : 532/629 places, 748/840 transitions.
[2024-05-28 08:58:01] [INFO ] Flatten gal took : 32 ms
[2024-05-28 08:58:01] [INFO ] Flatten gal took : 33 ms
[2024-05-28 08:58:01] [INFO ] Input system was already deterministic with 748 transitions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 840/840 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 623 transition count 839
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 623 transition count 839
Applied a total of 7 rules in 47 ms. Remains 623 /629 variables (removed 6) and now considering 839/840 (removed 1) transitions.
Running 833 sub problems to find dead transitions.
[2024-05-28 08:58:01] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2024-05-28 08:58:01] [INFO ] Computed 97 invariants in 12 ms
[2024-05-28 08:58:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 3 (OVERLAPS) 6/623 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1458 variables, and 97 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 833/833 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 08:58:25] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 2 ms to minimize.
[2024-05-28 08:58:25] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-05-28 08:58:29] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-28 08:58:30] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-28 08:58:30] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-28 08:58:30] [INFO ] Deduced a trap composed of 97 places in 193 ms of which 3 ms to minimize.
[2024-05-28 08:58:32] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 1 ms to minimize.
[2024-05-28 08:58:33] [INFO ] Deduced a trap composed of 97 places in 196 ms of which 1 ms to minimize.
[2024-05-28 08:58:33] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 1 ms to minimize.
[2024-05-28 08:58:33] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/617 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 833 unsolved
[2024-05-28 08:58:38] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/617 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 833 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1458 variables, and 102 constraints, problems are : Problem set: 0 solved, 833 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 15/21 constraints, State Equation: 0/623 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/833 constraints, Known Traps: 11/11 constraints]
After SMT, in 41605ms problems are : Problem set: 0 solved, 833 unsolved
Search for dead transitions found 0 dead transitions in 41623ms
Finished structural reductions in LTL mode , in 1 iterations and 41673 ms. Remains : 623/629 places, 839/840 transitions.
[2024-05-28 08:58:43] [INFO ] Flatten gal took : 27 ms
[2024-05-28 08:58:43] [INFO ] Flatten gal took : 29 ms
[2024-05-28 08:58:43] [INFO ] Input system was already deterministic with 839 transitions.
[2024-05-28 08:58:43] [INFO ] Flatten gal took : 62 ms
[2024-05-28 08:58:43] [INFO ] Flatten gal took : 47 ms
[2024-05-28 08:58:43] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLFireability.sr.xml took 15 ms.
[2024-05-28 08:58:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 629 places, 840 transitions and 4204 arcs took 15 ms.
Total runtime 463822 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBNT-PT-S05J40
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 629
TRANSITIONS: 840
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.000s]
SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]
----------------------------------------------------------------------
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: 1888
MODEL NAME: /home/mcc/execution/414/model
629 places, 840 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-S05J40"
export BK_EXAMINATION="CTLFireability"
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-S05J40, examination is CTLFireability"
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-171654446000458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J40.tgz
mv PolyORBNT-PT-S05J40 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;