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-171654446600225.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 PolyORBLF-PT-S02J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446600225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 717K 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 PolyORBLF-PT-S02J04T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S02J04T08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717252257807

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:30:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:30:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:30:59] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-06-01 14:30:59] [INFO ] Transformed 614 places.
[2024-06-01 14:30:59] [INFO ] Transformed 1242 transitions.
[2024-06-01 14:30:59] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Support contains 356 out of 614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 612 transition count 1114
Applied a total of 2 rules in 47 ms. Remains 612 /614 variables (removed 2) and now considering 1114/1114 (removed 0) transitions.
Running 1112 sub problems to find dead transitions.
[2024-06-01 14:30:59] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 612 cols
[2024-06-01 14:30:59] [INFO ] Computed 48 invariants in 51 ms
[2024-06-01 14:30:59] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 35 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 2 ms to minimize.
[2024-06-01 14:31:11] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 175 places in 225 ms of which 6 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 325 places in 217 ms of which 3 ms to minimize.
[2024-06-01 14:31:12] [INFO ] Deduced a trap composed of 310 places in 222 ms of which 4 ms to minimize.
[2024-06-01 14:31:13] [INFO ] Deduced a trap composed of 54 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:31:13] [INFO ] Deduced a trap composed of 369 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:31:13] [INFO ] Deduced a trap composed of 320 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:31:14] [INFO ] Deduced a trap composed of 343 places in 263 ms of which 5 ms to minimize.
[2024-06-01 14:31:14] [INFO ] Deduced a trap composed of 410 places in 227 ms of which 4 ms to minimize.
[2024-06-01 14:31:15] [INFO ] Deduced a trap composed of 394 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:31:15] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:31:16] [INFO ] Deduced a trap composed of 290 places in 324 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:31:19] [INFO ] Deduced a trap composed of 319 places in 286 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 67 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:31:35] [INFO ] Deduced a trap composed of 308 places in 283 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 68 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 22/22 constraints]
After SMT, in 41418ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41455ms
[2024-06-01 14:31:41] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:31:41] [INFO ] Invariant cache hit.
[2024-06-01 14:31:41] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-06-01 14:31:41] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:31:41] [INFO ] Invariant cache hit.
[2024-06-01 14:31:42] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:31:48] [INFO ] Implicit Places using invariants and state equation in 7362 ms returned []
Implicit Place search using SMT with State Equation took 7787 ms to find 0 implicit places.
Running 1112 sub problems to find dead transitions.
[2024-06-01 14:31:48] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:31:48] [INFO ] Invariant cache hit.
[2024-06-01 14:31:48] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 4 ms to minimize.
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:31:59] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 370 places in 257 ms of which 4 ms to minimize.
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:32:01] [INFO ] Deduced a trap composed of 318 places in 271 ms of which 4 ms to minimize.
[2024-06-01 14:32:01] [INFO ] Deduced a trap composed of 299 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:32:01] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 12 ms to minimize.
[2024-06-01 14:32:02] [INFO ] Deduced a trap composed of 335 places in 326 ms of which 5 ms to minimize.
[2024-06-01 14:32:02] [INFO ] Deduced a trap composed of 403 places in 348 ms of which 5 ms to minimize.
[2024-06-01 14:32:03] [INFO ] Deduced a trap composed of 314 places in 296 ms of which 8 ms to minimize.
[2024-06-01 14:32:03] [INFO ] Deduced a trap composed of 313 places in 264 ms of which 5 ms to minimize.
[2024-06-01 14:32:03] [INFO ] Deduced a trap composed of 336 places in 263 ms of which 4 ms to minimize.
[2024-06-01 14:32:04] [INFO ] Deduced a trap composed of 324 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:32:04] [INFO ] Deduced a trap composed of 318 places in 218 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:32:05] [INFO ] Deduced a trap composed of 321 places in 310 ms of which 4 ms to minimize.
[2024-06-01 14:32:06] [INFO ] Deduced a trap composed of 303 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:32:06] [INFO ] Deduced a trap composed of 410 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:32:07] [INFO ] Deduced a trap composed of 330 places in 241 ms of which 3 ms to minimize.
[2024-06-01 14:32:08] [INFO ] Deduced a trap composed of 324 places in 294 ms of which 3 ms to minimize.
[2024-06-01 14:32:08] [INFO ] Deduced a trap composed of 282 places in 285 ms of which 4 ms to minimize.
[2024-06-01 14:32:10] [INFO ] Deduced a trap composed of 295 places in 318 ms of which 4 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 325 places in 321 ms of which 4 ms to minimize.
[2024-06-01 14:32:17] [INFO ] Deduced a trap composed of 359 places in 292 ms of which 5 ms to minimize.
[2024-06-01 14:32:17] [INFO ] Deduced a trap composed of 353 places in 263 ms of which 3 ms to minimize.
[2024-06-01 14:32:19] [INFO ] Deduced a trap composed of 334 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1710 variables, and 77 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 31/77 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
[2024-06-01 14:32:37] [INFO ] Deduced a trap composed of 54 places in 353 ms of which 5 ms to minimize.
[2024-06-01 14:32:46] [INFO ] Deduced a trap composed of 292 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:32:48] [INFO ] Deduced a trap composed of 360 places in 260 ms of which 4 ms to minimize.
[2024-06-01 14:32:48] [INFO ] Deduced a trap composed of 358 places in 192 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1710 variables, and 81 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 35/35 constraints]
After SMT, in 61161ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 61172ms
Starting structural reductions in LTL mode, iteration 1 : 612/614 places, 1114/1114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110509 ms. Remains : 612/614 places, 1114/1114 transitions.
Support contains 356 out of 612 places after structural reductions.
[2024-06-01 14:32:50] [INFO ] Flatten gal took : 151 ms
[2024-06-01 14:32:50] [INFO ] Flatten gal took : 192 ms
[2024-06-01 14:32:51] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 333 out of 612 places (down from 356) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 2318 ms. (17 steps per ms) remains 45/73 properties
BEST_FIRST walk for 4002 steps (8 resets) in 106 ms. (37 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 80 ms. (49 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (8 resets) in 60 ms. (65 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (9 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (9 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 106 ms. (37 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 44/44 properties
[2024-06-01 14:32:52] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-06-01 14:32:52] [INFO ] Invariant cache hit.
[2024-06-01 14:32:52] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 110/322 variables, 13/13 constraints. Problems are: Problem set: 11 solved, 33 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 1/14 constraints. Problems are: Problem set: 12 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/14 constraints. Problems are: Problem set: 12 solved, 32 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 4 (OVERLAPS) 289/611 variables, 33/47 constraints. Problems are: Problem set: 38 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 0/47 constraints. Problems are: Problem set: 38 solved, 6 unsolved
Problem AtomicPropp67 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/612 variables, 1/48 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 0/48 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1098/1710 variables, 612/660 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1710 variables, 96/756 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1710 variables, 0/756 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1710 variables, 0/756 constraints. Problems are: Problem set: 39 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1710/1710 variables, and 756 constraints, problems are : Problem set: 39 solved, 5 unsolved in 2882 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 612/612 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 39 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/122 variables, 3/3 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/126 variables, 2/5 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/5 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 460/586 variables, 22/27 constraints. Problems are: Problem set: 39 solved, 5 unsolved
[2024-06-01 14:32:56] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 3 ms to minimize.
[2024-06-01 14:32:56] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:32:56] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:32:56] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:32:56] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:32:56] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:32:56] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:32:56] [INFO ] Deduced a trap composed of 66 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:32:57] [INFO ] Deduced a trap composed of 370 places in 265 ms of which 3 ms to minimize.
[2024-06-01 14:32:57] [INFO ] Deduced a trap composed of 377 places in 267 ms of which 4 ms to minimize.
[2024-06-01 14:32:57] [INFO ] Deduced a trap composed of 375 places in 278 ms of which 4 ms to minimize.
[2024-06-01 14:32:57] [INFO ] Deduced a trap composed of 312 places in 256 ms of which 4 ms to minimize.
[2024-06-01 14:32:58] [INFO ] Deduced a trap composed of 312 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:32:58] [INFO ] Deduced a trap composed of 293 places in 268 ms of which 3 ms to minimize.
[2024-06-01 14:32:58] [INFO ] Deduced a trap composed of 353 places in 250 ms of which 3 ms to minimize.
[2024-06-01 14:32:59] [INFO ] Deduced a trap composed of 352 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:32:59] [INFO ] Deduced a trap composed of 366 places in 273 ms of which 4 ms to minimize.
[2024-06-01 14:32:59] [INFO ] Deduced a trap composed of 374 places in 298 ms of which 5 ms to minimize.
[2024-06-01 14:32:59] [INFO ] Deduced a trap composed of 318 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 320 places in 223 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 20/47 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 0/47 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/594 variables, 8/55 constraints. Problems are: Problem set: 39 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 0/55 constraints. Problems are: Problem set: 39 solved, 5 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 10 (OVERLAPS) 16/610 variables, 12/67 constraints. Problems are: Problem set: 41 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/610 variables, 0/67 constraints. Problems are: Problem set: 41 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1710 variables, and 677 constraints, problems are : Problem set: 41 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 610/612 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/44 constraints, Known Traps: 20/20 constraints]
After SMT, in 7985ms problems are : Problem set: 41 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 612 transition count 1046
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 137 place count 544 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 543 transition count 1045
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 138 place count 543 transition count 980
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 268 place count 478 transition count 980
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 3 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 394 place count 415 transition count 917
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 409 place count 415 transition count 902
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 424 place count 400 transition count 902
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 425 place count 400 transition count 902
Applied a total of 425 rules in 255 ms. Remains 400 /612 variables (removed 212) and now considering 902/1114 (removed 212) transitions.
Running 900 sub problems to find dead transitions.
[2024-06-01 14:33:01] [INFO ] Flow matrix only has 886 transitions (discarded 16 similar events)
// Phase 1: matrix 886 rows 400 cols
[2024-06-01 14:33:01] [INFO ] Computed 48 invariants in 26 ms
[2024-06-01 14:33:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 900 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/398 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 900 unsolved
[2024-06-01 14:33:07] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-06-01 14:33:07] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:33:07] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 14:33:07] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:33:09] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:33:10] [INFO ] Deduced a trap composed of 222 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:33:11] [INFO ] Deduced a trap composed of 147 places in 239 ms of which 4 ms to minimize.
[2024-06-01 14:33:12] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 3 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 154 places in 190 ms of which 3 ms to minimize.
[2024-06-01 14:33:14] [INFO ] Deduced a trap composed of 176 places in 217 ms of which 2 ms to minimize.
[2024-06-01 14:33:15] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
[2024-06-01 14:33:15] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:33:15] [INFO ] Deduced a trap composed of 185 places in 203 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 900 unsolved
[2024-06-01 14:33:16] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:33:17] [INFO ] Deduced a trap composed of 137 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:33:21] [INFO ] Deduced a trap composed of 128 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:33:22] [INFO ] Deduced a trap composed of 212 places in 191 ms of which 2 ms to minimize.
SMT process timed out in 21545ms, After SMT, problems are : Problem set: 0 solved, 900 unsolved
Search for dead transitions found 0 dead transitions in 21554ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21811 ms. Remains : 400/612 places, 902/1114 transitions.
RANDOM walk for 40000 steps (15 resets) in 401 ms. (99 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (12 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (11 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 188792 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 3
Probabilistic random walk after 188792 steps, saw 121451 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) properties seen :0
[2024-06-01 14:33:26] [INFO ] Flow matrix only has 886 transitions (discarded 16 similar events)
[2024-06-01 14:33:26] [INFO ] Invariant cache hit.
[2024-06-01 14:33:26] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 314/350 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/366 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 32/398 variables, 21/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 886/1284 variables, 398/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1284 variables, 96/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1284 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1286 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1286 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1286 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1286 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1286/1286 variables, and 544 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1934 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 400/400 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 27/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 314/350 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/366 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 153 places in 230 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 178 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 204 places in 236 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 32/398 variables, 21/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 3 ms to minimize.
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 886/1284 variables, 398/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1284 variables, 96/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1284 variables, 3/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1284 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/1286 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1286 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:33:33] [INFO ] Deduced a trap composed of 149 places in 221 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1286 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:33:50] [INFO ] Deduced a trap composed of 247 places in 285 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1286/1286 variables, and 558 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45006 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 400/400 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 46959ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 902/902 transitions.
Applied a total of 0 rules in 22 ms. Remains 400 /400 variables (removed 0) and now considering 902/902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 400/400 places, 902/902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 902/902 transitions.
Applied a total of 0 rules in 17 ms. Remains 400 /400 variables (removed 0) and now considering 902/902 (removed 0) transitions.
[2024-06-01 14:34:13] [INFO ] Flow matrix only has 886 transitions (discarded 16 similar events)
[2024-06-01 14:34:13] [INFO ] Invariant cache hit.
[2024-06-01 14:34:13] [INFO ] Implicit Places using invariants in 349 ms returned [71, 117, 191, 199, 271, 314, 338, 346]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 355 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 392/400 places, 902/902 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 386 transition count 896
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 386 transition count 896
Applied a total of 12 rules in 34 ms. Remains 386 /392 variables (removed 6) and now considering 896/902 (removed 6) transitions.
[2024-06-01 14:34:13] [INFO ] Flow matrix only has 880 transitions (discarded 16 similar events)
// Phase 1: matrix 880 rows 386 cols
[2024-06-01 14:34:13] [INFO ] Computed 40 invariants in 28 ms
[2024-06-01 14:34:13] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-06-01 14:34:13] [INFO ] Flow matrix only has 880 transitions (discarded 16 similar events)
[2024-06-01 14:34:13] [INFO ] Invariant cache hit.
[2024-06-01 14:34:14] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:34:18] [INFO ] Implicit Places using invariants and state equation in 4631 ms returned []
Implicit Place search using SMT with State Equation took 5027 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 386/400 places, 896/902 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5435 ms. Remains : 386/400 places, 896/902 transitions.
RANDOM walk for 40000 steps (19 resets) in 510 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (11 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (11 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 193171 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 3
Probabilistic random walk after 193171 steps, saw 120790 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-06-01 14:34:21] [INFO ] Flow matrix only has 880 transitions (discarded 16 similar events)
[2024-06-01 14:34:21] [INFO ] Invariant cache hit.
[2024-06-01 14:34:21] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 251/258 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 45/303 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/383 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/384 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 880/1264 variables, 384/423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1264 variables, 96/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1264 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/1266 variables, 2/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1266 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1266 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1266 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1266/1266 variables, and 522 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1839 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 386/386 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 251/258 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 45/303 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/383 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:34:23] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
[2024-06-01 14:34:23] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/384 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 880/1264 variables, 384/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1264 variables, 96/526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1264 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1264 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1266 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1266 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 14:34:37] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 3 ms to minimize.
[2024-06-01 14:34:38] [INFO ] Deduced a trap composed of 175 places in 227 ms of which 2 ms to minimize.
[2024-06-01 14:34:38] [INFO ] Deduced a trap composed of 128 places in 255 ms of which 2 ms to minimize.
[2024-06-01 14:34:39] [INFO ] Deduced a trap composed of 154 places in 262 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1266 variables, 4/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1266 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1266 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1266/1266 variables, and 536 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38402 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 386/386 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 40255ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3678 ms.
Support contains 7 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 896/896 transitions.
Applied a total of 0 rules in 18 ms. Remains 386 /386 variables (removed 0) and now considering 896/896 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 386/386 places, 896/896 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 896/896 transitions.
Applied a total of 0 rules in 16 ms. Remains 386 /386 variables (removed 0) and now considering 896/896 (removed 0) transitions.
[2024-06-01 14:35:05] [INFO ] Flow matrix only has 880 transitions (discarded 16 similar events)
[2024-06-01 14:35:05] [INFO ] Invariant cache hit.
[2024-06-01 14:35:06] [INFO ] Implicit Places using invariants in 409 ms returned []
[2024-06-01 14:35:06] [INFO ] Flow matrix only has 880 transitions (discarded 16 similar events)
[2024-06-01 14:35:06] [INFO ] Invariant cache hit.
[2024-06-01 14:35:06] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-01 14:35:10] [INFO ] Implicit Places using invariants and state equation in 4066 ms returned []
Implicit Place search using SMT with State Equation took 4475 ms to find 0 implicit places.
[2024-06-01 14:35:10] [INFO ] Redundant transitions in 83 ms returned []
Running 894 sub problems to find dead transitions.
[2024-06-01 14:35:10] [INFO ] Flow matrix only has 880 transitions (discarded 16 similar events)
[2024-06-01 14:35:10] [INFO ] Invariant cache hit.
[2024-06-01 14:35:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 894 unsolved
[2024-06-01 14:35:16] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 3 ms to minimize.
[2024-06-01 14:35:16] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-06-01 14:35:16] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:35:16] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-06-01 14:35:16] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 142 places in 236 ms of which 3 ms to minimize.
[2024-06-01 14:35:19] [INFO ] Deduced a trap composed of 130 places in 231 ms of which 4 ms to minimize.
[2024-06-01 14:35:19] [INFO ] Deduced a trap composed of 222 places in 200 ms of which 5 ms to minimize.
[2024-06-01 14:35:22] [INFO ] Deduced a trap composed of 156 places in 246 ms of which 3 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 171 places in 256 ms of which 2 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 152 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 128 places in 212 ms of which 4 ms to minimize.
[2024-06-01 14:35:24] [INFO ] Deduced a trap composed of 135 places in 228 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 894 unsolved
[2024-06-01 14:35:26] [INFO ] Deduced a trap composed of 137 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:35:28] [INFO ] Deduced a trap composed of 152 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 152 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 147 places in 189 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1266 variables, and 63 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/386 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 894/894 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 894 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 894 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 25/63 constraints. Problems are: Problem set: 0 solved, 894 unsolved
[2024-06-01 14:35:53] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 894 unsolved
[2024-06-01 14:36:07] [INFO ] Deduced a trap composed of 161 places in 237 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 894 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/1266 variables, and 65 constraints, problems are : Problem set: 0 solved, 894 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 19/21 constraints, State Equation: 0/386 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/894 constraints, Known Traps: 27/27 constraints]
After SMT, in 61445ms problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 61455ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66046 ms. Remains : 386/386 places, 896/896 transitions.
Successfully simplified 41 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:36:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 14:36:11] [INFO ] Flatten gal took : 45 ms
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:36:11] [INFO ] Flatten gal took : 45 ms
[2024-06-01 14:36:11] [INFO ] Input system was already deterministic with 1114 transitions.
Support contains 69 out of 612 places (down from 80) after GAL structural reductions.
FORMULA PolyORBLF-PT-S02J04T08-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 1042
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 540 transition count 1042
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 144 place count 540 transition count 978
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 272 place count 476 transition count 978
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 400 place count 412 transition count 914
Applied a total of 400 rules in 58 ms. Remains 412 /612 variables (removed 200) and now considering 914/1114 (removed 200) transitions.
Running 912 sub problems to find dead transitions.
[2024-06-01 14:36:11] [INFO ] Flow matrix only has 898 transitions (discarded 16 similar events)
// Phase 1: matrix 898 rows 412 cols
[2024-06-01 14:36:12] [INFO ] Computed 48 invariants in 34 ms
[2024-06-01 14:36:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-06-01 14:36:18] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:36:18] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:36:18] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-06-01 14:36:18] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 71 places in 249 ms of which 3 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 0 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 2 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 234 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 2 ms to minimize.
[2024-06-01 14:36:21] [INFO ] Deduced a trap composed of 142 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:36:25] [INFO ] Deduced a trap composed of 233 places in 213 ms of which 2 ms to minimize.
[2024-06-01 14:36:25] [INFO ] Deduced a trap composed of 243 places in 158 ms of which 2 ms to minimize.
[2024-06-01 14:36:26] [INFO ] Deduced a trap composed of 241 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:36:26] [INFO ] Deduced a trap composed of 148 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:36:26] [INFO ] Deduced a trap composed of 193 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:36:27] [INFO ] Deduced a trap composed of 150 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:36:27] [INFO ] Deduced a trap composed of 129 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 912 unsolved
[2024-06-01 14:36:30] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/1310 variables, and 67 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 912/912 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 912 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 912 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 912 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/1310 variables, and 67 constraints, problems are : Problem set: 0 solved, 912 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/412 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/912 constraints, Known Traps: 21/21 constraints]
After SMT, in 41251ms problems are : Problem set: 0 solved, 912 unsolved
Search for dead transitions found 0 dead transitions in 41260ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41321 ms. Remains : 412/612 places, 914/1114 transitions.
[2024-06-01 14:36:53] [INFO ] Flatten gal took : 50 ms
[2024-06-01 14:36:53] [INFO ] Flatten gal took : 46 ms
[2024-06-01 14:36:53] [INFO ] Input system was already deterministic with 914 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Applied a total of 16 rules in 19 ms. Remains 604 /612 variables (removed 8) and now considering 1106/1114 (removed 8) transitions.
Running 1104 sub problems to find dead transitions.
[2024-06-01 14:36:53] [INFO ] Flow matrix only has 1090 transitions (discarded 16 similar events)
// Phase 1: matrix 1090 rows 604 cols
[2024-06-01 14:36:53] [INFO ] Computed 48 invariants in 40 ms
[2024-06-01 14:36:53] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-06-01 14:37:03] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 2 ms to minimize.
[2024-06-01 14:37:03] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:37:04] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:37:04] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:37:04] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:37:04] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:37:04] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:37:04] [INFO ] Deduced a trap composed of 64 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:37:04] [INFO ] Deduced a trap composed of 64 places in 284 ms of which 4 ms to minimize.
[2024-06-01 14:37:05] [INFO ] Deduced a trap composed of 370 places in 283 ms of which 5 ms to minimize.
[2024-06-01 14:37:05] [INFO ] Deduced a trap composed of 291 places in 304 ms of which 5 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 414 places in 299 ms of which 5 ms to minimize.
[2024-06-01 14:37:06] [INFO ] Deduced a trap composed of 47 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:37:07] [INFO ] Deduced a trap composed of 319 places in 327 ms of which 5 ms to minimize.
[2024-06-01 14:37:08] [INFO ] Deduced a trap composed of 269 places in 279 ms of which 4 ms to minimize.
[2024-06-01 14:37:09] [INFO ] Deduced a trap composed of 291 places in 317 ms of which 5 ms to minimize.
[2024-06-01 14:37:11] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 4 ms to minimize.
[2024-06-01 14:37:11] [INFO ] Deduced a trap composed of 54 places in 309 ms of which 5 ms to minimize.
[2024-06-01 14:37:12] [INFO ] Deduced a trap composed of 322 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:37:12] [INFO ] Deduced a trap composed of 299 places in 201 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1104 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 602/1694 variables, and 66 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1104/1104 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1104 unsolved
[2024-06-01 14:37:27] [INFO ] Deduced a trap composed of 295 places in 309 ms of which 4 ms to minimize.
[2024-06-01 14:37:28] [INFO ] Deduced a trap composed of 311 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:37:31] [INFO ] Deduced a trap composed of 295 places in 280 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 602/1694 variables, and 69 constraints, problems are : Problem set: 0 solved, 1104 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/604 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1104 constraints, Known Traps: 23/23 constraints]
After SMT, in 41377ms problems are : Problem set: 0 solved, 1104 unsolved
Search for dead transitions found 0 dead transitions in 41395ms
Finished structural reductions in LTL mode , in 1 iterations and 41418 ms. Remains : 604/612 places, 1106/1114 transitions.
[2024-06-01 14:37:34] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:37:34] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:37:35] [INFO ] Input system was already deterministic with 1106 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 612 transition count 1058
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 556 transition count 1050
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 548 transition count 1050
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 128 place count 548 transition count 978
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 272 place count 476 transition count 978
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 352 place count 436 transition count 938
Applied a total of 352 rules in 50 ms. Remains 436 /612 variables (removed 176) and now considering 938/1114 (removed 176) transitions.
Running 936 sub problems to find dead transitions.
[2024-06-01 14:37:35] [INFO ] Flow matrix only has 922 transitions (discarded 16 similar events)
// Phase 1: matrix 922 rows 436 cols
[2024-06-01 14:37:35] [INFO ] Computed 48 invariants in 30 ms
[2024-06-01 14:37:35] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 89 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:37:43] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:37:43] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:37:43] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 3 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 166 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 260 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 156 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 159 places in 219 ms of which 3 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 149 places in 231 ms of which 3 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:37:49] [INFO ] Deduced a trap composed of 270 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:37:52] [INFO ] Deduced a trap composed of 265 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 936 unsolved
(s431 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 (/ 20.0 3.0))
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 7.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 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.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 1.0)
(s172 0.0)
(s173 3.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 9.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 (/ 2.0 3.0))
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 (/ 2.0 3.0))
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 (/ 1.0 3.0))
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s350 0.0)
(s351 0.0)
(s352 (/ 1.0 3.0))
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 (/ 2.0 3.0))
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0timeout
)
(s432 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1358 variables, and 66 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 936/936 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 936 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 936 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 936 unsolved
[2024-06-01 14:38:03] [INFO ] Deduced a trap composed of 190 places in 262 ms of which 5 ms to minimize.
[2024-06-01 14:38:14] [INFO ] Deduced a trap composed of 152 places in 232 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/1358 variables, and 68 constraints, problems are : Problem set: 0 solved, 936 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/436 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/936 constraints, Known Traps: 22/22 constraints]
After SMT, in 41269ms problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 41278ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41330 ms. Remains : 436/612 places, 938/1114 transitions.
[2024-06-01 14:38:16] [INFO ] Flatten gal took : 59 ms
[2024-06-01 14:38:16] [INFO ] Flatten gal took : 46 ms
[2024-06-01 14:38:16] [INFO ] Input system was already deterministic with 938 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 605 transition count 1107
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 605 transition count 1107
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 598 transition count 1100
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 598 transition count 1100
Applied a total of 28 rules in 28 ms. Remains 598 /612 variables (removed 14) and now considering 1100/1114 (removed 14) transitions.
Running 1098 sub problems to find dead transitions.
[2024-06-01 14:38:16] [INFO ] Flow matrix only has 1084 transitions (discarded 16 similar events)
// Phase 1: matrix 1084 rows 598 cols
[2024-06-01 14:38:16] [INFO ] Computed 48 invariants in 47 ms
[2024-06-01 14:38:16] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/596 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:38:26] [INFO ] Deduced a trap composed of 63 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:38:26] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:38:27] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:38:27] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 1 ms to minimize.
[2024-06-01 14:38:27] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 2 ms to minimize.
[2024-06-01 14:38:27] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:38:27] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:38:27] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:38:27] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:38:28] [INFO ] Deduced a trap composed of 164 places in 287 ms of which 4 ms to minimize.
[2024-06-01 14:38:28] [INFO ] Deduced a trap composed of 408 places in 372 ms of which 4 ms to minimize.
[2024-06-01 14:38:30] [INFO ] Deduced a trap composed of 346 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:38:30] [INFO ] Deduced a trap composed of 203 places in 174 ms of which 3 ms to minimize.
[2024-06-01 14:38:31] [INFO ] Deduced a trap composed of 321 places in 360 ms of which 4 ms to minimize.
[2024-06-01 14:38:31] [INFO ] Deduced a trap composed of 323 places in 323 ms of which 4 ms to minimize.
[2024-06-01 14:38:31] [INFO ] Deduced a trap composed of 329 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:38:32] [INFO ] Deduced a trap composed of 441 places in 255 ms of which 4 ms to minimize.
[2024-06-01 14:38:32] [INFO ] Deduced a trap composed of 304 places in 253 ms of which 4 ms to minimize.
[2024-06-01 14:38:32] [INFO ] Deduced a trap composed of 300 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:38:33] [INFO ] Deduced a trap composed of 269 places in 298 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2024-06-01 14:38:36] [INFO ] Deduced a trap composed of 256 places in 281 ms of which 5 ms to minimize.
[2024-06-01 14:38:37] [INFO ] Deduced a trap composed of 285 places in 232 ms of which 3 ms to minimize.
[2024-06-01 14:38:37] [INFO ] Deduced a trap composed of 289 places in 225 ms of which 3 ms to minimize.
[2024-06-01 14:38:37] [INFO ] Deduced a trap composed of 296 places in 228 ms of which 3 ms to minimize.
[2024-06-01 14:38:37] [INFO ] Deduced a trap composed of 318 places in 295 ms of which 4 ms to minimize.
SMT process timed out in 21282ms, After SMT, problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 21292ms
Finished structural reductions in LTL mode , in 1 iterations and 21324 ms. Remains : 598/612 places, 1100/1114 transitions.
[2024-06-01 14:38:37] [INFO ] Flatten gal took : 36 ms
[2024-06-01 14:38:37] [INFO ] Flatten gal took : 34 ms
[2024-06-01 14:38:38] [INFO ] Input system was already deterministic with 1100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 21 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:38:38] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-06-01 14:38:38] [INFO ] Computed 48 invariants in 25 ms
[2024-06-01 14:38:38] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:38:47] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 3 ms to minimize.
[2024-06-01 14:38:48] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:38:48] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:38:48] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:38:48] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 0 ms to minimize.
[2024-06-01 14:38:48] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:38:48] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:38:48] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 2 ms to minimize.
[2024-06-01 14:38:48] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:38:49] [INFO ] Deduced a trap composed of 303 places in 271 ms of which 3 ms to minimize.
[2024-06-01 14:38:49] [INFO ] Deduced a trap composed of 168 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:38:50] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:38:50] [INFO ] Deduced a trap composed of 308 places in 237 ms of which 3 ms to minimize.
[2024-06-01 14:38:50] [INFO ] Deduced a trap composed of 303 places in 252 ms of which 3 ms to minimize.
[2024-06-01 14:38:51] [INFO ] Deduced a trap composed of 287 places in 247 ms of which 5 ms to minimize.
[2024-06-01 14:38:52] [INFO ] Deduced a trap composed of 283 places in 276 ms of which 3 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 392 places in 289 ms of which 5 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 71 places in 261 ms of which 4 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 305 places in 259 ms of which 4 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 294 places in 246 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 394 places in 331 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 67 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:39:17] [INFO ] Deduced a trap composed of 372 places in 276 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 594/1678 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41411ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41424ms
Finished structural reductions in LTL mode , in 1 iterations and 41449 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:39:19] [INFO ] Flatten gal took : 57 ms
[2024-06-01 14:39:19] [INFO ] Flatten gal took : 44 ms
[2024-06-01 14:39:19] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 612 transition count 1043
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 541 transition count 1042
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 540 transition count 1042
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 144 place count 540 transition count 980
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 268 place count 478 transition count 980
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 394 place count 415 transition count 917
Applied a total of 394 rules in 67 ms. Remains 415 /612 variables (removed 197) and now considering 917/1114 (removed 197) transitions.
Running 915 sub problems to find dead transitions.
[2024-06-01 14:39:19] [INFO ] Flow matrix only has 901 transitions (discarded 16 similar events)
// Phase 1: matrix 901 rows 415 cols
[2024-06-01 14:39:19] [INFO ] Computed 48 invariants in 18 ms
[2024-06-01 14:39:19] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 915 unsolved
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 41 places in 28 ms of which 1 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 0 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 80 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 3 ms to minimize.
[2024-06-01 14:39:26] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:39:27] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:39:27] [INFO ] Deduced a trap composed of 236 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:39:27] [INFO ] Deduced a trap composed of 63 places in 200 ms of which 3 ms to minimize.
[2024-06-01 14:39:28] [INFO ] Deduced a trap composed of 144 places in 223 ms of which 2 ms to minimize.
[2024-06-01 14:39:30] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:39:32] [INFO ] Deduced a trap composed of 154 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 143 places in 230 ms of which 3 ms to minimize.
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 135 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:39:34] [INFO ] Deduced a trap composed of 179 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:39:35] [INFO ] Deduced a trap composed of 250 places in 150 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 915 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/1316 variables, and 66 constraints, problems are : Problem set: 0 solved, 915 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/415 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 915/915 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 915 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 915 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 915 unsolved
[2024-06-01 14:39:51] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-06-01 14:39:56] [INFO ] Deduced a trap composed of 134 places in 242 ms of which 3 ms to minimize.
[2024-06-01 14:39:58] [INFO ] Deduced a trap composed of 163 places in 271 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 915 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/1316 variables, and 69 constraints, problems are : Problem set: 0 solved, 915 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/34 constraints, State Equation: 0/415 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/915 constraints, Known Traps: 23/23 constraints]
After SMT, in 41378ms problems are : Problem set: 0 solved, 915 unsolved
Search for dead transitions found 0 dead transitions in 41389ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41460 ms. Remains : 415/612 places, 917/1114 transitions.
[2024-06-01 14:40:01] [INFO ] Flatten gal took : 24 ms
[2024-06-01 14:40:01] [INFO ] Flatten gal took : 26 ms
[2024-06-01 14:40:01] [INFO ] Input system was already deterministic with 917 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 20 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:40:01] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-06-01 14:40:01] [INFO ] Computed 48 invariants in 19 ms
[2024-06-01 14:40:01] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:40:11] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 3 ms to minimize.
[2024-06-01 14:40:11] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-06-01 14:40:11] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:40:11] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:40:12] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:40:12] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:40:12] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:40:12] [INFO ] Deduced a trap composed of 64 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:40:12] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:40:12] [INFO ] Deduced a trap composed of 303 places in 343 ms of which 5 ms to minimize.
[2024-06-01 14:40:13] [INFO ] Deduced a trap composed of 168 places in 352 ms of which 4 ms to minimize.
[2024-06-01 14:40:14] [INFO ] Deduced a trap composed of 79 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:40:15] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 5 ms to minimize.
[2024-06-01 14:40:15] [INFO ] Deduced a trap composed of 303 places in 294 ms of which 5 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 287 places in 290 ms of which 4 ms to minimize.
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 283 places in 272 ms of which 4 ms to minimize.
[2024-06-01 14:40:19] [INFO ] Deduced a trap composed of 392 places in 246 ms of which 4 ms to minimize.
[2024-06-01 14:40:19] [INFO ] Deduced a trap composed of 71 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:40:19] [INFO ] Deduced a trap composed of 305 places in 234 ms of which 3 ms to minimize.
[2024-06-01 14:40:20] [INFO ] Deduced a trap composed of 294 places in 275 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:40:22] [INFO ] Deduced a trap composed of 394 places in 271 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 67 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:40:40] [INFO ] Deduced a trap composed of 372 places in 300 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 594/1678 variables, and 68 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1096 constraints, Known Traps: 22/22 constraints]
After SMT, in 41164ms problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41173ms
Finished structural reductions in LTL mode , in 1 iterations and 41198 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:40:42] [INFO ] Flatten gal took : 27 ms
[2024-06-01 14:40:42] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:40:42] [INFO ] Input system was already deterministic with 1098 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 612 transition count 1044
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 141 place count 542 transition count 1043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 541 transition count 1043
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 142 place count 541 transition count 979
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 270 place count 477 transition count 979
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 398 place count 413 transition count 915
Applied a total of 398 rules in 48 ms. Remains 413 /612 variables (removed 199) and now considering 915/1114 (removed 199) transitions.
Running 913 sub problems to find dead transitions.
[2024-06-01 14:40:42] [INFO ] Flow matrix only has 899 transitions (discarded 16 similar events)
// Phase 1: matrix 899 rows 413 cols
[2024-06-01 14:40:42] [INFO ] Computed 48 invariants in 12 ms
[2024-06-01 14:40:42] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 913 unsolved
[2024-06-01 14:40:48] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:40:48] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:40:49] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:40:49] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2024-06-01 14:40:49] [INFO ] Deduced a trap composed of 40 places in 264 ms of which 3 ms to minimize.
[2024-06-01 14:40:49] [INFO ] Deduced a trap composed of 76 places in 238 ms of which 3 ms to minimize.
[2024-06-01 14:40:49] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:40:49] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:40:49] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:40:50] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:40:50] [INFO ] Deduced a trap composed of 155 places in 253 ms of which 3 ms to minimize.
[2024-06-01 14:40:50] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:40:51] [INFO ] Deduced a trap composed of 143 places in 237 ms of which 2 ms to minimize.
[2024-06-01 14:40:52] [INFO ] Deduced a trap composed of 235 places in 224 ms of which 3 ms to minimize.
[2024-06-01 14:40:53] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:40:57] [INFO ] Deduced a trap composed of 149 places in 229 ms of which 3 ms to minimize.
[2024-06-01 14:40:58] [INFO ] Deduced a trap composed of 174 places in 216 ms of which 3 ms to minimize.
[2024-06-01 14:40:58] [INFO ] Deduced a trap composed of 154 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:40:58] [INFO ] Deduced a trap composed of 149 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:40:59] [INFO ] Deduced a trap composed of 150 places in 266 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 913 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/1312 variables, and 66 constraints, problems are : Problem set: 0 solved, 913 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/413 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 913/913 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 913 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/411 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 913 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 913 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/1312 variables, and 66 constraints, problems are : Problem set: 0 solved, 913 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/413 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/913 constraints, Known Traps: 20/20 constraints]
After SMT, in 41450ms problems are : Problem set: 0 solved, 913 unsolved
Search for dead transitions found 0 dead transitions in 41460ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41511 ms. Remains : 413/612 places, 915/1114 transitions.
[2024-06-01 14:41:24] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:41:24] [INFO ] Flatten gal took : 35 ms
[2024-06-01 14:41:24] [INFO ] Input system was already deterministic with 915 transitions.
Starting structural reductions in LTL mode, iteration 0 : 612/612 places, 1114/1114 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 604 transition count 1106
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 604 transition count 1106
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 596 transition count 1098
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 596 transition count 1098
Applied a total of 32 rules in 27 ms. Remains 596 /612 variables (removed 16) and now considering 1098/1114 (removed 16) transitions.
Running 1096 sub problems to find dead transitions.
[2024-06-01 14:41:24] [INFO ] Flow matrix only has 1082 transitions (discarded 16 similar events)
// Phase 1: matrix 1082 rows 596 cols
[2024-06-01 14:41:24] [INFO ] Computed 48 invariants in 29 ms
[2024-06-01 14:41:24] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:41:33] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 3 ms to minimize.
[2024-06-01 14:41:33] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:41:33] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 0 ms to minimize.
[2024-06-01 14:41:34] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 2 ms to minimize.
[2024-06-01 14:41:34] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:41:34] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:41:34] [INFO ] Deduced a trap composed of 63 places in 35 ms of which 0 ms to minimize.
[2024-06-01 14:41:34] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:41:34] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:41:35] [INFO ] Deduced a trap composed of 303 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:41:35] [INFO ] Deduced a trap composed of 168 places in 303 ms of which 5 ms to minimize.
[2024-06-01 14:41:36] [INFO ] Deduced a trap composed of 79 places in 271 ms of which 2 ms to minimize.
[2024-06-01 14:41:37] [INFO ] Deduced a trap composed of 308 places in 314 ms of which 4 ms to minimize.
[2024-06-01 14:41:37] [INFO ] Deduced a trap composed of 303 places in 335 ms of which 4 ms to minimize.
[2024-06-01 14:41:38] [INFO ] Deduced a trap composed of 287 places in 299 ms of which 5 ms to minimize.
[2024-06-01 14:41:38] [INFO ] Deduced a trap composed of 283 places in 287 ms of which 5 ms to minimize.
[2024-06-01 14:41:40] [INFO ] Deduced a trap composed of 392 places in 301 ms of which 4 ms to minimize.
[2024-06-01 14:41:40] [INFO ] Deduced a trap composed of 71 places in 266 ms of which 5 ms to minimize.
[2024-06-01 14:41:41] [INFO ] Deduced a trap composed of 305 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:41:42] [INFO ] Deduced a trap composed of 294 places in 325 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:41:44] [INFO ] Deduced a trap composed of 394 places in 309 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 594/1678 variables, and 67 constraints, problems are : Problem set: 0 solved, 1096 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/596 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1096/1096 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/594 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 1096 unsolved
[2024-06-01 14:42:03] [INFO ] Deduced a trap composed of 372 places in 294 ms of which 4 ms to minimize.
[2024-06-01 14:42:05] [INFO ] Deduced a trap composed of 376 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:42:05] [INFO ] Deduced a trap composed of 356 places in 239 ms of which 3 ms to minimize.
SMT process timed out in 41334ms, After SMT, problems are : Problem set: 0 solved, 1096 unsolved
Search for dead transitions found 0 dead transitions in 41344ms
Finished structural reductions in LTL mode , in 1 iterations and 41374 ms. Remains : 596/612 places, 1098/1114 transitions.
[2024-06-01 14:42:05] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:42:05] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:42:05] [INFO ] Input system was already deterministic with 1098 transitions.
[2024-06-01 14:42:05] [INFO ] Flatten gal took : 31 ms
[2024-06-01 14:42:05] [INFO ] Flatten gal took : 28 ms
[2024-06-01 14:42:05] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 14:42:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 612 places, 1114 transitions and 4818 arcs took 9 ms.
Total runtime 666765 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLCardinality-2024-12
Could not compute solution for formula : PolyORBLF-PT-S02J04T08-CTLCardinality-2024-13

BK_STOP 1717252926263

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S02J04T08-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1741/ctl_0_
ctl formula name PolyORBLF-PT-S02J04T08-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1741/ctl_1_
ctl formula name PolyORBLF-PT-S02J04T08-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1741/ctl_2_
ctl formula name PolyORBLF-PT-S02J04T08-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1741/ctl_3_
ctl formula name PolyORBLF-PT-S02J04T08-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1741/ctl_4_
ctl formula name PolyORBLF-PT-S02J04T08-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1741/ctl_5_
ctl formula name PolyORBLF-PT-S02J04T08-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1741/ctl_6_
ctl formula name PolyORBLF-PT-S02J04T08-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/1741/ctl_7_
ctl formula name PolyORBLF-PT-S02J04T08-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/1741/ctl_8_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="PolyORBLF-PT-S02J04T08"
export BK_EXAMINATION="CTLCardinality"
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 PolyORBLF-PT-S02J04T08, 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 r516-tajo-171654446600225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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