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.r516-tajo-171654447200491.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 ltsminxred
Input is PolyORBNT-PT-S10J30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654447200491
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717261230307

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:00:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:00:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:00:32] [INFO ] Load time of PNML (sax parser for PT used): 554 ms
[2024-06-01 17:00:32] [INFO ] Transformed 664 places.
[2024-06-01 17:00:32] [INFO ] Transformed 12050 transitions.
[2024-06-01 17:00:32] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 815 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 105 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 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 655 transition count 1940
Applied a total of 9 rules in 144 ms. Remains 655 /664 variables (removed 9) and now considering 1940/1940 (removed 0) transitions.
Running 1929 sub problems to find dead transitions.
[2024-06-01 17:00:32] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 655 cols
[2024-06-01 17:00:33] [INFO ] Computed 83 invariants in 132 ms
[2024-06-01 17:00: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/2586 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20165 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/20 constraints, State Equation: 0/655 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/2586 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/20 constraints, State Equation: 0/655 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 57959ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 58006ms
[2024-06-01 17:01:30] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:01:30] [INFO ] Invariant cache hit.
[2024-06-01 17:01:31] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-06-01 17:01:31] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:01:31] [INFO ] Invariant cache hit.
[2024-06-01 17:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:01:39] [INFO ] Implicit Places using invariants and state equation in 8309 ms returned []
Implicit Place search using SMT with State Equation took 9068 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2024-06-01 17:01:40] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
[2024-06-01 17:01:40] [INFO ] Invariant cache hit.
[2024-06-01 17:01:40] [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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/2586 variables, and 71 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/20 constraints, State Equation: 0/655 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
Problem TDEAD1075 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1203 is UNSAT
At refinement iteration 3 (OVERLAPS) 12/655 variables, 12/83 constraints. Problems are: Problem set: 257 solved, 1672 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/2586 variables, and 83 constraints, problems are : Problem set: 257 solved, 1672 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/655 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/929 constraints, Known Traps: 0/0 constraints]
After SMT, in 82935ms problems are : Problem set: 257 solved, 1672 unsolved
Search for dead transitions found 257 dead transitions in 82986ms
Found 257 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 257 transitions
Dead transitions reduction (with SMT) removed 257 transitions
Starting structural reductions in LTL mode, iteration 1 : 655/664 places, 1683/1940 transitions.
Applied a total of 0 rules in 19 ms. Remains 655 /655 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150297 ms. Remains : 655/664 places, 1683/1940 transitions.
Support contains 105 out of 655 places after structural reductions.
[2024-06-01 17:03:03] [INFO ] Flatten gal took : 253 ms
[2024-06-01 17:03:03] [INFO ] Flatten gal took : 162 ms
[2024-06-01 17:03:03] [INFO ] Input system was already deterministic with 1683 transitions.
Support contains 102 out of 655 places (down from 105) after GAL structural reductions.
RANDOM walk for 40000 steps (2235 resets) in 2849 ms. (14 steps per ms) remains 17/31 properties
BEST_FIRST walk for 4003 steps (40 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (40 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (48 resets) in 60 ms. (65 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (41 resets) in 33 ms. (117 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (41 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (39 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (40 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (40 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (40 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
[2024-06-01 17:03:04] [INFO ] Flow matrix only has 1674 transitions (discarded 9 similar events)
// Phase 1: matrix 1674 rows 655 cols
[2024-06-01 17:03:05] [INFO ] Computed 83 invariants in 58 ms
[2024-06-01 17:03:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 138/167 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 174/341 variables, 27/37 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 240/581 variables, 24/61 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 15 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 8 (OVERLAPS) 70/651 variables, 19/80 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 0/80 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 3/654 variables, 3/83 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 0/83 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 1674/2328 variables, 654/737 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2328 variables, 1/738 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2328 variables, 0/738 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/2329 variables, 1/739 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2329 variables, 0/739 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/2329 variables, 0/739 constraints. Problems are: Problem set: 5 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2329/2329 variables, and 739 constraints, problems are : Problem set: 5 solved, 12 unsolved in 2829 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 655/655 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 136/161 variables, 8/8 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 174/335 variables, 27/35 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/35 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 240/575 variables, 24/59 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 0/59 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 75/650 variables, 20/79 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-01 17:03:09] [INFO ] Deduced a trap composed of 160 places in 613 ms of which 41 ms to minimize.
[2024-06-01 17:03:09] [INFO ] Deduced a trap composed of 24 places in 471 ms of which 5 ms to minimize.
[2024-06-01 17:03:10] [INFO ] Deduced a trap composed of 145 places in 571 ms of which 6 ms to minimize.
[2024-06-01 17:03:10] [INFO ] Deduced a trap composed of 226 places in 563 ms of which 5 ms to minimize.
[2024-06-01 17:03:11] [INFO ] Deduced a trap composed of 165 places in 438 ms of which 3 ms to minimize.
[2024-06-01 17:03:11] [INFO ] Deduced a trap composed of 112 places in 518 ms of which 4 ms to minimize.
[2024-06-01 17:03:12] [INFO ] Deduced a trap composed of 121 places in 465 ms of which 5 ms to minimize.
[2024-06-01 17:03:12] [INFO ] Deduced a trap composed of 133 places in 506 ms of which 5 ms to minimize.
[2024-06-01 17:03:13] [INFO ] Deduced a trap composed of 226 places in 509 ms of which 5 ms to minimize.
SMT process timed out in 8422ms, After SMT, problems are : Problem set: 5 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 655 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 655/655 places, 1683/1683 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 654 transition count 1652
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 623 transition count 1650
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 621 transition count 1650
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 67 place count 621 transition count 1619
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 129 place count 590 transition count 1619
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 589 transition count 1618
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 589 transition count 1618
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 587 transition count 1616
Applied a total of 135 rules in 316 ms. Remains 587 /655 variables (removed 68) and now considering 1616/1683 (removed 67) transitions.
Running 1605 sub problems to find dead transitions.
[2024-06-01 17:03:13] [INFO ] Flow matrix only has 1607 transitions (discarded 9 similar events)
// Phase 1: matrix 1607 rows 587 cols
[2024-06-01 17:03:13] [INFO ] Computed 82 invariants in 42 ms
[2024-06-01 17:03:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2194 variables, and 71 constraints, problems are : Problem set: 0 solved, 1605 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/587 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1605/1605 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
[2024-06-01 17:03:53] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2024-06-01 17:03:53] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1605 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(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 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(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 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 5)
(s123 0)
(s124 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 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 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)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 1)
(s186 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 timeout
0)
(s197 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2194 variables, and 73 constraints, problems are : Problem set: 0 solved, 1605 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 8/19 constraints, State Equation: 0/587 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1605 constraints, Known Traps: 2/2 constraints]
After SMT, in 56046ms problems are : Problem set: 0 solved, 1605 unsolved
Search for dead transitions found 0 dead transitions in 56070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56392 ms. Remains : 587/655 places, 1616/1683 transitions.
RANDOM walk for 40000 steps (2540 resets) in 1042 ms. (38 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40004 steps (492 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (428 resets) in 240 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (433 resets) in 221 ms. (180 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (434 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (424 resets) in 153 ms. (259 steps per ms) remains 4/5 properties
[2024-06-01 17:04:10] [INFO ] Flow matrix only has 1607 transitions (discarded 9 similar events)
[2024-06-01 17:04:10] [INFO ] Invariant cache hit.
[2024-06-01 17:04:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 108/136 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 110/246 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 270/516 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 66/582 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/586 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/586 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1607/2193 variables, 586/668 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2193 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2193 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/2194 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2194 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/2194 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2194/2194 variables, and 670 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1691 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 587/587 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 108/136 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 110/246 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 270/516 variables, 27/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 66/582 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 17:04:12] [INFO ] Deduced a trap composed of 17 places in 463 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 17:04:13] [INFO ] Deduced a trap composed of 116 places in 462 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/586 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/586 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1607/2193 variables, 586/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2193 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2193 variables, 3/674 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 17:04:16] [INFO ] Deduced a trap composed of 248 places in 401 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2193 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2193 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 20 (OVERLAPS) 1/2194 variables, 1/676 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2194 variables, 1/677 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2194 variables, 0/677 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/2194 variables, 0/677 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2194/2194 variables, and 677 constraints, problems are : Problem set: 1 solved, 3 unsolved in 10070 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 587/587 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 11783ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 28 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=9 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 19 ms.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 1683/1683 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 654 transition count 1683
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 653 transition count 1682
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 653 transition count 1682
Applied a total of 3 rules in 84 ms. Remains 653 /655 variables (removed 2) and now considering 1682/1683 (removed 1) transitions.
Running 1671 sub problems to find dead transitions.
[2024-06-01 17:04:22] [INFO ] Flow matrix only has 1673 transitions (discarded 9 similar events)
// Phase 1: matrix 1673 rows 653 cols
[2024-06-01 17:04:22] [INFO ] Computed 82 invariants in 32 ms
[2024-06-01 17:04:22] [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, 1671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1671 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 Real declared 642/2326 variables, and 71 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 20051 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: 1671/1671 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
[2024-06-01 17:05:01] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 2 ms to minimize.
[2024-06-01 17:05:03] [INFO ] Deduced a trap composed of 83 places in 193 ms of which 2 ms to minimize.
[2024-06-01 17:05:04] [INFO ] Deduced a trap composed of 82 places in 215 ms of which 2 ms to minimize.
[2024-06-01 17:05:05] [INFO ] Deduced a trap composed of 82 places in 228 ms of which 3 ms to minimize.
[2024-06-01 17:05:06] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 3 ms to minimize.
[2024-06-01 17:05:08] [INFO ] Deduced a trap composed of 82 places in 247 ms of which 1 ms to minimize.
[2024-06-01 17:05:10] [INFO ] Deduced a trap composed of 82 places in 229 ms of which 3 ms to minimize.
[2024-06-01 17:05:15] [INFO ] Deduced a trap composed of 83 places in 198 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(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 0)
(s71 1)
(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 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 8)
(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 0)
(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)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 2)
(s141 0)
(s142 0)
(s144 0)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 1)
(s177 1)
(s178 0)
(s179 0)
(s180 2)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2326 variables, and 79 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 20026 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/1671 constraints, Known Traps: 8/8 constraints]
After SMT, in 55573ms problems are : Problem set: 0 solved, 1671 unsolved
Search for dead transitions found 0 dead transitions in 55600ms
[2024-06-01 17:05:18] [INFO ] Flow matrix only has 1673 transitions (discarded 9 similar events)
[2024-06-01 17:05:18] [INFO ] Invariant cache hit.
[2024-06-01 17:05:19] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-06-01 17:05:19] [INFO ] Flow matrix only has 1673 transitions (discarded 9 similar events)
[2024-06-01 17:05:19] [INFO ] Invariant cache hit.
[2024-06-01 17:05:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:05:35] [INFO ] Implicit Places using invariants and state equation in 16692 ms returned []
Implicit Place search using SMT with State Equation took 17420 ms to find 0 implicit places.
Running 1671 sub problems to find dead transitions.
[2024-06-01 17:05:35] [INFO ] Flow matrix only has 1673 transitions (discarded 9 similar events)
[2024-06-01 17:05:35] [INFO ] Invariant cache hit.
[2024-06-01 17:05:35] [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, 1671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2326 variables, and 71 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 30033 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: 1671/1671 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
[2024-06-01 17:06:24] [INFO ] Deduced a trap composed of 82 places in 199 ms of which 2 ms to minimize.
[2024-06-01 17:06:28] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 2 ms to minimize.
[2024-06-01 17:06:30] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 3 ms to minimize.
[2024-06-01 17:06:31] [INFO ] Deduced a trap composed of 83 places in 255 ms of which 3 ms to minimize.
[2024-06-01 17:06:31] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 3 ms to minimize.
[2024-06-01 17:06:36] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 2 ms to minimize.
[2024-06-01 17:06:40] [INFO ] Deduced a trap composed of 83 places in 211 ms of which 2 ms to minimize.
[2024-06-01 17:06:45] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
[2024-06-01 17:06:49] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2326 variables, and 80 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 30025 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/1671 constraints, Known Traps: 9/9 constraints]
After SMT, in 77524ms problems are : Problem set: 0 solved, 1671 unsolved
Search for dead transitions found 0 dead transitions in 77547ms
Starting structural reductions in LTL mode, iteration 1 : 653/655 places, 1682/1683 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150666 ms. Remains : 653/655 places, 1682/1683 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLCardinality-00 finished in 150996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 1683/1683 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1648
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 1648
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1614
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1613
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1613
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 144 place count 582 transition count 1611
Applied a total of 144 rules in 169 ms. Remains 582 /655 variables (removed 73) and now considering 1611/1683 (removed 72) transitions.
Running 1600 sub problems to find dead transitions.
[2024-06-01 17:06:53] [INFO ] Flow matrix only has 1602 transitions (discarded 9 similar events)
// Phase 1: matrix 1602 rows 582 cols
[2024-06-01 17:06:53] [INFO ] Computed 82 invariants in 20 ms
[2024-06-01 17:06:53] [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, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/2184 variables, and 72 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 113 places in 304 ms of which 4 ms to minimize.
[2024-06-01 17:07:33] [INFO ] Deduced a trap composed of 81 places in 252 ms of which 4 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 155 places in 314 ms of which 5 ms to minimize.
[2024-06-01 17:07:34] [INFO ] Deduced a trap composed of 137 places in 272 ms of which 4 ms to minimize.
[2024-06-01 17:07:35] [INFO ] Deduced a trap composed of 156 places in 316 ms of which 4 ms to minimize.
[2024-06-01 17:07:35] [INFO ] Deduced a trap composed of 161 places in 307 ms of which 5 ms to minimize.
[2024-06-01 17:07:36] [INFO ] Deduced a trap composed of 161 places in 294 ms of which 4 ms to minimize.
[2024-06-01 17:07:36] [INFO ] Deduced a trap composed of 125 places in 320 ms of which 3 ms to minimize.
[2024-06-01 17:07:37] [INFO ] Deduced a trap composed of 80 places in 290 ms of which 5 ms to minimize.
[2024-06-01 17:07:37] [INFO ] Deduced a trap composed of 81 places in 311 ms of which 4 ms to minimize.
[2024-06-01 17:07:38] [INFO ] Deduced a trap composed of 145 places in 503 ms of which 4 ms to minimize.
[2024-06-01 17:07:38] [INFO ] Deduced a trap composed of 155 places in 434 ms of which 3 ms to minimize.
[2024-06-01 17:07:39] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 1 ms to minimize.
[2024-06-01 17:07:39] [INFO ] Deduced a trap composed of 139 places in 463 ms of which 3 ms to minimize.
[2024-06-01 17:07:40] [INFO ] Deduced a trap composed of 110 places in 432 ms of which 5 ms to minimize.
[2024-06-01 17:07:40] [INFO ] Deduced a trap composed of 117 places in 500 ms of which 4 ms to minimize.
[2024-06-01 17:07:41] [INFO ] Deduced a trap composed of 247 places in 440 ms of which 3 ms to minimize.
[2024-06-01 17:07:42] [INFO ] Deduced a trap composed of 82 places in 380 ms of which 4 ms to minimize.
[2024-06-01 17:07:42] [INFO ] Deduced a trap composed of 81 places in 299 ms of which 3 ms to minimize.
[2024-06-01 17:07:44] [INFO ] Deduced a trap composed of 156 places in 318 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-06-01 17:07:48] [INFO ] Deduced a trap composed of 250 places in 357 ms of which 4 ms to minimize.
[2024-06-01 17:07:49] [INFO ] Deduced a trap composed of 248 places in 414 ms of which 4 ms to minimize.
[2024-06-01 17:07:49] [INFO ] Deduced a trap composed of 245 places in 418 ms of which 4 ms to minimize.
[2024-06-01 17:07:49] [INFO ] Deduced a trap composed of 173 places in 364 ms of which 4 ms to minimize.
[2024-06-01 17:07:50] [INFO ] Deduced a trap composed of 168 places in 389 ms of which 4 ms to minimize.
[2024-06-01 17:07:51] [INFO ] Deduced a trap composed of 246 places in 292 ms of which 6 ms to minimize.
[2024-06-01 17:07:52] [INFO ] Deduced a trap composed of 169 places in 288 ms of which 3 ms to minimize.
[2024-06-01 17:07:52] [INFO ] Deduced a trap composed of 80 places in 290 ms of which 3 ms to minimize.
SMT process timed out in 58513ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 58529ms
[2024-06-01 17:07:52] [INFO ] Flow matrix only has 1602 transitions (discarded 9 similar events)
[2024-06-01 17:07:52] [INFO ] Invariant cache hit.
[2024-06-01 17:07:52] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-06-01 17:07:52] [INFO ] Flow matrix only has 1602 transitions (discarded 9 similar events)
[2024-06-01 17:07:52] [INFO ] Invariant cache hit.
[2024-06-01 17:07:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:08:07] [INFO ] Implicit Places using invariants and state equation in 14368 ms returned []
Implicit Place search using SMT with State Equation took 14969 ms to find 0 implicit places.
[2024-06-01 17:08:07] [INFO ] Redundant transitions in 151 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-06-01 17:08:07] [INFO ] Flow matrix only has 1602 transitions (discarded 9 similar events)
[2024-06-01 17:08:07] [INFO ] Invariant cache hit.
[2024-06-01 17:08:07] [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, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1280 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/582 variables, 10/82 constraints. Problems are: Problem set: 358 solved, 1242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/2184 variables, and 82 constraints, problems are : Problem set: 358 solved, 1242 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 358 solved, 1242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 63/63 constraints. Problems are: Problem set: 358 solved, 1242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 9/72 constraints. Problems are: Problem set: 358 solved, 1242 unsolved
[2024-06-01 17:08:54] [INFO ] Deduced a trap composed of 148 places in 290 ms of which 4 ms to minimize.
[2024-06-01 17:08:55] [INFO ] Deduced a trap composed of 19 places in 329 ms of which 2 ms to minimize.
[2024-06-01 17:08:56] [INFO ] Deduced a trap composed of 81 places in 466 ms of which 4 ms to minimize.
[2024-06-01 17:08:57] [INFO ] Deduced a trap composed of 131 places in 350 ms of which 4 ms to minimize.
[2024-06-01 17:08:57] [INFO ] Deduced a trap composed of 131 places in 319 ms of which 4 ms to minimize.
[2024-06-01 17:08:58] [INFO ] Deduced a trap composed of 80 places in 343 ms of which 4 ms to minimize.
[2024-06-01 17:08:58] [INFO ] Deduced a trap composed of 161 places in 399 ms of which 4 ms to minimize.
[2024-06-01 17:08:58] [INFO ] Deduced a trap composed of 149 places in 336 ms of which 4 ms to minimize.
[2024-06-01 17:08:59] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 4 ms to minimize.
[2024-06-01 17:08:59] [INFO ] Deduced a trap composed of 156 places in 326 ms of which 5 ms to minimize.
[2024-06-01 17:09:00] [INFO ] Deduced a trap composed of 242 places in 350 ms of which 4 ms to minimize.
[2024-06-01 17:09:00] [INFO ] Deduced a trap composed of 173 places in 299 ms of which 5 ms to minimize.
[2024-06-01 17:09:01] [INFO ] Deduced a trap composed of 238 places in 301 ms of which 4 ms to minimize.
[2024-06-01 17:09:01] [INFO ] Deduced a trap composed of 247 places in 320 ms of which 5 ms to minimize.
[2024-06-01 17:09:01] [INFO ] Deduced a trap composed of 215 places in 295 ms of which 4 ms to minimize.
[2024-06-01 17:09:02] [INFO ] Deduced a trap composed of 214 places in 359 ms of which 4 ms to minimize.
[2024-06-01 17:09:02] [INFO ] Deduced a trap composed of 219 places in 476 ms of which 4 ms to minimize.
[2024-06-01 17:09:03] [INFO ] Deduced a trap composed of 150 places in 422 ms of which 4 ms to minimize.
[2024-06-01 17:09:04] [INFO ] Deduced a trap composed of 144 places in 383 ms of which 4 ms to minimize.
[2024-06-01 17:09:04] [INFO ] Deduced a trap composed of 131 places in 342 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 20/92 constraints. Problems are: Problem set: 358 solved, 1242 unsolved
[2024-06-01 17:09:05] [INFO ] Deduced a trap composed of 81 places in 317 ms of which 4 ms to minimize.
[2024-06-01 17:09:06] [INFO ] Deduced a trap composed of 163 places in 485 ms of which 4 ms to minimize.
[2024-06-01 17:09:06] [INFO ] Deduced a trap composed of 149 places in 475 ms of which 4 ms to minimize.
[2024-06-01 17:09:07] [INFO ] Deduced a trap composed of 191 places in 468 ms of which 4 ms to minimize.
[2024-06-01 17:09:07] [INFO ] Deduced a trap composed of 139 places in 496 ms of which 4 ms to minimize.
[2024-06-01 17:09:08] [INFO ] Deduced a trap composed of 143 places in 426 ms of which 6 ms to minimize.
[2024-06-01 17:09:08] [INFO ] Deduced a trap composed of 149 places in 438 ms of which 4 ms to minimize.
[2024-06-01 17:09:09] [INFO ] Deduced a trap composed of 143 places in 413 ms of which 5 ms to minimize.
[2024-06-01 17:09:09] [INFO ] Deduced a trap composed of 162 places in 448 ms of which 4 ms to minimize.
[2024-06-01 17:09:10] [INFO ] Deduced a trap composed of 151 places in 502 ms of which 5 ms to minimize.
[2024-06-01 17:09:10] [INFO ] Deduced a trap composed of 158 places in 468 ms of which 4 ms to minimize.
[2024-06-01 17:09:11] [INFO ] Deduced a trap composed of 157 places in 403 ms of which 4 ms to minimize.
[2024-06-01 17:09:11] [INFO ] Deduced a trap composed of 155 places in 448 ms of which 4 ms to minimize.
[2024-06-01 17:09:12] [INFO ] Deduced a trap composed of 248 places in 424 ms of which 4 ms to minimize.
[2024-06-01 17:09:12] [INFO ] Deduced a trap composed of 239 places in 391 ms of which 3 ms to minimize.
[2024-06-01 17:09:12] [INFO ] Deduced a trap composed of 240 places in 391 ms of which 4 ms to minimize.
[2024-06-01 17:09:13] [INFO ] Deduced a trap composed of 254 places in 480 ms of which 4 ms to minimize.
[2024-06-01 17:09:13] [INFO ] Deduced a trap composed of 242 places in 451 ms of which 4 ms to minimize.
[2024-06-01 17:09:14] [INFO ] Deduced a trap composed of 206 places in 440 ms of which 4 ms to minimize.
[2024-06-01 17:09:14] [INFO ] Deduced a trap composed of 252 places in 413 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/572 variables, 20/112 constraints. Problems are: Problem set: 358 solved, 1242 unsolved
[2024-06-01 17:09:19] [INFO ] Deduced a trap composed of 82 places in 486 ms of which 5 ms to minimize.
[2024-06-01 17:09:20] [INFO ] Deduced a trap composed of 114 places in 470 ms of which 4 ms to minimize.
[2024-06-01 17:09:21] [INFO ] Deduced a trap composed of 163 places in 473 ms of which 4 ms to minimize.
[2024-06-01 17:09:22] [INFO ] Deduced a trap composed of 81 places in 539 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/2184 variables, and 116 constraints, problems are : Problem set: 358 solved, 1242 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/582 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 44/44 constraints]
After SMT, in 75506ms problems are : Problem set: 358 solved, 1242 unsolved
Search for dead transitions found 358 dead transitions in 75526ms
Found 358 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 358 transitions
Dead transitions reduction (with SMT) removed 358 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 582/655 places, 1253/1683 transitions.
Applied a total of 0 rules in 71 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-06-01 17:09:23] [INFO ] Redundant transitions in 88 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 149529 ms. Remains : 582/655 places, 1253/1683 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLCardinality-01
Stuttering criterion allowed to conclude after 20 steps with 1 reset in 2 ms.
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLCardinality-01 finished in 149660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 655 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 655/655 places, 1683/1683 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 654 transition count 1683
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 653 transition count 1682
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 653 transition count 1682
Applied a total of 3 rules in 49 ms. Remains 653 /655 variables (removed 2) and now considering 1682/1683 (removed 1) transitions.
Running 1671 sub problems to find dead transitions.
[2024-06-01 17:09:23] [INFO ] Flow matrix only has 1673 transitions (discarded 9 similar events)
// Phase 1: matrix 1673 rows 653 cols
[2024-06-01 17:09:23] [INFO ] Computed 82 invariants in 45 ms
[2024-06-01 17:09:23] [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, 1671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.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 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 1.0)
(s32 0.0)
(s33 (/ 2.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 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 (/ 2.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 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.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 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.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 1.0)
(s122 1.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)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.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 0.0)
(s179 0.0)
(s180 3.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.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)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 3.0)
(s210 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2326 variables, and 71 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 20028 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: 1671/1671 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
[2024-06-01 17:10:04] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 2 ms to minimize.
[2024-06-01 17:10:06] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 1 ms to minimize.
[2024-06-01 17:10:07] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 3 ms to minimize.
[2024-06-01 17:10:07] [INFO ] Deduced a trap composed of 82 places in 179 ms of which 2 ms to minimize.
[2024-06-01 17:10:08] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 2 ms to minimize.
[2024-06-01 17:10:09] [INFO ] Deduced a trap composed of 82 places in 232 ms of which 2 ms to minimize.
[2024-06-01 17:10:12] [INFO ] Deduced a trap composed of 82 places in 225 ms of which 2 ms to minimize.
[2024-06-01 17:10:17] [INFO ] Deduced a trap composed of 83 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2326 variables, and 79 constraints, problems are : Problem set: 0 solved, 1671 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: 0/1671 constraints, Known Traps: 8/8 constraints]
After SMT, in 57009ms problems are : Problem set: 0 solved, 1671 unsolved
Search for dead transitions found 0 dead transitions in 57035ms
[2024-06-01 17:10:20] [INFO ] Flow matrix only has 1673 transitions (discarded 9 similar events)
[2024-06-01 17:10:20] [INFO ] Invariant cache hit.
[2024-06-01 17:10:21] [INFO ] Implicit Places using invariants in 647 ms returned []
[2024-06-01 17:10:21] [INFO ] Flow matrix only has 1673 transitions (discarded 9 similar events)
[2024-06-01 17:10:21] [INFO ] Invariant cache hit.
[2024-06-01 17:10:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:10:37] [INFO ] Implicit Places using invariants and state equation in 16448 ms returned []
Implicit Place search using SMT with State Equation took 17101 ms to find 0 implicit places.
Running 1671 sub problems to find dead transitions.
[2024-06-01 17:10:37] [INFO ] Flow matrix only has 1673 transitions (discarded 9 similar events)
[2024-06-01 17:10:37] [INFO ] Invariant cache hit.
[2024-06-01 17:10:37] [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, 1671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1671 unsolved
Problem TDEAD948 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1681 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/653 variables, 11/82 constraints. Problems are: Problem set: 358 solved, 1313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/2326 variables, and 82 constraints, problems are : Problem set: 358 solved, 1313 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/653 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1671/1671 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 358 solved, 1313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 63/63 constraints. Problems are: Problem set: 358 solved, 1313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 8/71 constraints. Problems are: Problem set: 358 solved, 1313 unsolved
[2024-06-01 17:11:34] [INFO ] Deduced a trap composed of 82 places in 221 ms of which 3 ms to minimize.
[2024-06-01 17:11:35] [INFO ] Deduced a trap composed of 83 places in 194 ms of which 1 ms to minimize.
[2024-06-01 17:11:36] [INFO ] Deduced a trap composed of 19 places in 398 ms of which 2 ms to minimize.
[2024-06-01 17:11:37] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 4/75 constraints. Problems are: Problem set: 358 solved, 1313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2326 variables, and 75 constraints, problems are : Problem set: 358 solved, 1313 unsolved in 30021 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/1671 constraints, Known Traps: 4/4 constraints]
After SMT, in 77709ms problems are : Problem set: 358 solved, 1313 unsolved
Search for dead transitions found 358 dead transitions in 77731ms
Found 358 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 358 transitions
Dead transitions reduction (with SMT) removed 358 transitions
Starting structural reductions in LTL mode, iteration 1 : 653/655 places, 1324/1683 transitions.
Applied a total of 0 rules in 24 ms. Remains 653 /653 variables (removed 0) and now considering 1324/1324 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151954 ms. Remains : 653/655 places, 1324/1683 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 858 ms.
Product exploration explored 100000 steps with 50000 reset in 595 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 40 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J30-LTLCardinality-03 finished in 153618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 1683/1683 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1648
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 1648
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 619 transition count 1613
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 140 place count 584 transition count 1613
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1612
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1612
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 581 transition count 1610
Applied a total of 146 rules in 125 ms. Remains 581 /655 variables (removed 74) and now considering 1610/1683 (removed 73) transitions.
Running 1599 sub problems to find dead transitions.
[2024-06-01 17:11:57] [INFO ] Flow matrix only has 1601 transitions (discarded 9 similar events)
// Phase 1: matrix 1601 rows 581 cols
[2024-06-01 17:11:57] [INFO ] Computed 82 invariants in 40 ms
[2024-06-01 17:11:57] [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, 1599 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/2182 variables, and 72 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 20045 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: 1599/1599 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
[2024-06-01 17:12:34] [INFO ] Deduced a trap composed of 161 places in 368 ms of which 3 ms to minimize.
[2024-06-01 17:12:34] [INFO ] Deduced a trap composed of 80 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:12:34] [INFO ] Deduced a trap composed of 237 places in 200 ms of which 3 ms to minimize.
[2024-06-01 17:12:35] [INFO ] Deduced a trap composed of 80 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:12:35] [INFO ] Deduced a trap composed of 143 places in 202 ms of which 3 ms to minimize.
[2024-06-01 17:12:36] [INFO ] Deduced a trap composed of 161 places in 214 ms of which 3 ms to minimize.
[2024-06-01 17:12:36] [INFO ] Deduced a trap composed of 79 places in 199 ms of which 3 ms to minimize.
[2024-06-01 17:12:36] [INFO ] Deduced a trap composed of 154 places in 203 ms of which 2 ms to minimize.
[2024-06-01 17:12:36] [INFO ] Deduced a trap composed of 172 places in 218 ms of which 3 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 112 places in 225 ms of which 3 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 79 places in 203 ms of which 2 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 1 ms to minimize.
[2024-06-01 17:12:37] [INFO ] Deduced a trap composed of 19 places in 228 ms of which 1 ms to minimize.
[2024-06-01 17:12:38] [INFO ] Deduced a trap composed of 266 places in 324 ms of which 3 ms to minimize.
[2024-06-01 17:12:38] [INFO ] Deduced a trap composed of 131 places in 326 ms of which 3 ms to minimize.
[2024-06-01 17:12:39] [INFO ] Deduced a trap composed of 212 places in 339 ms of which 3 ms to minimize.
[2024-06-01 17:12:39] [INFO ] Deduced a trap composed of 79 places in 323 ms of which 3 ms to minimize.
[2024-06-01 17:12:40] [INFO ] Deduced a trap composed of 163 places in 325 ms of which 2 ms to minimize.
[2024-06-01 17:12:40] [INFO ] Deduced a trap composed of 149 places in 328 ms of which 3 ms to minimize.
[2024-06-01 17:12:41] [INFO ] Deduced a trap composed of 163 places in 383 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
[2024-06-01 17:12:41] [INFO ] Deduced a trap composed of 149 places in 207 ms of which 3 ms to minimize.
[2024-06-01 17:12:41] [INFO ] Deduced a trap composed of 80 places in 212 ms of which 3 ms to minimize.
[2024-06-01 17:12:42] [INFO ] Deduced a trap composed of 149 places in 341 ms of which 3 ms to minimize.
[2024-06-01 17:12:42] [INFO ] Deduced a trap composed of 90 places in 427 ms of which 3 ms to minimize.
[2024-06-01 17:12:43] [INFO ] Deduced a trap composed of 101 places in 309 ms of which 2 ms to minimize.
[2024-06-01 17:12:43] [INFO ] Deduced a trap composed of 116 places in 300 ms of which 2 ms to minimize.
[2024-06-01 17:12:43] [INFO ] Deduced a trap composed of 125 places in 337 ms of which 3 ms to minimize.
[2024-06-01 17:12:44] [INFO ] Deduced a trap composed of 80 places in 318 ms of which 3 ms to minimize.
[2024-06-01 17:12:44] [INFO ] Deduced a trap composed of 172 places in 341 ms of which 2 ms to minimize.
[2024-06-01 17:12:45] [INFO ] Deduced a trap composed of 181 places in 356 ms of which 2 ms to minimize.
[2024-06-01 17:12:45] [INFO ] Deduced a trap composed of 169 places in 331 ms of which 3 ms to minimize.
[2024-06-01 17:12:45] [INFO ] Deduced a trap composed of 175 places in 353 ms of which 3 ms to minimize.
[2024-06-01 17:12:46] [INFO ] Deduced a trap composed of 136 places in 351 ms of which 3 ms to minimize.
[2024-06-01 17:12:46] [INFO ] Deduced a trap composed of 100 places in 378 ms of which 4 ms to minimize.
[2024-06-01 17:12:46] [INFO ] Deduced a trap composed of 166 places in 357 ms of which 3 ms to minimize.
[2024-06-01 17:12:47] [INFO ] Deduced a trap composed of 148 places in 352 ms of which 3 ms to minimize.
[2024-06-01 17:12:47] [INFO ] Deduced a trap composed of 142 places in 374 ms of which 2 ms to minimize.
[2024-06-01 17:12:47] [INFO ] Deduced a trap composed of 167 places in 313 ms of which 2 ms to minimize.
[2024-06-01 17:12:48] [INFO ] Deduced a trap composed of 144 places in 343 ms of which 3 ms to minimize.
[2024-06-01 17:12:48] [INFO ] Deduced a trap composed of 154 places in 324 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
[2024-06-01 17:12:50] [INFO ] Deduced a trap composed of 160 places in 325 ms of which 3 ms to minimize.
[2024-06-01 17:12:50] [INFO ] Deduced a trap composed of 172 places in 356 ms of which 3 ms to minimize.
[2024-06-01 17:12:50] [INFO ] Deduced a trap composed of 145 places in 321 ms of which 3 ms to minimize.
[2024-06-01 17:12:51] [INFO ] Deduced a trap composed of 142 places in 325 ms of which 3 ms to minimize.
[2024-06-01 17:12:52] [INFO ] Deduced a trap composed of 161 places in 377 ms of which 3 ms to minimize.
SMT process timed out in 54936ms, After SMT, problems are : Problem set: 0 solved, 1599 unsolved
Search for dead transitions found 0 dead transitions in 54949ms
[2024-06-01 17:12:52] [INFO ] Flow matrix only has 1601 transitions (discarded 9 similar events)
[2024-06-01 17:12:52] [INFO ] Invariant cache hit.
[2024-06-01 17:12:52] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-06-01 17:12:52] [INFO ] Flow matrix only has 1601 transitions (discarded 9 similar events)
[2024-06-01 17:12:52] [INFO ] Invariant cache hit.
[2024-06-01 17:12:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:13:02] [INFO ] Implicit Places using invariants and state equation in 10024 ms returned []
Implicit Place search using SMT with State Equation took 10667 ms to find 0 implicit places.
[2024-06-01 17:13:02] [INFO ] Redundant transitions in 85 ms returned []
Running 1599 sub problems to find dead transitions.
[2024-06-01 17:13:02] [INFO ] Flow matrix only has 1601 transitions (discarded 9 similar events)
[2024-06-01 17:13:02] [INFO ] Invariant cache hit.
[2024-06-01 17:13:02] [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, 1599 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1599 unsolved
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1285 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 10/581 variables, 10/82 constraints. Problems are: Problem set: 358 solved, 1241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/2182 variables, and 82 constraints, problems are : Problem set: 358 solved, 1241 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/581 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1599/1599 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 358 solved, 1241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 63/63 constraints. Problems are: Problem set: 358 solved, 1241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 9/72 constraints. Problems are: Problem set: 358 solved, 1241 unsolved
[2024-06-01 17:13:51] [INFO ] Deduced a trap composed of 80 places in 218 ms of which 4 ms to minimize.
[2024-06-01 17:13:52] [INFO ] Deduced a trap composed of 19 places in 298 ms of which 1 ms to minimize.
[2024-06-01 17:13:53] [INFO ] Deduced a trap composed of 160 places in 337 ms of which 3 ms to minimize.
[2024-06-01 17:13:55] [INFO ] Deduced a trap composed of 253 places in 330 ms of which 3 ms to minimize.
[2024-06-01 17:13:56] [INFO ] Deduced a trap composed of 198 places in 355 ms of which 2 ms to minimize.
[2024-06-01 17:13:57] [INFO ] Deduced a trap composed of 185 places in 347 ms of which 3 ms to minimize.
[2024-06-01 17:13:58] [INFO ] Deduced a trap composed of 80 places in 493 ms of which 4 ms to minimize.
[2024-06-01 17:14:00] [INFO ] Deduced a trap composed of 139 places in 483 ms of which 5 ms to minimize.
[2024-06-01 17:14:00] [INFO ] Deduced a trap composed of 132 places in 460 ms of which 3 ms to minimize.
[2024-06-01 17:14:01] [INFO ] Deduced a trap composed of 131 places in 385 ms of which 3 ms to minimize.
[2024-06-01 17:14:01] [INFO ] Deduced a trap composed of 104 places in 465 ms of which 4 ms to minimize.
[2024-06-01 17:14:02] [INFO ] Deduced a trap composed of 247 places in 490 ms of which 4 ms to minimize.
[2024-06-01 17:14:02] [INFO ] Deduced a trap composed of 280 places in 444 ms of which 3 ms to minimize.
[2024-06-01 17:14:03] [INFO ] Deduced a trap composed of 282 places in 390 ms of which 3 ms to minimize.
[2024-06-01 17:14:03] [INFO ] Deduced a trap composed of 247 places in 480 ms of which 4 ms to minimize.
[2024-06-01 17:14:09] [INFO ] Deduced a trap composed of 247 places in 291 ms of which 4 ms to minimize.
[2024-06-01 17:14:10] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 4 ms to minimize.
[2024-06-01 17:14:10] [INFO ] Deduced a trap composed of 243 places in 262 ms of which 3 ms to minimize.
[2024-06-01 17:14:10] [INFO ] Deduced a trap composed of 238 places in 241 ms of which 3 ms to minimize.
[2024-06-01 17:14:11] [INFO ] Deduced a trap composed of 229 places in 313 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/92 constraints. Problems are: Problem set: 358 solved, 1241 unsolved
[2024-06-01 17:14:14] [INFO ] Deduced a trap composed of 88 places in 477 ms of which 4 ms to minimize.
[2024-06-01 17:14:15] [INFO ] Deduced a trap composed of 149 places in 495 ms of which 5 ms to minimize.
[2024-06-01 17:14:15] [INFO ] Deduced a trap composed of 170 places in 477 ms of which 4 ms to minimize.
[2024-06-01 17:14:17] [INFO ] Deduced a trap composed of 168 places in 504 ms of which 5 ms to minimize.
[2024-06-01 17:14:17] [INFO ] Deduced a trap composed of 160 places in 462 ms of which 3 ms to minimize.
[2024-06-01 17:14:18] [INFO ] Deduced a trap composed of 173 places in 473 ms of which 4 ms to minimize.
[2024-06-01 17:14:19] [INFO ] Deduced a trap composed of 102 places in 489 ms of which 5 ms to minimize.
[2024-06-01 17:14:19] [INFO ] Deduced a trap composed of 151 places in 502 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 571/2182 variables, and 100 constraints, problems are : Problem set: 358 solved, 1241 unsolved in 30027 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/1599 constraints, Known Traps: 28/28 constraints]
After SMT, in 77348ms problems are : Problem set: 358 solved, 1241 unsolved
Search for dead transitions found 358 dead transitions in 77363ms
Found 358 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 358 transitions
Dead transitions reduction (with SMT) removed 358 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 581/655 places, 1252/1683 transitions.
Applied a total of 0 rules in 51 ms. Remains 581 /581 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2024-06-01 17:14:20] [INFO ] Redundant transitions in 16 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 143303 ms. Remains : 581/655 places, 1252/1683 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 66 steps with 4 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLCardinality-05 finished in 143389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 655 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 655/655 places, 1683/1683 transitions.
Ensure Unique test removed 1 places
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 1647
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 1647
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 1612
Deduced a syphon composed of 35 places in 0 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 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 582 transition count 1611
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 582 transition count 1611
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 1609
Applied a total of 148 rules in 146 ms. Remains 580 /655 variables (removed 75) and now considering 1609/1683 (removed 74) transitions.
Running 1598 sub problems to find dead transitions.
[2024-06-01 17:14:20] [INFO ] Flow matrix only has 1600 transitions (discarded 9 similar events)
// Phase 1: matrix 1600 rows 580 cols
[2024-06-01 17:14:20] [INFO ] Computed 82 invariants in 15 ms
[2024-06-01 17:14:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/2180 variables, and 72 constraints, problems are : Problem set: 0 solved, 1598 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1598/1598 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1598 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 142 places in 229 ms of which 4 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 79 places in 321 ms of which 4 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 153 places in 325 ms of which 4 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 160 places in 313 ms of which 4 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 1 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 123 places in 380 ms of which 3 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 147 places in 367 ms of which 3 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 78 places in 379 ms of which 4 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 79 places in 353 ms of which 3 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 175 places in 414 ms of which 3 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 166 places in 355 ms of which 3 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 157 places in 423 ms of which 3 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 79 places in 382 ms of which 3 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 151 places in 369 ms of which 3 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 165 places in 371 ms of which 3 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 79 places in 364 ms of which 3 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 87 places in 355 ms of which 3 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 78 places in 347 ms of which 3 ms to minimize.
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 181 places in 369 ms of which 2 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 246 places in 350 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1598 unsolved
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 119 places in 230 ms of which 3 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 141 places in 226 ms of which 3 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 165 places in 219 ms of which 3 ms to minimize.
[2024-06-01 17:15:12] [INFO ] Deduced a trap composed of 154 places in 374 ms of which 3 ms to minimize.
[2024-06-01 17:15:12] [INFO ] Deduced a trap composed of 79 places in 351 ms of which 3 ms to minimize.
[2024-06-01 17:15:12] [INFO ] Deduced a trap composed of 144 places in 450 ms of which 3 ms to minimize.
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 162 places in 430 ms of which 3 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 142 places in 434 ms of which 4 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 87 places in 407 ms of which 3 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 147 places in 344 ms of which 3 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 87 places in 316 ms of which 3 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 171 places in 356 ms of which 3 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 147 places in 354 ms of which 3 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 78 places in 337 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/2180 variables, and 106 constraints, problems are : Problem set: 0 solved, 1598 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 9/19 constraints, State Equation: 0/580 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1598 constraints, Known Traps: 34/34 constraints]
After SMT, in 55913ms problems are : Problem set: 0 solved, 1598 unsolved
Search for dead transitions found 0 dead transitions in 55926ms
[2024-06-01 17:15:16] [INFO ] Flow matrix only has 1600 transitions (discarded 9 similar events)
[2024-06-01 17:15:16] [INFO ] Invariant cache hit.
[2024-06-01 17:15:17] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-06-01 17:15:17] [INFO ] Flow matrix only has 1600 transitions (discarded 9 similar events)
[2024-06-01 17:15:17] [INFO ] Invariant cache hit.
[2024-06-01 17:15:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 17:15:28] [INFO ] Implicit Places using invariants and state equation in 11860 ms returned []
Implicit Place search using SMT with State Equation took 12574 ms to find 0 implicit places.
[2024-06-01 17:15:29] [INFO ] Redundant transitions in 31 ms returned []
Running 1598 sub problems to find dead transitions.
[2024-06-01 17:15:29] [INFO ] Flow matrix only has 1600 transitions (discarded 9 similar events)
[2024-06-01 17:15:29] [INFO ] Invariant cache hit.
[2024-06-01 17:15:29] [INFO ] State equation strengthened by 1 read => feed constraints.
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLCardinality-05
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : PolyORBNT-PT-S10J30-LTLCardinality-10
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717262686128

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-00
ltl formula formula --ltl=/tmp/1433/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.070 real 0.870 user 0.510 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12056 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~17!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 35
pnml2lts-mc( 0/ 4): unique transitions count: 220
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 38
pnml2lts-mc( 0/ 4): - cum. max stack depth: 38
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 38 states 257 transitions, fanout: 6.763
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.000 sec minimum, 0.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1900, Transitions per second: 12850
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 51.6 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-01
ltl formula formula --ltl=/tmp/1433/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.370 real 0.670 user 0.760 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12055 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~18!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10
pnml2lts-mc( 0/ 4): unique states count: 50
pnml2lts-mc( 0/ 4): unique transitions count: 475
pnml2lts-mc( 0/ 4): - self-loop count: 3
pnml2lts-mc( 0/ 4): - claim dead count: 13
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 55
pnml2lts-mc( 0/ 4): - cum. max stack depth: 45
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 55 states 547 transitions, fanout: 9.945
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.027 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1833, Transitions per second: 18233
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 32.8 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-02
ltl formula formula --ltl=/tmp/1433/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.590 real 0.760 user 0.800 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12062 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~14!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 32
pnml2lts-mc( 0/ 4): unique transitions count: 267
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 35
pnml2lts-mc( 0/ 4): - cum. max stack depth: 35
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 35 states 304 transitions, fanout: 8.686
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1750, Transitions per second: 15200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 48.7 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-03
ltl formula formula --ltl=/tmp/1433/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.590 real 0.840 user 0.800 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12052 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12
pnml2lts-mc( 0/ 4): unique states count: 12
pnml2lts-mc( 0/ 4): unique transitions count: 11
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 18
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18 states 48 transitions, fanout: 2.667
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.000 sec minimum, 0.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 900, Transitions per second: 2400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 170.0 B/state, compr.: 6.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-04
ltl formula formula --ltl=/tmp/1433/ltl_4_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.250 real 0.670 user 0.390 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 700 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12057 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~18!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 36
pnml2lts-mc( 0/ 4): unique transitions count: 223
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 39
pnml2lts-mc( 0/ 4): - cum. max stack depth: 39
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 39 states 260 transitions, fanout: 6.667
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.018 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1950, Transitions per second: 13000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 49.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-05
ltl formula formula --ltl=/tmp/1433/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.560 real 0.630 user 0.450 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12053 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~30 levels ~10000 states ~28016 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~20000 states ~47544 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~40000 states ~100988 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~80000 states ~200824 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~160000 states ~399944 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~320000 states ~798156 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~640000 states ~1600672 transitions
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-06
ltl formula formula --ltl=/tmp/1433/ltl_6_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.380 real 0.790 user 0.620 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12054 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~18!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 23
pnml2lts-mc( 0/ 4): unique transitions count: 135
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 26
pnml2lts-mc( 0/ 4): - cum. max stack depth: 26
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26 states 172 transitions, fanout: 6.615
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.000 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1300, Transitions per second: 8600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 58.4 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-07
ltl formula formula --ltl=/tmp/1433/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.940 real 0.540 user 0.330 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12053 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~30!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1210
pnml2lts-mc( 0/ 4): unique states count: 1271
pnml2lts-mc( 0/ 4): unique transitions count: 5789
pnml2lts-mc( 0/ 4): - self-loop count: 177
pnml2lts-mc( 0/ 4): - claim dead count: 3493
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1281
pnml2lts-mc( 0/ 4): - cum. max stack depth: 82
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1281 states 5860 transitions, fanout: 4.575
pnml2lts-mc( 0/ 4): Total exploration time 0.660 sec (0.650 sec minimum, 0.655 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1941, Transitions per second: 8879
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 33.4 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-08
ltl formula formula --ltl=/tmp/1433/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.040 real 0.770 user 0.340 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12056 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~15!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 32
pnml2lts-mc( 0/ 4): unique transitions count: 226
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 35
pnml2lts-mc( 0/ 4): - cum. max stack depth: 35
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 35 states 263 transitions, fanout: 7.514
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.025 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1167, Transitions per second: 8767
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 48.7 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-09
ltl formula formula --ltl=/tmp/1433/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.040 real 0.790 user 0.300 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 700 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12061 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~18!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 60
pnml2lts-mc( 0/ 4): unique transitions count: 327
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 65
pnml2lts-mc( 0/ 4): - cum. max stack depth: 65
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 65 states 375 transitions, fanout: 5.769
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.030 sec minimum, 0.043 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1300, Transitions per second: 7500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 42.8 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-10
ltl formula formula --ltl=/tmp/1433/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.910 real 0.610 user 0.330 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 700 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12054 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~30 levels ~10000 states ~29396 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~20000 states ~53348 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~40000 states ~100684 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~80000 states ~202212 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~160000 states ~414536 transitions
pnml2lts-mc( 2/ 4): ~30 levels ~320000 states ~833928 transitions
pnml2lts-mc( 3/ 4): ~30 levels ~640000 states ~1672060 transitions
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-11
ltl formula formula --ltl=/tmp/1433/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.540 real 0.590 user 0.580 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12051 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~15!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 40
pnml2lts-mc( 0/ 4): unique transitions count: 242
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 45
pnml2lts-mc( 0/ 4): - cum. max stack depth: 45
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 45 states 299 transitions, fanout: 6.644
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4500, Transitions per second: 29900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 46.1 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-12
ltl formula formula --ltl=/tmp/1433/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.980 real 0.570 user 0.560 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 700 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12062 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~30!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1335
pnml2lts-mc( 0/ 4): unique states count: 1397
pnml2lts-mc( 0/ 4): unique transitions count: 6204
pnml2lts-mc( 0/ 4): - self-loop count: 175
pnml2lts-mc( 0/ 4): - claim dead count: 3988
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1405
pnml2lts-mc( 0/ 4): - cum. max stack depth: 82
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1405 states 6255 transitions, fanout: 4.452
pnml2lts-mc( 0/ 4): Total exploration time 0.400 sec (0.390 sec minimum, 0.392 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3512, Transitions per second: 15638
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 31.8 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-13
ltl formula formula --ltl=/tmp/1433/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.480 real 0.610 user 0.440 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12068 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~17!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 49
pnml2lts-mc( 0/ 4): unique transitions count: 606
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 53
pnml2lts-mc( 0/ 4): - cum. max stack depth: 53
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 53 states 653 transitions, fanout: 12.321
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1767, Transitions per second: 21767
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 51.5 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-14
ltl formula formula --ltl=/tmp/1433/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.650 real 0.680 user 0.460 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 700 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12056 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~30 levels ~10000 states ~28256 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~30!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15682
pnml2lts-mc( 0/ 4): unique states count: 15815
pnml2lts-mc( 0/ 4): unique transitions count: 47622
pnml2lts-mc( 0/ 4): - self-loop count: 739
pnml2lts-mc( 0/ 4): - claim dead count: 29478
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 15832
pnml2lts-mc( 0/ 4): - cum. max stack depth: 157
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15832 states 47714 transitions, fanout: 3.014
pnml2lts-mc( 0/ 4): Total exploration time 3.500 sec (3.490 sec minimum, 3.497 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4523, Transitions per second: 13633
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 26.3 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name PolyORBNT-PT-S10J30-LTLCardinality-15
ltl formula formula --ltl=/tmp/1433/ltl_15_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 664 places, 12050 transitions and 112559 arcs
pnml2lts-mc( 0/ 4): Petri net PolyORBNT-PT-S10J30 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.630 real 0.680 user 0.430 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1433/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1433/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1433/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1433/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 701 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 665, there are 12057 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~14!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 31
pnml2lts-mc( 0/ 4): unique transitions count: 232
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 34
pnml2lts-mc( 0/ 4): - cum. max stack depth: 34
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 34 states 302 transitions, fanout: 8.882
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.023 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1133, Transitions per second: 10067
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 46.3 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 12306 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-PT-S10J30, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654447200491"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;