About the Execution of ITS-Tools for StigmergyCommit-PT-05b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 360436.00 | 0.00 | 0.00 | [undef] | Cannot compute |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531700145.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyCommit-PT-05b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531700145
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.4M 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 StigmergyCommit-PT-05b-CTLCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2023-12
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2023-13
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2023-14
FORMULA_NAME StigmergyCommit-PT-05b-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716987489172
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 12:58:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:58:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:58:10] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-29 12:58:10] [INFO ] Transformed 1837 places.
[2024-05-29 12:58:10] [INFO ] Transformed 3460 transitions.
[2024-05-29 12:58:10] [INFO ] Found NUPN structural information;
[2024-05-29 12:58:10] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 336 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 146 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Discarding 133 places :
Symmetric choice reduction at 0 with 133 rule applications. Total rules 133 place count 1704 transition count 3327
Iterating global reduction 0 with 133 rules applied. Total rules applied 266 place count 1704 transition count 3327
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 342 place count 1628 transition count 3251
Iterating global reduction 0 with 76 rules applied. Total rules applied 418 place count 1628 transition count 3251
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 460 place count 1586 transition count 3209
Iterating global reduction 0 with 42 rules applied. Total rules applied 502 place count 1586 transition count 3209
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 537 place count 1551 transition count 3174
Iterating global reduction 0 with 35 rules applied. Total rules applied 572 place count 1551 transition count 3174
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 599 place count 1524 transition count 3147
Iterating global reduction 0 with 27 rules applied. Total rules applied 626 place count 1524 transition count 3147
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 650 place count 1500 transition count 3123
Iterating global reduction 0 with 24 rules applied. Total rules applied 674 place count 1500 transition count 3123
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 696 place count 1478 transition count 3101
Iterating global reduction 0 with 22 rules applied. Total rules applied 718 place count 1478 transition count 3101
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 739 place count 1457 transition count 3080
Iterating global reduction 0 with 21 rules applied. Total rules applied 760 place count 1457 transition count 3080
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 775 place count 1442 transition count 3065
Iterating global reduction 0 with 15 rules applied. Total rules applied 790 place count 1442 transition count 3065
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 799 place count 1433 transition count 3056
Iterating global reduction 0 with 9 rules applied. Total rules applied 808 place count 1433 transition count 3056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 809 place count 1433 transition count 3055
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 811 place count 1431 transition count 3053
Iterating global reduction 1 with 2 rules applied. Total rules applied 813 place count 1431 transition count 3053
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 815 place count 1429 transition count 3051
Iterating global reduction 1 with 2 rules applied. Total rules applied 817 place count 1429 transition count 3051
Applied a total of 817 rules in 1150 ms. Remains 1429 /1837 variables (removed 408) and now considering 3051/3460 (removed 409) transitions.
// Phase 1: matrix 3051 rows 1429 cols
[2024-05-29 12:58:12] [INFO ] Computed 7 invariants in 65 ms
[2024-05-29 12:58:12] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-05-29 12:58:12] [INFO ] Invariant cache hit.
[2024-05-29 12:58:14] [INFO ] Implicit Places using invariants and state equation in 1621 ms returned []
Implicit Place search using SMT with State Equation took 2518 ms to find 0 implicit places.
Running 3050 sub problems to find dead transitions.
[2024-05-29 12:58:14] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1428/4480 variables, and 0 constraints, problems are : Problem set: 0 solved, 3050 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1429 constraints, PredecessorRefiner: 3050/3050 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3050 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/4480 variables, and 0 constraints, problems are : Problem set: 0 solved, 3050 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1429 constraints, PredecessorRefiner: 0/3050 constraints, Known Traps: 0/0 constraints]
After SMT, in 80141ms problems are : Problem set: 0 solved, 3050 unsolved
Search for dead transitions found 0 dead transitions in 80198ms
Starting structural reductions in LTL mode, iteration 1 : 1429/1837 places, 3051/3460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83910 ms. Remains : 1429/1837 places, 3051/3460 transitions.
Support contains 146 out of 1429 places after structural reductions.
[2024-05-29 12:59:35] [INFO ] Flatten gal took : 290 ms
[2024-05-29 12:59:35] [INFO ] Flatten gal took : 179 ms
[2024-05-29 12:59:35] [INFO ] Input system was already deterministic with 3051 transitions.
Support contains 125 out of 1429 places (down from 146) after GAL structural reductions.
RANDOM walk for 40000 steps (353 resets) in 1921 ms. (20 steps per ms) remains 51/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
[2024-05-29 12:59:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1328/1415 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1415 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 14/1429 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1429 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 3051/4480 variables, 1429/1436 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4480/4480 variables, and 1436 constraints, problems are : Problem set: 0 solved, 51 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1429/1429 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1328/1415 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-29 12:59:43] [INFO ] Deduced a trap composed of 341 places in 1026 ms of which 73 ms to minimize.
[2024-05-29 12:59:44] [INFO ] Deduced a trap composed of 332 places in 908 ms of which 10 ms to minimize.
[2024-05-29 12:59:45] [INFO ] Deduced a trap composed of 333 places in 806 ms of which 7 ms to minimize.
[2024-05-29 12:59:45] [INFO ] Deduced a trap composed of 336 places in 807 ms of which 7 ms to minimize.
[2024-05-29 12:59:46] [INFO ] Deduced a trap composed of 333 places in 984 ms of which 8 ms to minimize.
[2024-05-29 12:59:47] [INFO ] Deduced a trap composed of 344 places in 1017 ms of which 9 ms to minimize.
SMT process timed out in 11049ms, After SMT, problems are : Problem set: 0 solved, 51 unsolved
Fused 51 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 87 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 3051/3051 transitions.
Graph (trivial) has 1256 edges and 1429 vertex of which 82 / 1429 are part of one of the 15 SCC in 6 ms
Free SCC test removed 67 places
Drop transitions (Empty/Sink Transition effects.) removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 2356 edges and 1362 vertex of which 1357 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.19 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 881 transitions
Trivial Post-agglo rules discarded 881 transitions
Performed 881 trivial Post agglomeration. Transition count delta: 881
Iterating post reduction 0 with 884 rules applied. Total rules applied 886 place count 1357 transition count 2079
Reduce places removed 881 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 888 rules applied. Total rules applied 1774 place count 476 transition count 2072
Reduce places removed 3 places and 0 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Iterating post reduction 2 with 46 rules applied. Total rules applied 1820 place count 473 transition count 2029
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 47 rules applied. Total rules applied 1867 place count 430 transition count 2025
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1869 place count 428 transition count 2025
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 62 Pre rules applied. Total rules applied 1869 place count 428 transition count 1963
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 1993 place count 366 transition count 1963
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1998 place count 361 transition count 1958
Iterating global reduction 5 with 5 rules applied. Total rules applied 2003 place count 361 transition count 1958
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2004 place count 360 transition count 1957
Iterating global reduction 5 with 1 rules applied. Total rules applied 2005 place count 360 transition count 1957
Performed 49 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 2103 place count 311 transition count 1907
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2108 place count 311 transition count 1902
Discarding 29 places :
Symmetric choice reduction at 6 with 29 rule applications. Total rules 2137 place count 282 transition count 606
Iterating global reduction 6 with 29 rules applied. Total rules applied 2166 place count 282 transition count 606
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2177 place count 282 transition count 595
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2183 place count 276 transition count 589
Iterating global reduction 7 with 6 rules applied. Total rules applied 2189 place count 276 transition count 589
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2192 place count 273 transition count 586
Iterating global reduction 7 with 3 rules applied. Total rules applied 2195 place count 273 transition count 586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2196 place count 273 transition count 585
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2218 place count 262 transition count 574
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 2228 place count 257 transition count 580
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2230 place count 257 transition count 578
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2234 place count 257 transition count 574
Free-agglomeration rule applied 48 times.
Iterating global reduction 9 with 48 rules applied. Total rules applied 2282 place count 257 transition count 526
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 9 with 48 rules applied. Total rules applied 2330 place count 209 transition count 526
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2332 place count 207 transition count 524
Iterating global reduction 10 with 2 rules applied. Total rules applied 2334 place count 207 transition count 524
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 10 with 84 rules applied. Total rules applied 2418 place count 207 transition count 440
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2422 place count 207 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2424 place count 207 transition count 438
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2425 place count 206 transition count 437
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 10 with 15 rules applied. Total rules applied 2440 place count 205 transition count 423
Reduce places removed 14 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 11 with 26 rules applied. Total rules applied 2466 place count 191 transition count 411
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 12 with 12 rules applied. Total rules applied 2478 place count 179 transition count 411
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 4 Pre rules applied. Total rules applied 2478 place count 179 transition count 407
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2486 place count 175 transition count 407
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 13 with 26 rules applied. Total rules applied 2512 place count 162 transition count 393
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 2522 place count 162 transition count 383
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 2523 place count 161 transition count 351
Iterating global reduction 14 with 1 rules applied. Total rules applied 2524 place count 161 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 14 with 82 rules applied. Total rules applied 2606 place count 161 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2608 place count 160 transition count 275
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 2614 place count 160 transition count 269
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2620 place count 154 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 2624 place count 154 transition count 265
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2625 place count 154 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 2626 place count 154 transition count 264
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2627 place count 153 transition count 263
Iterating global reduction 15 with 1 rules applied. Total rules applied 2628 place count 153 transition count 263
Applied a total of 2628 rules in 471 ms. Remains 153 /1429 variables (removed 1276) and now considering 263/3051 (removed 2788) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 153/1429 places, 263/3051 transitions.
RANDOM walk for 40000 steps (1548 resets) in 424 ms. (94 steps per ms) remains 38/51 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (24 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (26 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (25 resets) in 19 ms. (200 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4004 steps (27 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (27 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (25 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (27 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (27 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (27 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (24 resets) in 14 ms. (266 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (25 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (25 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (27 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (21 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (25 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (22 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (26 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (27 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (25 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (26 resets) in 8 ms. (444 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (26 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (28 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
// Phase 1: matrix 263 rows 153 cols
[2024-05-29 12:59:48] [INFO ] Computed 4 invariants in 1 ms
[2024-05-29 12:59:48] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 58/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 234/354 variables, 120/124 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 26/150 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 48/402 variables, 22/172 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 41/213 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 13/415 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 1/416 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 0/416 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 224 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 58/120 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-29 12:59:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:59:50] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-29 12:59:50] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:59:50] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:59:50] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
Problem AtomicPropp18 is UNSAT
[2024-05-29 12:59:50] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:59:50] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 234/354 variables, 120/131 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 26/157 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 16/173 constraints. Problems are: Problem set: 1 solved, 34 unsolved
[2024-05-29 12:59:50] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 1/174 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 48/402 variables, 22/196 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 41/237 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 18/255 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 13/415 variables, 10/265 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 1/416 variables, 1/266 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/416 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 34 unsolved
At refinement iteration 17 (OVERLAPS) 0/416 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 266 constraints, problems are : Problem set: 1 solved, 34 unsolved in 3036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 34/35 constraints, Known Traps: 8/8 constraints]
After SMT, in 4406ms problems are : Problem set: 1 solved, 34 unsolved
Finished Parikh walk after 144 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=72 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 34 properties in 4235 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-29 12:59:57] [INFO ] Flatten gal took : 123 ms
[2024-05-29 12:59:57] [INFO ] Flatten gal took : 139 ms
[2024-05-29 12:59:58] [INFO ] Input system was already deterministic with 3051 transitions.
Computed a total of 254 stabilizing places and 266 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 3051/3051 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1393 transition count 3015
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1393 transition count 3015
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 99 place count 1366 transition count 2988
Iterating global reduction 0 with 27 rules applied. Total rules applied 126 place count 1366 transition count 2988
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 148 place count 1344 transition count 2966
Iterating global reduction 0 with 22 rules applied. Total rules applied 170 place count 1344 transition count 2966
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 189 place count 1325 transition count 2947
Iterating global reduction 0 with 19 rules applied. Total rules applied 208 place count 1325 transition count 2947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 209 place count 1325 transition count 2946
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 227 place count 1307 transition count 2928
Iterating global reduction 1 with 18 rules applied. Total rules applied 245 place count 1307 transition count 2928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 246 place count 1307 transition count 2927
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 262 place count 1291 transition count 2911
Iterating global reduction 2 with 16 rules applied. Total rules applied 278 place count 1291 transition count 2911
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 293 place count 1276 transition count 2896
Iterating global reduction 2 with 15 rules applied. Total rules applied 308 place count 1276 transition count 2896
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 309 place count 1276 transition count 2895
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 323 place count 1262 transition count 2881
Iterating global reduction 3 with 14 rules applied. Total rules applied 337 place count 1262 transition count 2881
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 349 place count 1250 transition count 2869
Iterating global reduction 3 with 12 rules applied. Total rules applied 361 place count 1250 transition count 2869
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 362 place count 1250 transition count 2868
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 373 place count 1239 transition count 2857
Iterating global reduction 4 with 11 rules applied. Total rules applied 384 place count 1239 transition count 2857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 385 place count 1239 transition count 2856
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 393 place count 1231 transition count 2848
Iterating global reduction 5 with 8 rules applied. Total rules applied 401 place count 1231 transition count 2848
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 407 place count 1225 transition count 2842
Iterating global reduction 5 with 6 rules applied. Total rules applied 413 place count 1225 transition count 2842
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 419 place count 1219 transition count 2836
Iterating global reduction 5 with 6 rules applied. Total rules applied 425 place count 1219 transition count 2836
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 431 place count 1213 transition count 2830
Iterating global reduction 5 with 6 rules applied. Total rules applied 437 place count 1213 transition count 2830
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 443 place count 1207 transition count 2824
Iterating global reduction 5 with 6 rules applied. Total rules applied 449 place count 1207 transition count 2824
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 455 place count 1201 transition count 2818
Iterating global reduction 5 with 6 rules applied. Total rules applied 461 place count 1201 transition count 2818
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 462 place count 1201 transition count 2817
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 467 place count 1196 transition count 2812
Iterating global reduction 6 with 5 rules applied. Total rules applied 472 place count 1196 transition count 2812
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 477 place count 1191 transition count 2807
Iterating global reduction 6 with 5 rules applied. Total rules applied 482 place count 1191 transition count 2807
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 483 place count 1191 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 487 place count 1187 transition count 2802
Iterating global reduction 7 with 4 rules applied. Total rules applied 491 place count 1187 transition count 2802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 492 place count 1187 transition count 2801
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 495 place count 1184 transition count 2798
Iterating global reduction 8 with 3 rules applied. Total rules applied 498 place count 1184 transition count 2798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 499 place count 1184 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 501 place count 1182 transition count 2795
Iterating global reduction 9 with 2 rules applied. Total rules applied 503 place count 1182 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 504 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 505 place count 1181 transition count 2793
Iterating global reduction 10 with 1 rules applied. Total rules applied 506 place count 1181 transition count 2793
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 507 place count 1181 transition count 2792
Applied a total of 507 rules in 1151 ms. Remains 1181 /1429 variables (removed 248) and now considering 2792/3051 (removed 259) transitions.
// Phase 1: matrix 2792 rows 1181 cols
[2024-05-29 12:59:59] [INFO ] Computed 7 invariants in 36 ms
[2024-05-29 12:59:59] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-29 12:59:59] [INFO ] Invariant cache hit.
[2024-05-29 13:00:01] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
Running 2791 sub problems to find dead transitions.
[2024-05-29 13:00:01] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1180/3973 variables, and 0 constraints, problems are : Problem set: 0 solved, 2791 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1181 constraints, PredecessorRefiner: 2791/2791 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2791 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1180/3973 variables, and 0 constraints, problems are : Problem set: 0 solved, 2791 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1181 constraints, PredecessorRefiner: 0/2791 constraints, Known Traps: 0/0 constraints]
After SMT, in 81125ms problems are : Problem set: 0 solved, 2791 unsolved
Search for dead transitions found 0 dead transitions in 81151ms
Starting structural reductions in LTL mode, iteration 1 : 1181/1429 places, 2792/3051 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84384 ms. Remains : 1181/1429 places, 2792/3051 transitions.
[2024-05-29 13:01:22] [INFO ] Flatten gal took : 101 ms
[2024-05-29 13:01:22] [INFO ] Flatten gal took : 107 ms
[2024-05-29 13:01:22] [INFO ] Input system was already deterministic with 2792 transitions.
[2024-05-29 13:01:23] [INFO ] Flatten gal took : 111 ms
[2024-05-29 13:01:23] [INFO ] Flatten gal took : 113 ms
[2024-05-29 13:01:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality10771816638258552863.gal : 64 ms
[2024-05-29 13:01:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality4366501289620205659.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10771816638258552863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4366501289620205659.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 13:01:53] [INFO ] Flatten gal took : 112 ms
[2024-05-29 13:01:53] [INFO ] Applying decomposition
[2024-05-29 13:01:53] [INFO ] Flatten gal took : 110 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7242728528017706534.txt' '-o' '/tmp/graph7242728528017706534.bin' '-w' '/tmp/graph7242728528017706534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7242728528017706534.bin' '-l' '-1' '-v' '-w' '/tmp/graph7242728528017706534.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:01:54] [INFO ] Decomposing Gal with order
[2024-05-29 13:01:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:01:54] [INFO ] Removed a total of 9311 redundant transitions.
[2024-05-29 13:01:54] [INFO ] Flatten gal took : 363 ms
[2024-05-29 13:01:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 102 ms.
[2024-05-29 13:01:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality17841862953516082166.gal : 32 ms
[2024-05-29 13:01:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality16881630790155743787.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17841862953516082166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16881630790155743787.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 3051/3051 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1392 transition count 3014
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1392 transition count 3014
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 101 place count 1365 transition count 2987
Iterating global reduction 0 with 27 rules applied. Total rules applied 128 place count 1365 transition count 2987
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 150 place count 1343 transition count 2965
Iterating global reduction 0 with 22 rules applied. Total rules applied 172 place count 1343 transition count 2965
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 192 place count 1323 transition count 2945
Iterating global reduction 0 with 20 rules applied. Total rules applied 212 place count 1323 transition count 2945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 213 place count 1323 transition count 2944
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 232 place count 1304 transition count 2925
Iterating global reduction 1 with 19 rules applied. Total rules applied 251 place count 1304 transition count 2925
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 252 place count 1304 transition count 2924
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 268 place count 1288 transition count 2908
Iterating global reduction 2 with 16 rules applied. Total rules applied 284 place count 1288 transition count 2908
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 299 place count 1273 transition count 2893
Iterating global reduction 2 with 15 rules applied. Total rules applied 314 place count 1273 transition count 2893
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 315 place count 1273 transition count 2892
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 329 place count 1259 transition count 2878
Iterating global reduction 3 with 14 rules applied. Total rules applied 343 place count 1259 transition count 2878
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 354 place count 1248 transition count 2867
Iterating global reduction 3 with 11 rules applied. Total rules applied 365 place count 1248 transition count 2867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 366 place count 1248 transition count 2866
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 376 place count 1238 transition count 2856
Iterating global reduction 4 with 10 rules applied. Total rules applied 386 place count 1238 transition count 2856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 387 place count 1238 transition count 2855
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 394 place count 1231 transition count 2848
Iterating global reduction 5 with 7 rules applied. Total rules applied 401 place count 1231 transition count 2848
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 406 place count 1226 transition count 2843
Iterating global reduction 5 with 5 rules applied. Total rules applied 411 place count 1226 transition count 2843
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 416 place count 1221 transition count 2838
Iterating global reduction 5 with 5 rules applied. Total rules applied 421 place count 1221 transition count 2838
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 426 place count 1216 transition count 2833
Iterating global reduction 5 with 5 rules applied. Total rules applied 431 place count 1216 transition count 2833
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 436 place count 1211 transition count 2828
Iterating global reduction 5 with 5 rules applied. Total rules applied 441 place count 1211 transition count 2828
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 446 place count 1206 transition count 2823
Iterating global reduction 5 with 5 rules applied. Total rules applied 451 place count 1206 transition count 2823
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 452 place count 1206 transition count 2822
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 456 place count 1202 transition count 2818
Iterating global reduction 6 with 4 rules applied. Total rules applied 460 place count 1202 transition count 2818
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 464 place count 1198 transition count 2814
Iterating global reduction 6 with 4 rules applied. Total rules applied 468 place count 1198 transition count 2814
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 469 place count 1198 transition count 2813
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 472 place count 1195 transition count 2810
Iterating global reduction 7 with 3 rules applied. Total rules applied 475 place count 1195 transition count 2810
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 478 place count 1192 transition count 2807
Iterating global reduction 7 with 3 rules applied. Total rules applied 481 place count 1192 transition count 2807
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 482 place count 1192 transition count 2806
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 484 place count 1190 transition count 2804
Iterating global reduction 8 with 2 rules applied. Total rules applied 486 place count 1190 transition count 2804
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 487 place count 1190 transition count 2803
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 488 place count 1189 transition count 2802
Iterating global reduction 9 with 1 rules applied. Total rules applied 489 place count 1189 transition count 2802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 490 place count 1189 transition count 2801
Applied a total of 490 rules in 896 ms. Remains 1189 /1429 variables (removed 240) and now considering 2801/3051 (removed 250) transitions.
// Phase 1: matrix 2801 rows 1189 cols
[2024-05-29 13:02:26] [INFO ] Computed 7 invariants in 29 ms
[2024-05-29 13:02:26] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-29 13:02:26] [INFO ] Invariant cache hit.
[2024-05-29 13:02:28] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
Running 2800 sub problems to find dead transitions.
[2024-05-29 13:02:28] [INFO ] Invariant cache hit.
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 1188/3990 variables, and 0 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1189 constraints, PredecessorRefiner: 2800/2800 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2800 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1188/3990 variables, and 0 constraints, problems are : Problem set: 0 solved, 2800 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1189 constraints, PredecessorRefiner: 0/2800 constraints, Known Traps: 0/0 constraints]
After SMT, in 79995ms problems are : Problem set: 0 solved, 2800 unsolved
Search for dead transitions found 0 dead transitions in 80022ms
Starting structural reductions in LTL mode, iteration 1 : 1189/1429 places, 2801/3051 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82900 ms. Remains : 1189/1429 places, 2801/3051 transitions.
[2024-05-29 13:03:48] [INFO ] Flatten gal took : 126 ms
[2024-05-29 13:03:48] [INFO ] Flatten gal took : 107 ms
[2024-05-29 13:03:48] [INFO ] Input system was already deterministic with 2801 transitions.
[2024-05-29 13:03:48] [INFO ] Flatten gal took : 106 ms
[2024-05-29 13:03:48] [INFO ] Flatten gal took : 103 ms
[2024-05-29 13:03:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality13526943620698017285.gal : 21 ms
[2024-05-29 13:03:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality13721180460265801502.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13526943620698017285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13721180460265801502.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
BK_STOP 1716987849608
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-05b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-05b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531700145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-05b.tgz
mv StigmergyCommit-PT-05b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;