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-171654446700258.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-S02J06T10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Apr 11 17:07 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 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.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 1.1M 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-S02J06T10-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717253322191

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:48:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:48:43] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2024-06-01 14:48:43] [INFO ] Transformed 844 places.
[2024-06-01 14:48:43] [INFO ] Transformed 1812 transitions.
[2024-06-01 14:48:43] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
[2024-06-01 14:48:43] [INFO ] Reduced 110 identical enabling conditions.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 577 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Applied a total of 0 rules in 52 ms. Remains 844 /844 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2024-06-01 14:48:44] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-06-01 14:48:44] [INFO ] Computed 58 invariants in 97 ms
[2024-06-01 14:48:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 35 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:49:04] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 99 places in 223 ms of which 3 ms to minimize.
[2024-06-01 14:49:05] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:49:06] [INFO ] Deduced a trap composed of 226 places in 471 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2476 variables, and 67 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20093 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2476 variables, and 67 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 13/13 constraints]
After SMT, in 42741ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 42792ms
[2024-06-01 14:49:26] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-06-01 14:49:26] [INFO ] Invariant cache hit.
[2024-06-01 14:49:27] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-06-01 14:49:27] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-06-01 14:49:27] [INFO ] Invariant cache hit.
[2024-06-01 14:49:29] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 14:49:40] [INFO ] Implicit Places using invariants and state equation in 13604 ms returned []
Implicit Place search using SMT with State Equation took 14082 ms to find 0 implicit places.
Running 1650 sub problems to find dead transitions.
[2024-06-01 14:49:41] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-06-01 14:49:41] [INFO ] Invariant cache hit.
[2024-06-01 14:49:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 3 ms to minimize.
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 0 ms to minimize.
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 0 ms to minimize.
[2024-06-01 14:49:59] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 2 ms to minimize.
[2024-06-01 14:50:00] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:50:00] [INFO ] Deduced a trap composed of 220 places in 328 ms of which 5 ms to minimize.
[2024-06-01 14:50:00] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:50:01] [INFO ] Deduced a trap composed of 430 places in 378 ms of which 5 ms to minimize.
[2024-06-01 14:50:02] [INFO ] Deduced a trap composed of 407 places in 361 ms of which 5 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 86 places in 338 ms of which 4 ms to minimize.
[2024-06-01 14:50:03] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:50:04] [INFO ] Deduced a trap composed of 436 places in 332 ms of which 4 ms to minimize.
[2024-06-01 14:50:04] [INFO ] Deduced a trap composed of 598 places in 358 ms of which 5 ms to minimize.
[2024-06-01 14:50:05] [INFO ] Deduced a trap composed of 606 places in 333 ms of which 4 ms to minimize.
[2024-06-01 14:50:05] [INFO ] Deduced a trap composed of 637 places in 347 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-06-01 14:50:10] [INFO ] Deduced a trap composed of 417 places in 390 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2476 variables, and 75 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 21/75 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-06-01 14:50:41] [INFO ] Deduced a trap composed of 448 places in 536 ms of which 12 ms to minimize.
[2024-06-01 14:50:41] [INFO ] Deduced a trap composed of 425 places in 457 ms of which 4 ms to minimize.
[2024-06-01 14:50:42] [INFO ] Deduced a trap composed of 377 places in 336 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2476 variables, and 78 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 24/24 constraints]
After SMT, in 62996ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 63020ms
Finished structural reductions in LTL mode , in 1 iterations and 119999 ms. Remains : 844/844 places, 1652/1652 transitions.
Support contains 577 out of 844 places after structural reductions.
[2024-06-01 14:50:44] [INFO ] Flatten gal took : 154 ms
[2024-06-01 14:50:44] [INFO ] Flatten gal took : 110 ms
[2024-06-01 14:50:44] [INFO ] Input system was already deterministic with 1652 transitions.
Support contains 574 out of 844 places (down from 577) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 68 to 66
RANDOM walk for 40000 steps (12 resets) in 2527 ms. (15 steps per ms) remains 16/66 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 68 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 16/16 properties
[2024-06-01 14:50:46] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-06-01 14:50:46] [INFO ] Invariant cache hit.
[2024-06-01 14:50:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 276/418 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 6 (OVERLAPS) 409/827 variables, 25/45 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/827 variables, 0/45 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 3/830 variables, 3/48 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 0/48 constraints. Problems are: Problem set: 5 solved, 11 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 10 (OVERLAPS) 14/844 variables, 10/58 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/844 variables, 0/58 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1632/2476 variables, 844/902 constraints. Problems are: Problem set: 10 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2476/2476 variables, and 1022 constraints, problems are : Problem set: 10 solved, 6 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 844/844 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 277/369 variables, 7/8 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 9/17 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/371 variables, 1/18 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/18 constraints. Problems are: Problem set: 10 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 442/813 variables, 23/41 constraints. Problems are: Problem set: 10 solved, 6 unsolved
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 99 places in 453 ms of which 5 ms to minimize.
[2024-06-01 14:50:52] [INFO ] Deduced a trap composed of 449 places in 436 ms of which 5 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 449 places in 572 ms of which 5 ms to minimize.
[2024-06-01 14:50:53] [INFO ] Deduced a trap composed of 433 places in 413 ms of which 5 ms to minimize.
[2024-06-01 14:50:54] [INFO ] Deduced a trap composed of 505 places in 438 ms of which 4 ms to minimize.
[2024-06-01 14:50:54] [INFO ] Deduced a trap composed of 434 places in 352 ms of which 4 ms to minimize.
[2024-06-01 14:50:54] [INFO ] Deduced a trap composed of 480 places in 350 ms of which 4 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 449 places in 372 ms of which 4 ms to minimize.
[2024-06-01 14:50:55] [INFO ] Deduced a trap composed of 441 places in 353 ms of which 4 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 469 places in 348 ms of which 4 ms to minimize.
[2024-06-01 14:50:56] [INFO ] Deduced a trap composed of 460 places in 370 ms of which 4 ms to minimize.
SMT process timed out in 10326ms, After SMT, problems are : Problem set: 10 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 842 transition count 1602
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 112 place count 792 transition count 1592
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 122 place count 782 transition count 1592
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 122 place count 782 transition count 1482
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 342 place count 672 transition count 1482
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 418 place count 634 transition count 1444
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 428 place count 634 transition count 1434
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 438 place count 624 transition count 1434
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 448 place count 624 transition count 1434
Applied a total of 448 rules in 247 ms. Remains 624 /844 variables (removed 220) and now considering 1434/1652 (removed 218) transitions.
Running 1432 sub problems to find dead transitions.
[2024-06-01 14:50:56] [INFO ] Flow matrix only has 1414 transitions (discarded 20 similar events)
// Phase 1: matrix 1414 rows 624 cols
[2024-06-01 14:50:56] [INFO ] Computed 56 invariants in 101 ms
[2024-06-01 14:50:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1432 unsolved
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:51:10] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 6 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 51 places in 266 ms of which 3 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 265 places in 275 ms of which 3 ms to minimize.
[2024-06-01 14:51:11] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:51:12] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:51:12] [INFO ] Deduced a trap composed of 227 places in 270 ms of which 3 ms to minimize.
[2024-06-01 14:51:13] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 3 ms to minimize.
[2024-06-01 14:51:13] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 3 ms to minimize.
[2024-06-01 14:51:13] [INFO ] Deduced a trap composed of 111 places in 251 ms of which 4 ms to minimize.
[2024-06-01 14:51:14] [INFO ] Deduced a trap composed of 244 places in 475 ms of which 3 ms to minimize.
[2024-06-01 14:51:15] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
[2024-06-01 14:51:15] [INFO ] Deduced a trap composed of 250 places in 298 ms of which 3 ms to minimize.
[2024-06-01 14:51:17] [INFO ] Deduced a trap composed of 57 places in 250 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1432 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/2038 variables, and 74 constraints, problems are : Problem set: 0 solved, 1432 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/624 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1432/1432 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/2038 variables, and 74 constraints, problems are : Problem set: 0 solved, 1432 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/624 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1432 constraints, Known Traps: 20/20 constraints]
After SMT, in 43369ms problems are : Problem set: 0 solved, 1432 unsolved
Search for dead transitions found 0 dead transitions in 43387ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43639 ms. Remains : 624/844 places, 1434/1652 transitions.
RANDOM walk for 40000 steps (13 resets) in 1239 ms. (32 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 477 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 529 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 315 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 773 ms. (51 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 312 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 305 ms. (130 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 53180 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :1 out of 6
Probabilistic random walk after 53180 steps, saw 33862 distinct states, run finished after 3010 ms. (steps per millisecond=17 ) properties seen :1
[2024-06-01 14:51:44] [INFO ] Flow matrix only has 1414 transitions (discarded 20 similar events)
[2024-06-01 14:51:44] [INFO ] Invariant cache hit.
[2024-06-01 14:51:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 88/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 453/583 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 9/592 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:51:45] [INFO ] Deduced a trap composed of 350 places in 369 ms of which 5 ms to minimize.
[2024-06-01 14:51:45] [INFO ] Deduced a trap composed of 369 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:51:45] [INFO ] Deduced a trap composed of 314 places in 249 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 30/622 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:51:46] [INFO ] Deduced a trap composed of 52 places in 413 ms of which 5 ms to minimize.
[2024-06-01 14:51:46] [INFO ] Deduced a trap composed of 52 places in 386 ms of which 5 ms to minimize.
[2024-06-01 14:51:46] [INFO ] Deduced a trap composed of 51 places in 368 ms of which 4 ms to minimize.
[2024-06-01 14:51:47] [INFO ] Deduced a trap composed of 51 places in 412 ms of which 5 ms to minimize.
[2024-06-01 14:51:47] [INFO ] Deduced a trap composed of 51 places in 387 ms of which 4 ms to minimize.
[2024-06-01 14:51:48] [INFO ] Deduced a trap composed of 52 places in 334 ms of which 4 ms to minimize.
[2024-06-01 14:51:48] [INFO ] Deduced a trap composed of 51 places in 372 ms of which 5 ms to minimize.
[2024-06-01 14:51:48] [INFO ] Deduced a trap composed of 249 places in 259 ms of which 3 ms to minimize.
[2024-06-01 14:51:49] [INFO ] Deduced a trap composed of 241 places in 259 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/622 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:51:49] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 2 ms to minimize.
[2024-06-01 14:51:49] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 1414/2036 variables, 622/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2036 variables, 120/811 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2036 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/2038 variables, 2/813 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2038 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2038 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2038 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2038/2038 variables, and 814 constraints, problems are : Problem set: 0 solved, 5 unsolved in 13842 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 624/624 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 88/130 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 453/583 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 9/592 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 14:51:58] [INFO ] Deduced a trap composed of 260 places in 382 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/592 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/592 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 30/622 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/622 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/622 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1414/2036 variables, 622/692 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2036 variables, 120/812 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2036 variables, 5/817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2036/2038 variables, and 817 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 622/624 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 15/15 constraints]
After SMT, in 58888ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1434/1434 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 585 transition count 1395
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 87 place count 585 transition count 1386
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 96 place count 576 transition count 1386
Applied a total of 96 rules in 92 ms. Remains 576 /624 variables (removed 48) and now considering 1386/1434 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 576/624 places, 1386/1434 transitions.
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S02J06T10-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:52:43] [INFO ] Flatten gal took : 67 ms
[2024-06-01 14:52:43] [INFO ] Flatten gal took : 69 ms
[2024-06-01 14:52:43] [INFO ] Input system was already deterministic with 1652 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Applied a total of 22 rules in 84 ms. Remains 832 /844 variables (removed 12) and now considering 1642/1652 (removed 10) transitions.
Running 1640 sub problems to find dead transitions.
[2024-06-01 14:52:43] [INFO ] Flow matrix only has 1622 transitions (discarded 20 similar events)
// Phase 1: matrix 1622 rows 832 cols
[2024-06-01 14:52:44] [INFO ] Computed 56 invariants in 137 ms
[2024-06-01 14:52:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/830 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/830 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-06-01 14:53:05] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:53:05] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:53:05] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 0 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:53:06] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:53:07] [INFO ] Deduced a trap composed of 161 places in 409 ms of which 5 ms to minimize.
SMT process timed out in 23638ms, After SMT, problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 23652ms
Finished structural reductions in LTL mode , in 1 iterations and 23740 ms. Remains : 832/844 places, 1642/1652 transitions.
[2024-06-01 14:53:07] [INFO ] Flatten gal took : 87 ms
[2024-06-01 14:53:07] [INFO ] Flatten gal took : 94 ms
[2024-06-01 14:53:07] [INFO ] Input system was already deterministic with 1642 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 94 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:53:08] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-06-01 14:53:08] [INFO ] Computed 56 invariants in 51 ms
[2024-06-01 14:53:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:53:27] [INFO ] Deduced a trap composed of 71 places in 206 ms of which 3 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 133 places in 220 ms of which 3 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:53:28] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:53:29] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-01 14:53:29] [INFO ] Deduced a trap composed of 203 places in 412 ms of which 5 ms to minimize.
[2024-06-01 14:53:30] [INFO ] Deduced a trap composed of 23 places in 266 ms of which 3 ms to minimize.
[2024-06-01 14:53:30] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/2434 variables, and 68 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:53:49] [INFO ] Deduced a trap composed of 397 places in 524 ms of which 6 ms to minimize.
[2024-06-01 14:53:50] [INFO ] Deduced a trap composed of 406 places in 501 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2434 variables, and 70 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 16/16 constraints]
After SMT, in 43449ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43472ms
Finished structural reductions in LTL mode , in 1 iterations and 43572 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-06-01 14:53:51] [INFO ] Flatten gal took : 95 ms
[2024-06-01 14:53:51] [INFO ] Flatten gal took : 73 ms
[2024-06-01 14:53:51] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Applied a total of 0 rules in 26 ms. Remains 844 /844 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2024-06-01 14:53:51] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-06-01 14:53:51] [INFO ] Computed 58 invariants in 27 ms
[2024-06-01 14:53:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-06-01 14:54:12] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 4 ms to minimize.
[2024-06-01 14:54:12] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 0 ms to minimize.
[2024-06-01 14:54:12] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:54:12] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:54:12] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:54:12] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:54:13] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:54:13] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:54:13] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 2 ms to minimize.
[2024-06-01 14:54:13] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:54:13] [INFO ] Deduced a trap composed of 99 places in 280 ms of which 4 ms to minimize.
[2024-06-01 14:54:13] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:54:14] [INFO ] Deduced a trap composed of 226 places in 391 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2476 variables, and 67 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2476 variables, and 67 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/45 constraints, State Equation: 0/844 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 13/13 constraints]
After SMT, in 43016ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 43035ms
Finished structural reductions in LTL mode , in 1 iterations and 43065 ms. Remains : 844/844 places, 1652/1652 transitions.
[2024-06-01 14:54:34] [INFO ] Flatten gal took : 48 ms
[2024-06-01 14:54:35] [INFO ] Flatten gal took : 46 ms
[2024-06-01 14:54:35] [INFO ] Input system was already deterministic with 1652 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 29 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:54:35] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-06-01 14:54:35] [INFO ] Computed 56 invariants in 21 ms
[2024-06-01 14:54:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:54:52] [INFO ] Deduced a trap composed of 72 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:54:52] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:54:52] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 133 places in 294 ms of which 3 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:54:53] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:54:54] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:54:54] [INFO ] Deduced a trap composed of 203 places in 454 ms of which 6 ms to minimize.
[2024-06-01 14:54:55] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:54:55] [INFO ] Deduced a trap composed of 3 places in 472 ms of which 6 ms to minimize.
[2024-06-01 14:54:57] [INFO ] Deduced a trap composed of 118 places in 266 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/2434 variables, and 69 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:55:13] [INFO ] Deduced a trap composed of 406 places in 480 ms of which 5 ms to minimize.
[2024-06-01 14:55:13] [INFO ] Deduced a trap composed of 57 places in 296 ms of which 4 ms to minimize.
[2024-06-01 14:55:14] [INFO ] Deduced a trap composed of 422 places in 494 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2434 variables, and 72 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 18/18 constraints]
After SMT, in 42603ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42617ms
Finished structural reductions in LTL mode , in 1 iterations and 42649 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-06-01 14:55:17] [INFO ] Flatten gal took : 63 ms
[2024-06-01 14:55:17] [INFO ] Flatten gal took : 54 ms
[2024-06-01 14:55:18] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Applied a total of 2 rules in 13 ms. Remains 842 /844 variables (removed 2) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2024-06-01 14:55:18] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 842 cols
[2024-06-01 14:55:18] [INFO ] Computed 56 invariants in 58 ms
[2024-06-01 14:55:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:55:36] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 3 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 1 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 2 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 0 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:55:37] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 97 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:55:38] [INFO ] Deduced a trap composed of 232 places in 357 ms of which 5 ms to minimize.
[2024-06-01 14:55:39] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 407 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 435 places in 330 ms of which 4 ms to minimize.
[2024-06-01 14:55:40] [INFO ] Deduced a trap composed of 447 places in 323 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2474 variables, and 72 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2474 variables, and 72 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 18/18 constraints]
After SMT, in 43353ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 43374ms
Finished structural reductions in LTL mode , in 1 iterations and 43392 ms. Remains : 842/844 places, 1652/1652 transitions.
[2024-06-01 14:56:01] [INFO ] Flatten gal took : 64 ms
[2024-06-01 14:56:01] [INFO ] Flatten gal took : 62 ms
[2024-06-01 14:56:01] [INFO ] Input system was already deterministic with 1652 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 43 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:56:01] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-06-01 14:56:01] [INFO ] Computed 56 invariants in 26 ms
[2024-06-01 14:56:01] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:56:21] [INFO ] Deduced a trap composed of 72 places in 259 ms of which 4 ms to minimize.
[2024-06-01 14:56:21] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 4 ms to minimize.
[2024-06-01 14:56:21] [INFO ] Deduced a trap composed of 72 places in 259 ms of which 6 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 133 places in 260 ms of which 5 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 2 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:56:22] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:56:23] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:56:23] [INFO ] Deduced a trap composed of 203 places in 435 ms of which 6 ms to minimize.
[2024-06-01 14:56:24] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.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 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 6.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 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.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 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/2434 variables, and 67 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:56:43] [INFO ] Deduced a trap composed of 558 places in 466 ms of which 4 ms to minimize.
[2024-06-01 14:56:43] [INFO ] Deduced a trap composed of 57 places in 289 ms of which 4 ms to minimize.
[2024-06-01 14:56:44] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 10)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 10)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 5)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2434 variables, and 70 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 16/16 constraints]
After SMT, in 42837ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42855ms
Finished structural reductions in LTL mode , in 1 iterations and 42902 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-06-01 14:56:44] [INFO ] Flatten gal took : 39 ms
[2024-06-01 14:56:44] [INFO ] Flatten gal took : 42 ms
[2024-06-01 14:56:44] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 842 transition count 1602
Reduce places removed 50 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 60 rules applied. Total rules applied 110 place count 792 transition count 1592
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 120 place count 782 transition count 1592
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 120 place count 782 transition count 1492
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 320 place count 682 transition count 1492
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 330 place count 672 transition count 1482
Iterating global reduction 3 with 10 rules applied. Total rules applied 340 place count 672 transition count 1482
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 440 place count 622 transition count 1432
Applied a total of 440 rules in 106 ms. Remains 622 /844 variables (removed 222) and now considering 1432/1652 (removed 220) transitions.
Running 1430 sub problems to find dead transitions.
[2024-06-01 14:56:44] [INFO ] Flow matrix only has 1412 transitions (discarded 20 similar events)
// Phase 1: matrix 1412 rows 622 cols
[2024-06-01 14:56:44] [INFO ] Computed 56 invariants in 27 ms
[2024-06-01 14:56:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
[2024-06-01 14:56:59] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:56:59] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 2 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 1 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 0 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:57:00] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 240 places in 254 ms of which 3 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:57:01] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:57:02] [INFO ] Deduced a trap composed of 123 places in 235 ms of which 3 ms to minimize.
[2024-06-01 14:57:03] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 620/2034 variables, and 69 constraints, problems are : Problem set: 0 solved, 1430 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1430/1430 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/620 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/620 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 620/2034 variables, and 69 constraints, problems are : Problem set: 0 solved, 1430 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/622 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1430 constraints, Known Traps: 15/15 constraints]
After SMT, in 42752ms problems are : Problem set: 0 solved, 1430 unsolved
Search for dead transitions found 0 dead transitions in 42765ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42875 ms. Remains : 622/844 places, 1432/1652 transitions.
[2024-06-01 14:57:27] [INFO ] Flatten gal took : 37 ms
[2024-06-01 14:57:27] [INFO ] Flatten gal took : 39 ms
[2024-06-01 14:57:27] [INFO ] Input system was already deterministic with 1432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 34 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:57:27] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-06-01 14:57:27] [INFO ] Computed 56 invariants in 42 ms
[2024-06-01 14:57:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:57:47] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 3 ms to minimize.
[2024-06-01 14:57:47] [INFO ] Deduced a trap composed of 71 places in 233 ms of which 3 ms to minimize.
[2024-06-01 14:57:47] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 133 places in 321 ms of which 3 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 71 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 73 places in 191 ms of which 1 ms to minimize.
[2024-06-01 14:57:48] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:57:49] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:57:49] [INFO ] Deduced a trap composed of 203 places in 510 ms of which 6 ms to minimize.
[2024-06-01 14:57:50] [INFO ] Deduced a trap composed of 23 places in 298 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 Real declared 820/2434 variables, and 67 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:58:07] [INFO ] Deduced a trap composed of 558 places in 486 ms of which 6 ms to minimize.
[2024-06-01 14:58:08] [INFO ] Deduced a trap composed of 57 places in 304 ms of which 4 ms to minimize.
[2024-06-01 14:58:09] [INFO ] Deduced a trap composed of 3 places in 511 ms of which 6 ms to minimize.
[2024-06-01 14:58:11] [INFO ] Deduced a trap composed of 406 places in 514 ms of which 6 ms to minimize.
SMT process timed out in 43168ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43183ms
Finished structural reductions in LTL mode , in 1 iterations and 43220 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-06-01 14:58:11] [INFO ] Flatten gal took : 55 ms
[2024-06-01 14:58:11] [INFO ] Flatten gal took : 57 ms
[2024-06-01 14:58:11] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 46 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:58:11] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:58:11] [INFO ] Invariant cache hit.
[2024-06-01 14:58:11] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:58:28] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 3 ms to minimize.
[2024-06-01 14:58:28] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 4 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 1 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:58:29] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 203 places in 309 ms of which 6 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2024-06-01 14:58:30] [INFO ] Deduced a trap composed of 3 places in 323 ms of which 4 ms to minimize.
[2024-06-01 14:58:31] [INFO ] Deduced a trap composed of 406 places in 297 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/2434 variables, and 68 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2434 variables, and 68 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20069 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 14/14 constraints]
After SMT, in 42679ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42696ms
Finished structural reductions in LTL mode , in 1 iterations and 42746 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-06-01 14:58:54] [INFO ] Flatten gal took : 64 ms
[2024-06-01 14:58:54] [INFO ] Flatten gal took : 57 ms
[2024-06-01 14:58:54] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 66 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:58:54] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:58:54] [INFO ] Invariant cache hit.
[2024-06-01 14:58:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 73 places in 37 ms of which 0 ms to minimize.
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-06-01 14:59:12] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 0 ms to minimize.
[2024-06-01 14:59:13] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:59:13] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:59:13] [INFO ] Deduced a trap composed of 203 places in 331 ms of which 4 ms to minimize.
[2024-06-01 14:59:13] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:59:14] [INFO ] Deduced a trap composed of 3 places in 377 ms of which 5 ms to minimize.
[2024-06-01 14:59:15] [INFO ] Deduced a trap composed of 406 places in 508 ms of which 6 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 820/2434 variables, and 68 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2434 variables, and 68 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 14/14 constraints]
After SMT, in 42709ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42729ms
Finished structural reductions in LTL mode , in 1 iterations and 42801 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-06-01 14:59:37] [INFO ] Flatten gal took : 67 ms
[2024-06-01 14:59:37] [INFO ] Flatten gal took : 58 ms
[2024-06-01 14:59:37] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 44 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 14:59:37] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 14:59:37] [INFO ] Invariant cache hit.
[2024-06-01 14:59:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 0 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 0 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:59:57] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 203 places in 462 ms of which 8 ms to minimize.
[2024-06-01 14:59:58] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 1 ms to minimize.
[2024-06-01 14:59:59] [INFO ] Deduced a trap composed of 3 places in 472 ms of which 6 ms to minimize.
[2024-06-01 15:00:00] [INFO ] Deduced a trap composed of 406 places in 426 ms of which 7 ms to minimize.
SMT process timed out in 22780ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 22798ms
Finished structural reductions in LTL mode , in 1 iterations and 22846 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-06-01 15:00:00] [INFO ] Flatten gal took : 38 ms
[2024-06-01 15:00:00] [INFO ] Flatten gal took : 59 ms
[2024-06-01 15:00:00] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 42 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:00:00] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-06-01 15:00:00] [INFO ] Invariant cache hit.
[2024-06-01 15:00:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 2 ms to minimize.
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 3 ms to minimize.
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:00:19] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:00:20] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:00:20] [INFO ] Deduced a trap composed of 203 places in 300 ms of which 4 ms to minimize.
[2024-06-01 15:00:20] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:00:21] [INFO ] Deduced a trap composed of 3 places in 495 ms of which 6 ms to minimize.
[2024-06-01 15:00:22] [INFO ] Deduced a trap composed of 406 places in 491 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/2434 variables, and 68 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2434 variables, and 68 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 14/14 constraints]
After SMT, in 42614ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42632ms
Finished structural reductions in LTL mode , in 1 iterations and 42679 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-06-01 15:00:43] [INFO ] Flatten gal took : 43 ms
[2024-06-01 15:00:43] [INFO ] Flatten gal took : 46 ms
[2024-06-01 15:00:43] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 652 transition count 1462
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 536 place count 574 transition count 1384
Applied a total of 536 rules in 69 ms. Remains 574 /844 variables (removed 270) and now considering 1384/1652 (removed 268) transitions.
Running 1382 sub problems to find dead transitions.
[2024-06-01 15:00:43] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
// Phase 1: matrix 1364 rows 574 cols
[2024-06-01 15:00:43] [INFO ] Computed 56 invariants in 18 ms
[2024-06-01 15:00:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
[2024-06-01 15:00:55] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:00:55] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:00:55] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:00:55] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 1 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 3 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 46 places in 340 ms of which 4 ms to minimize.
[2024-06-01 15:00:56] [INFO ] Deduced a trap composed of 291 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:00:57] [INFO ] Deduced a trap composed of 197 places in 351 ms of which 4 ms to minimize.
[2024-06-01 15:00:57] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-06-01 15:00:57] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:00:57] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-06-01 15:00:58] [INFO ] Deduced a trap composed of 93 places in 363 ms of which 4 ms to minimize.
[2024-06-01 15:00:59] [INFO ] Deduced a trap composed of 209 places in 276 ms of which 3 ms to minimize.
[2024-06-01 15:01:01] [INFO ] Deduced a trap composed of 48 places in 306 ms of which 3 ms to minimize.
[2024-06-01 15:01:01] [INFO ] Deduced a trap composed of 109 places in 225 ms of which 3 ms to minimize.
[2024-06-01 15:01:04] [INFO ] Deduced a trap composed of 365 places in 215 ms of which 3 ms to minimize.
[2024-06-01 15:01:05] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1938 variables, and 73 constraints, problems are : Problem set: 0 solved, 1382 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/574 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1382/1382 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/1938 variables, and 73 constraints, problems are : Problem set: 0 solved, 1382 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 40/42 constraints, State Equation: 0/574 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1382 constraints, Known Traps: 19/19 constraints]
After SMT, in 42685ms problems are : Problem set: 0 solved, 1382 unsolved
Search for dead transitions found 0 dead transitions in 42696ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42768 ms. Remains : 574/844 places, 1384/1652 transitions.
[2024-06-01 15:01:26] [INFO ] Flatten gal took : 37 ms
[2024-06-01 15:01:26] [INFO ] Flatten gal took : 39 ms
[2024-06-01 15:01:26] [INFO ] Input system was already deterministic with 1384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 832 transition count 1642
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 822 transition count 1632
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 822 transition count 1632
Applied a total of 42 rules in 34 ms. Remains 822 /844 variables (removed 22) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-06-01 15:01:26] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-06-01 15:01:26] [INFO ] Computed 56 invariants in 50 ms
[2024-06-01 15:01:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 71 places in 223 ms of which 3 ms to minimize.
[2024-06-01 15:01:44] [INFO ] Deduced a trap composed of 72 places in 214 ms of which 3 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 133 places in 216 ms of which 4 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 71 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2024-06-01 15:01:45] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:01:46] [INFO ] Deduced a trap composed of 203 places in 350 ms of which 5 ms to minimize.
[2024-06-01 15:01:46] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-06-01 15:01:47] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 5 ms to minimize.
[2024-06-01 15:01:48] [INFO ] Deduced a trap composed of 118 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/2434 variables, and 69 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 406 places in 386 ms of which 5 ms to minimize.
[2024-06-01 15:02:06] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 4 ms to minimize.
[2024-06-01 15:02:07] [INFO ] Deduced a trap composed of 422 places in 363 ms of which 3 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2434 variables, and 72 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 18/18 constraints]
After SMT, in 42813ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 42827ms
Finished structural reductions in LTL mode , in 1 iterations and 42864 ms. Remains : 822/844 places, 1632/1652 transitions.
[2024-06-01 15:02:09] [INFO ] Flatten gal took : 37 ms
[2024-06-01 15:02:09] [INFO ] Flatten gal took : 40 ms
[2024-06-01 15:02:09] [INFO ] Input system was already deterministic with 1632 transitions.
[2024-06-01 15:02:09] [INFO ] Flatten gal took : 47 ms
[2024-06-01 15:02:09] [INFO ] Flatten gal took : 48 ms
[2024-06-01 15:02:09] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 18 ms.
[2024-06-01 15:02:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 844 places, 1652 transitions and 7182 arcs took 8 ms.
Total runtime 805940 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-S02J06T10-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-09
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-PT-S02J06T10-CTLFireability-2024-15

BK_STOP 1717254129923

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1590/ctl_0_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1590/ctl_1_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1590/ctl_2_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1590/ctl_3_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1590/ctl_4_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1590/ctl_5_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1590/ctl_6_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1590/ctl_7_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1590/ctl_8_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1590/ctl_9_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1590/ctl_10_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1590/ctl_11_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1590/ctl_12_
ctl formula name PolyORBLF-PT-S02J06T10-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1590/ctl_13_
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-S02J06T10"
export BK_EXAMINATION="CTLFireability"
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-S02J06T10, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446700258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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