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-171654446000489.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-S10J30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446000489
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 12K Apr 12 11:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 11:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 762K Apr 12 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:21 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 8.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 44K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Apr 12 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 12 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.1M Apr 12 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 14M 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-S10J30-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S10J30-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716890070188

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:54:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 09:54:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:54:32] [INFO ] Load time of PNML (sax parser for PT used): 702 ms
[2024-05-28 09:54:32] [INFO ] Transformed 664 places.
[2024-05-28 09:54:32] [INFO ] Transformed 12050 transitions.
[2024-05-28 09:54:32] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 964 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 185 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1940
Applied a total of 10 rules in 128 ms. Remains 654 /664 variables (removed 10) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-05-28 09:54:33] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 654 cols
[2024-05-28 09:54:33] [INFO ] Computed 82 invariants in 152 ms
[2024-05-28 09:54:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20107 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
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 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 56654ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 56711ms
[2024-05-28 09:55:29] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 09:55:29] [INFO ] Invariant cache hit.
[2024-05-28 09:55:30] [INFO ] Implicit Places using invariants in 712 ms returned []
[2024-05-28 09:55:30] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 09:55:30] [INFO ] Invariant cache hit.
[2024-05-28 09:55:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 09:55:36] [INFO ] Implicit Places using invariants and state equation in 6059 ms returned []
Implicit Place search using SMT with State Equation took 6780 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-05-28 09:55:36] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-05-28 09:55:36] [INFO ] Invariant cache hit.
[2024-05-28 09:55:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2585 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1929/929 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/643 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/643 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/643 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1071 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/654 variables, 11/82 constraints. Problems are: Problem set: 200 solved, 1729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/2585 variables, and 82 constraints, problems are : Problem set: 200 solved, 1729 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/654 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 81133ms problems are : Problem set: 200 solved, 1729 unsolved
Search for dead transitions found 200 dead transitions in 81163ms
Found 200 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 200 transitions
Dead transitions reduction (with SMT) removed 200 transitions
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1740/1940 transitions.
Applied a total of 0 rules in 32 ms. Remains 654 /654 variables (removed 0) and now considering 1740/1740 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144917 ms. Remains : 654/664 places, 1740/1940 transitions.
Support contains 185 out of 654 places after structural reductions.
[2024-05-28 09:56:58] [INFO ] Flatten gal took : 239 ms
[2024-05-28 09:56:58] [INFO ] Flatten gal took : 157 ms
[2024-05-28 09:56:58] [INFO ] Input system was already deterministic with 1740 transitions.
RANDOM walk for 40000 steps (2239 resets) in 3297 ms. (12 steps per ms) remains 65/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 42 ms. (93 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (40 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (12 resets) in 84 ms. (47 steps per ms) remains 58/65 properties
BEST_FIRST walk for 4002 steps (41 resets) in 307 ms. (12 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (48 resets) in 46 ms. (85 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (40 resets) in 36 ms. (108 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (39 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (39 resets) in 42 ms. (93 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (39 resets) in 47 ms. (83 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (39 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (41 resets) in 42 ms. (93 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 54 ms. (72 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (41 resets) in 45 ms. (87 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (39 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (41 resets) in 36 ms. (108 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (40 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (39 resets) in 42 ms. (93 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (39 resets) in 36 ms. (108 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 25 ms. (154 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (42 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (40 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (39 resets) in 57 ms. (69 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (40 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (36 resets) in 88 ms. (44 steps per ms) remains 56/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 173 ms. (23 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (40 resets) in 203 ms. (19 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (40 resets) in 90 ms. (43 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (36 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (40 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (40 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (40 resets) in 25 ms. (153 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (40 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
[2024-05-28 09:57:00] [INFO ] Flow matrix only has 1731 transitions (discarded 9 similar events)
// Phase 1: matrix 1731 rows 654 cols
[2024-05-28 09:57:00] [INFO ] Computed 82 invariants in 70 ms
[2024-05-28 09:57:00] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 348/514 variables, 53/53 constraints. Problems are: Problem set: 24 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 2/55 constraints. Problems are: Problem set: 24 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/514 variables, 0/55 constraints. Problems are: Problem set: 24 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 90/604 variables, 9/64 constraints. Problems are: Problem set: 24 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 0/64 constraints. Problems are: Problem set: 24 solved, 32 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 6 (OVERLAPS) 49/653 variables, 17/81 constraints. Problems are: Problem set: 41 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/653 variables, 0/81 constraints. Problems are: Problem set: 41 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/654 variables, 1/82 constraints. Problems are: Problem set: 41 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/82 constraints. Problems are: Problem set: 41 solved, 15 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 10 (OVERLAPS) 1731/2385 variables, 654/736 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2385 variables, 1/737 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2385 variables, 0/737 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/2385 variables, 0/737 constraints. Problems are: Problem set: 42 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2385/2385 variables, and 737 constraints, problems are : Problem set: 42 solved, 14 unsolved in 3460 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 654/654 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 56/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 42 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 262/289 variables, 23/23 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/23 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 162/451 variables, 25/48 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 0/48 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 120/571 variables, 12/60 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 0/60 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 79/650 variables, 19/79 constraints. Problems are: Problem set: 42 solved, 14 unsolved
[2024-05-28 09:57:05] [INFO ] Deduced a trap composed of 24 places in 540 ms of which 36 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/80 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/650 variables, 0/80 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 3/653 variables, 3/83 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/653 variables, 0/83 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 1731/2384 variables, 653/736 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2384 variables, 1/737 constraints. Problems are: Problem set: 42 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2384 variables, 14/751 constraints. Problems are: Problem set: 42 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2384/2385 variables, and 751 constraints, problems are : Problem set: 42 solved, 14 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 653/654 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/55 constraints, Known Traps: 1/1 constraints]
After SMT, in 8657ms problems are : Problem set: 42 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 654 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 654/654 places, 1740/1740 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 654 transition count 1710
Reduce places removed 30 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 624 transition count 1707
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 621 transition count 1707
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 66 place count 621 transition count 1675
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 130 place count 589 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 588 transition count 1674
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 588 transition count 1674
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 3 with 4 rules applied. Total rules applied 136 place count 586 transition count 1672
Applied a total of 136 rules in 331 ms. Remains 586 /654 variables (removed 68) and now considering 1672/1740 (removed 68) transitions.
Running 1661 sub problems to find dead transitions.
[2024-05-28 09:57:09] [INFO ] Flow matrix only has 1663 transitions (discarded 9 similar events)
// Phase 1: matrix 1663 rows 586 cols
[2024-05-28 09:57:09] [INFO ] Computed 82 invariants in 25 ms
[2024-05-28 09:57:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2249 variables, and 72 constraints, problems are : Problem set: 0 solved, 1661 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 10/20 constraints, State Equation: 0/586 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1661/1661 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1661 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 1661 unsolved
[2024-05-28 09:57:49] [INFO ] Deduced a trap composed of 79 places in 439 ms of which 7 ms to minimize.
[2024-05-28 09:57:50] [INFO ] Deduced a trap composed of 166 places in 446 ms of which 7 ms to minimize.
[2024-05-28 09:57:50] [INFO ] Deduced a trap composed of 184 places in 429 ms of which 6 ms to minimize.
[2024-05-28 09:57:51] [INFO ] Deduced a trap composed of 143 places in 317 ms of which 4 ms to minimize.
[2024-05-28 09:57:51] [INFO ] Deduced a trap composed of 251 places in 435 ms of which 5 ms to minimize.
[2024-05-28 09:57:52] [INFO ] Deduced a trap composed of 18 places in 449 ms of which 20 ms to minimize.
[2024-05-28 09:57:52] [INFO ] Deduced a trap composed of 181 places in 494 ms of which 4 ms to minimize.
[2024-05-28 09:57:54] [INFO ] Deduced a trap composed of 163 places in 683 ms of which 5 ms to minimize.
[2024-05-28 09:57:56] [INFO ] Deduced a trap composed of 160 places in 552 ms of which 4 ms to minimize.
[2024-05-28 09:57:56] [INFO ] Deduced a trap composed of 78 places in 484 ms of which 4 ms to minimize.
[2024-05-28 09:57:59] [INFO ] Deduced a trap composed of 174 places in 502 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 2)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 9)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 3)
(s100 0)
(s101 3)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 4)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 3)
(s186 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 8)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2249 variables, and 83 constraints, problems are : Problem set: 0 solved, 1661 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 10/20 constraints, State Equation: 0/586 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1661 constraints, Known Traps: 11/11 constraints]
After SMT, in 57561ms problems are : Problem set: 0 solved, 1661 unsolved
Search for dead transitions found 0 dead transitions in 57583ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57920 ms. Remains : 586/654 places, 1672/1740 transitions.
RANDOM walk for 40000 steps (2946 resets) in 1403 ms. (28 steps per ms) remains 0/14 properties
Successfully simplified 42 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 09:58:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 09:58:08] [INFO ] Flatten gal took : 252 ms
[2024-05-28 09:58:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 09:58:08] [INFO ] Flatten gal took : 258 ms
[2024-05-28 09:58:09] [INFO ] Input system was already deterministic with 1740 transitions.
Support contains 59 out of 654 places (down from 61) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1740/1740 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1739
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1739
Applied a total of 2 rules in 80 ms. Remains 653 /654 variables (removed 1) and now considering 1739/1740 (removed 1) transitions.
Running 1728 sub problems to find dead transitions.
[2024-05-28 09:58:09] [INFO ] Flow matrix only has 1730 transitions (discarded 9 similar events)
// Phase 1: matrix 1730 rows 653 cols
[2024-05-28 09:58:09] [INFO ] Computed 82 invariants in 50 ms
[2024-05-28 09:58:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 (/ 1.0 3.0))
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 (/ 1.0 3.0))
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 9.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 (/ 1.0 3.0))
(s111 3.0)
(s112 0.0)
(s113 3.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 4.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 3.0)
(s209 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 9.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 (/ 2.0 3.0))
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 3.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 (/ 2.0 3.0))
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 1.0)
(s438 3.0)
(s439 0.0)
(s440 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 3.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 (/ 2.0 3.0))
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 3.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 3.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 (/ 2.0 3.0))
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 (/ 3.0 4.0))
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2383 variables, and 71 constraints, problems are : Problem set: 0 solved, 1728 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1728/1728 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
[2024-05-28 09:58:48] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 2 ms to minimize.
[2024-05-28 09:58:54] [INFO ] Deduced a trap composed of 82 places in 280 ms of which 3 ms to minimize.
[2024-05-28 09:58:57] [INFO ] Deduced a trap composed of 83 places in 218 ms of which 2 ms to minimize.
[2024-05-28 09:59:02] [INFO ] Deduced a trap composed of 83 places in 165 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2383 variables, and 75 constraints, problems are : Problem set: 0 solved, 1728 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1728 constraints, Known Traps: 4/4 constraints]
After SMT, in 57407ms problems are : Problem set: 0 solved, 1728 unsolved
Search for dead transitions found 0 dead transitions in 57457ms
Finished structural reductions in LTL mode , in 1 iterations and 57544 ms. Remains : 653/654 places, 1739/1740 transitions.
[2024-05-28 09:59:06] [INFO ] Flatten gal took : 95 ms
[2024-05-28 09:59:06] [INFO ] Flatten gal took : 100 ms
[2024-05-28 09:59:07] [INFO ] Input system was already deterministic with 1739 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1740/1740 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1705
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1705
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 70 place count 619 transition count 1672
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 136 place count 586 transition count 1672
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 585 transition count 1671
Applied a total of 138 rules in 133 ms. Remains 585 /654 variables (removed 69) and now considering 1671/1740 (removed 69) transitions.
Running 1660 sub problems to find dead transitions.
[2024-05-28 09:59:07] [INFO ] Flow matrix only has 1662 transitions (discarded 9 similar events)
// Phase 1: matrix 1662 rows 585 cols
[2024-05-28 09:59:07] [INFO ] Computed 82 invariants in 33 ms
[2024-05-28 09:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/575 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/575 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 2.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 9.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 3.0)
(s97 0.0)
(s98 3.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 4.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 timeout
0.0)
(s180 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 575/2247 variables, and 72 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/585 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/575 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/575 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
[2024-05-28 09:59:47] [INFO ] Deduced a trap composed of 151 places in 320 ms of which 4 ms to minimize.
[2024-05-28 09:59:48] [INFO ] Deduced a trap composed of 160 places in 482 ms of which 6 ms to minimize.
[2024-05-28 09:59:49] [INFO ] Deduced a trap composed of 159 places in 437 ms of which 4 ms to minimize.
[2024-05-28 09:59:49] [INFO ] Deduced a trap composed of 147 places in 376 ms of which 4 ms to minimize.
[2024-05-28 09:59:50] [INFO ] Deduced a trap composed of 129 places in 468 ms of which 6 ms to minimize.
[2024-05-28 09:59:50] [INFO ] Deduced a trap composed of 128 places in 434 ms of which 3 ms to minimize.
[2024-05-28 09:59:51] [INFO ] Deduced a trap composed of 147 places in 450 ms of which 5 ms to minimize.
[2024-05-28 09:59:51] [INFO ] Deduced a trap composed of 171 places in 438 ms of which 5 ms to minimize.
[2024-05-28 09:59:51] [INFO ] Deduced a trap composed of 159 places in 448 ms of which 4 ms to minimize.
[2024-05-28 09:59:52] [INFO ] Deduced a trap composed of 135 places in 412 ms of which 4 ms to minimize.
[2024-05-28 09:59:52] [INFO ] Deduced a trap composed of 141 places in 456 ms of which 5 ms to minimize.
[2024-05-28 09:59:53] [INFO ] Deduced a trap composed of 147 places in 420 ms of which 3 ms to minimize.
[2024-05-28 09:59:53] [INFO ] Deduced a trap composed of 86 places in 395 ms of which 3 ms to minimize.
[2024-05-28 09:59:54] [INFO ] Deduced a trap composed of 19 places in 376 ms of which 2 ms to minimize.
[2024-05-28 09:59:55] [INFO ] Deduced a trap composed of 119 places in 373 ms of which 3 ms to minimize.
[2024-05-28 09:59:56] [INFO ] Deduced a trap composed of 141 places in 521 ms of which 5 ms to minimize.
[2024-05-28 09:59:57] [INFO ] Deduced a trap composed of 148 places in 478 ms of which 13 ms to minimize.
[2024-05-28 09:59:57] [INFO ] Deduced a trap composed of 177 places in 398 ms of which 3 ms to minimize.
[2024-05-28 09:59:57] [INFO ] Deduced a trap composed of 185 places in 451 ms of which 5 ms to minimize.
[2024-05-28 09:59:58] [INFO ] Deduced a trap composed of 189 places in 454 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/575 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
[2024-05-28 10:00:02] [INFO ] Deduced a trap composed of 246 places in 398 ms of which 3 ms to minimize.
[2024-05-28 10:00:02] [INFO ] Deduced a trap composed of 232 places in 406 ms of which 3 ms to minimize.
[2024-05-28 10:00:03] [INFO ] Deduced a trap composed of 261 places in 381 ms of which 3 ms to minimize.
[2024-05-28 10:00:04] [INFO ] Deduced a trap composed of 254 places in 487 ms of which 5 ms to minimize.
[2024-05-28 10:00:06] [INFO ] Deduced a trap composed of 177 places in 518 ms of which 3 ms to minimize.
SMT process timed out in 59330ms, After SMT, problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 59353ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 59491 ms. Remains : 585/654 places, 1671/1740 transitions.
[2024-05-28 10:00:06] [INFO ] Flatten gal took : 117 ms
[2024-05-28 10:00:06] [INFO ] Flatten gal took : 129 ms
[2024-05-28 10:00:07] [INFO ] Input system was already deterministic with 1671 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1740/1740 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1704
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1704
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1670
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 584 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1669
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1669
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 146 place count 581 transition count 1667
Applied a total of 146 rules in 130 ms. Remains 581 /654 variables (removed 73) and now considering 1667/1740 (removed 73) transitions.
Running 1656 sub problems to find dead transitions.
[2024-05-28 10:00:07] [INFO ] Flow matrix only has 1658 transitions (discarded 9 similar events)
// Phase 1: matrix 1658 rows 581 cols
[2024-05-28 10:00:07] [INFO ] Computed 82 invariants in 22 ms
[2024-05-28 10:00:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2239 variables, and 72 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1656/1656 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1656 unsolved
[2024-05-28 10:00:46] [INFO ] Deduced a trap composed of 79 places in 281 ms of which 3 ms to minimize.
[2024-05-28 10:00:46] [INFO ] Deduced a trap composed of 79 places in 308 ms of which 4 ms to minimize.
[2024-05-28 10:00:47] [INFO ] Deduced a trap composed of 166 places in 278 ms of which 3 ms to minimize.
[2024-05-28 10:00:47] [INFO ] Deduced a trap composed of 243 places in 298 ms of which 4 ms to minimize.
[2024-05-28 10:00:48] [INFO ] Deduced a trap composed of 18 places in 447 ms of which 2 ms to minimize.
[2024-05-28 10:00:50] [INFO ] Deduced a trap composed of 200 places in 493 ms of which 4 ms to minimize.
[2024-05-28 10:00:50] [INFO ] Deduced a trap composed of 173 places in 445 ms of which 4 ms to minimize.
[2024-05-28 10:00:51] [INFO ] Deduced a trap composed of 142 places in 424 ms of which 3 ms to minimize.
[2024-05-28 10:00:52] [INFO ] Deduced a trap composed of 163 places in 417 ms of which 4 ms to minimize.
[2024-05-28 10:00:52] [INFO ] Deduced a trap composed of 166 places in 466 ms of which 5 ms to minimize.
[2024-05-28 10:00:53] [INFO ] Deduced a trap composed of 89 places in 492 ms of which 3 ms to minimize.
[2024-05-28 10:00:53] [INFO ] Deduced a trap composed of 101 places in 473 ms of which 4 ms to minimize.
[2024-05-28 10:00:55] [INFO ] Deduced a trap composed of 166 places in 506 ms of which 5 ms to minimize.
[2024-05-28 10:00:58] [INFO ] Deduced a trap composed of 154 places in 504 ms of which 4 ms to minimize.
[2024-05-28 10:00:58] [INFO ] Deduced a trap composed of 148 places in 509 ms of which 4 ms to minimize.
[2024-05-28 10:00:59] [INFO ] Deduced a trap composed of 130 places in 408 ms of which 7 ms to minimize.
[2024-05-28 10:00:59] [INFO ] Deduced a trap composed of 127 places in 525 ms of which 4 ms to minimize.
[2024-05-28 10:01:01] [INFO ] Deduced a trap composed of 155 places in 505 ms of which 4 ms to minimize.
[2024-05-28 10:01:02] [INFO ] Deduced a trap composed of 148 places in 540 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/2239 variables, and 91 constraints, problems are : Problem set: 0 solved, 1656 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1656 constraints, Known Traps: 19/19 constraints]
After SMT, in 57453ms problems are : Problem set: 0 solved, 1656 unsolved
Search for dead transitions found 0 dead transitions in 57467ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 57601 ms. Remains : 581/654 places, 1667/1740 transitions.
[2024-05-28 10:01:04] [INFO ] Flatten gal took : 79 ms
[2024-05-28 10:01:04] [INFO ] Flatten gal took : 89 ms
[2024-05-28 10:01:05] [INFO ] Input system was already deterministic with 1667 transitions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1740/1740 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1739
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1739
Applied a total of 2 rules in 38 ms. Remains 653 /654 variables (removed 1) and now considering 1739/1740 (removed 1) transitions.
Running 1728 sub problems to find dead transitions.
[2024-05-28 10:01:05] [INFO ] Flow matrix only has 1730 transitions (discarded 9 similar events)
// Phase 1: matrix 1730 rows 653 cols
[2024-05-28 10:01:05] [INFO ] Computed 82 invariants in 45 ms
[2024-05-28 10:01:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2383 variables, and 71 constraints, problems are : Problem set: 0 solved, 1728 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1728/1728 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
[2024-05-28 10:01:46] [INFO ] Deduced a trap composed of 83 places in 202 ms of which 3 ms to minimize.
[2024-05-28 10:01:52] [INFO ] Deduced a trap composed of 82 places in 373 ms of which 3 ms to minimize.
[2024-05-28 10:01:55] [INFO ] Deduced a trap composed of 83 places in 218 ms of which 2 ms to minimize.
[2024-05-28 10:02:00] [INFO ] Deduced a trap composed of 83 places in 198 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 9)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 3)
(s112 0)
(s113 3)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 2)
(s140 0)
(s141 0)
(s143 0)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s174 0)
(s175 1)
(s176 1)
(s177 1)
(s178 0)
(s179 0)
(s180 4)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 3)
(s209 0)
(s211 1)
(s212 0)
(s213 0)
(s214 1)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 10)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(s289 0)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s326 0)
(s327 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2383 variables, and 75 constraints, problems are : Problem set: 0 solved, 1728 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1728 constraints, Known Traps: 4/4 constraints]
After SMT, in 59322ms problems are : Problem set: 0 solved, 1728 unsolved
Search for dead transitions found 0 dead transitions in 59344ms
Finished structural reductions in LTL mode , in 1 iterations and 59388 ms. Remains : 653/654 places, 1739/1740 transitions.
[2024-05-28 10:02:04] [INFO ] Flatten gal took : 84 ms
[2024-05-28 10:02:04] [INFO ] Flatten gal took : 90 ms
[2024-05-28 10:02:04] [INFO ] Input system was already deterministic with 1739 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1740/1740 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1706
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 620 transition count 1706
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 68 place count 620 transition count 1671
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 138 place count 585 transition count 1671
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1670
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1670
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 583 transition count 1669
Applied a total of 142 rules in 193 ms. Remains 583 /654 variables (removed 71) and now considering 1669/1740 (removed 71) transitions.
Running 1658 sub problems to find dead transitions.
[2024-05-28 10:02:05] [INFO ] Flow matrix only has 1660 transitions (discarded 9 similar events)
// Phase 1: matrix 1660 rows 583 cols
[2024-05-28 10:02:05] [INFO ] Computed 82 invariants in 37 ms
[2024-05-28 10:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2243 variables, and 71 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
[2024-05-28 10:02:48] [INFO ] Deduced a trap composed of 78 places in 281 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2243 variables, and 72 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/583 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1658 constraints, Known Traps: 1/1 constraints]
After SMT, in 59408ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 59425ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 59622 ms. Remains : 583/654 places, 1669/1740 transitions.
[2024-05-28 10:03:04] [INFO ] Flatten gal took : 72 ms
[2024-05-28 10:03:04] [INFO ] Flatten gal took : 81 ms
[2024-05-28 10:03:04] [INFO ] Input system was already deterministic with 1669 transitions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 1740/1740 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 653 transition count 1739
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 653 transition count 1739
Applied a total of 2 rules in 33 ms. Remains 653 /654 variables (removed 1) and now considering 1739/1740 (removed 1) transitions.
Running 1728 sub problems to find dead transitions.
[2024-05-28 10:03:04] [INFO ] Flow matrix only has 1730 transitions (discarded 9 similar events)
// Phase 1: matrix 1730 rows 653 cols
[2024-05-28 10:03:05] [INFO ] Computed 82 invariants in 74 ms
[2024-05-28 10:03:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 9.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 3.0)
(s112 0.0)
(s113 3.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 4.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 3.0)
(s209 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 timeout
0.0)
(s236 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2383 variables, and 71 constraints, problems are : Problem set: 0 solved, 1728 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1728/1728 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1728 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1728 unsolved
[2024-05-28 10:03:45] [INFO ] Deduced a trap composed of 83 places in 197 ms of which 2 ms to minimize.
[2024-05-28 10:03:51] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 3 ms to minimize.
[2024-05-28 10:03:54] [INFO ] Deduced a trap composed of 83 places in 226 ms of which 2 ms to minimize.
[2024-05-28 10:03:59] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2383 variables, and 75 constraints, problems are : Problem set: 0 solved, 1728 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1728 constraints, Known Traps: 4/4 constraints]
After SMT, in 58541ms problems are : Problem set: 0 solved, 1728 unsolved
Search for dead transitions found 0 dead transitions in 58561ms
Finished structural reductions in LTL mode , in 1 iterations and 58597 ms. Remains : 653/654 places, 1739/1740 transitions.
[2024-05-28 10:04:03] [INFO ] Flatten gal took : 144 ms
[2024-05-28 10:04:03] [INFO ] Flatten gal took : 128 ms
[2024-05-28 10:04:04] [INFO ] Input system was already deterministic with 1739 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 654/654 places, 1740/1740 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 654 transition count 1704
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 618 transition count 1704
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1669
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 142 place count 583 transition count 1669
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1668
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1668
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 148 place count 580 transition count 1666
Applied a total of 148 rules in 185 ms. Remains 580 /654 variables (removed 74) and now considering 1666/1740 (removed 74) transitions.
Running 1655 sub problems to find dead transitions.
[2024-05-28 10:04:04] [INFO ] Flow matrix only has 1657 transitions (discarded 9 similar events)
// Phase 1: matrix 1657 rows 580 cols
[2024-05-28 10:04:04] [INFO ] Computed 82 invariants in 20 ms
[2024-05-28 10:04:04] [INFO ] State equation strengthened by 1 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-PT-S10J30

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 664
TRANSITIONS: 12050
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.659s, Sys 0.049s]


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


----------------------------------------------------------------------
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: 872
MODEL NAME: /home/mcc/execution/model
664 places, 12050 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-S10J30"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-PT-S10J30, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654446000489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J30.tgz
mv PolyORBNT-PT-S10J30 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;