About the Execution of GreatSPN+red for PolyORBLF-COL-S06J04T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16024.388 | 3600000.00 | 13094440.00 | 208.40 | TFFTF?TFF?TTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445300169.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-COL-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445300169
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:31 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 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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-COL-S06J04T04-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716854278848
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 23:58:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 23:58:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:58:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 23:58:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:58:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 672 ms
[2024-05-27 23:58:00] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
[2024-05-27 23:58:00] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 23:58:00] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40005 steps (3885 resets) in 1394 ms. (28 steps per ms) remains 62/72 properties
BEST_FIRST walk for 4003 steps (12 resets) in 89 ms. (44 steps per ms) remains 49/62 properties
BEST_FIRST walk for 4001 steps (10 resets) in 120 ms. (33 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (14 resets) in 123 ms. (32 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (19 resets) in 60 ms. (65 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (17 resets) in 28 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (19 resets) in 36 ms. (108 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (14 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (25 resets) in 49 ms. (80 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4001 steps (23 resets) in 28 ms. (137 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (15 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (34 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (13 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (13 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (22 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (13 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (33 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (208 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (33 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (14 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (23 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (18 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (11 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (20 resets) in 45 ms. (87 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (19 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (27 resets) in 16 ms. (235 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (19 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (15 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (13 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (13 resets) in 40 ms. (97 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (15 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (23 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (14 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (12 resets) in 63 ms. (62 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (14 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (19 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (14 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (13 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (17 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (16 resets) in 22 ms. (173 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (34 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
[2024-05-27 23:58:02] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 23:58:02] [INFO ] Computed 26 invariants in 7 ms
[2024-05-27 23:58:02] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 2 (OVERLAPS) 24/71 variables, 11/12 constraints. Problems are: Problem set: 30 solved, 18 unsolved
Problem AtomicPropp70 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 2/14 constraints. Problems are: Problem set: 31 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 31 solved, 17 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 5 (OVERLAPS) 10/81 variables, 12/26 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 47 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 47 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/48 variables, 6/8 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/49 variables, 1/9 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-05-27 23:58:02] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-05-27 23:58:03] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 1/115 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-05-27 23:58:03] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/116 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 47 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 119 constraints, problems are : Problem set: 47 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 914ms problems are : Problem set: 47 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 29 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-05-27 23:58:03] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-05-27 23:58:03] [INFO ] Computed 25 invariants in 1 ms
[2024-05-27 23:58:03] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-27 23:58:03] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-27 23:58:03] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-27 23:58:03] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-27 23:58:03] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-27 23:58:03] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-27 23:58:03] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/91 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-27 23:58:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-27 23:58:04] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 101 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-27 23:58:04] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-27 23:58:04] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-27 23:58:04] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 148 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 11/11 constraints]
After SMT, in 2560ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2561ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2606 ms. Remains : 60/81 places, 45/65 transitions.
RANDOM walk for 40007 steps (4326 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (249 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Probably explored full state space saw : 111519 states, properties seen :0
Probabilistic random walk after 341852 steps, saw 111519 distinct states, run finished after 545 ms. (steps per millisecond=627 ) properties seen :0
Explored full state space saw : 111522 states, properties seen :0
Exhaustive walk after 341859 steps, saw 111522 distinct states, run finished after 408 ms. (steps per millisecond=837 ) properties seen :0
Successfully simplified 48 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 23:58:06] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-27 23:58:06] [INFO ] Flatten gal took : 26 ms
[2024-05-27 23:58:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 23:58:06] [INFO ] Flatten gal took : 7 ms
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-27 23:58:07] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 148 ms.
[2024-05-27 23:58:07] [INFO ] Unfolded 4 HLPN properties in 0 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 178 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Applied a total of 6 rules in 47 ms. Remains 448 /454 variables (removed 6) and now considering 1614/1614 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-27 23:58:07] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 448 cols
[2024-05-27 23:58:07] [INFO ] Computed 44 invariants in 62 ms
[2024-05-27 23:58:07] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-27 23:58:32] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-27 23:58:32] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2024-05-27 23:58:32] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2024-05-27 23:58:33] [INFO ] Deduced a trap composed of 224 places in 353 ms of which 3 ms to minimize.
[2024-05-27 23:58:33] [INFO ] Deduced a trap composed of 107 places in 305 ms of which 4 ms to minimize.
[2024-05-27 23:58:33] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 1 ms to minimize.
[2024-05-27 23:58:35] [INFO ] Deduced a trap composed of 231 places in 390 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2038 variables, and 45 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-27 23:58:44] [INFO ] Deduced a trap composed of 220 places in 311 ms of which 3 ms to minimize.
[2024-05-27 23:58:47] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 2 ms to minimize.
[2024-05-27 23:58:50] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2038 variables, and 48 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 10/10 constraints]
After SMT, in 55519ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 55540ms
[2024-05-27 23:59:02] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-27 23:59:02] [INFO ] Invariant cache hit.
[2024-05-27 23:59:02] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-27 23:59:02] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-27 23:59:02] [INFO ] Invariant cache hit.
[2024-05-27 23:59:03] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-27 23:59:08] [INFO ] Implicit Places using invariants and state equation in 5138 ms returned []
Implicit Place search using SMT with State Equation took 5433 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2024-05-27 23:59:08] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-27 23:59:08] [INFO ] Invariant cache hit.
[2024-05-27 23:59:08] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-27 23:59:35] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-05-27 23:59:36] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
[2024-05-27 23:59:36] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 0 ms to minimize.
[2024-05-27 23:59:36] [INFO ] Deduced a trap composed of 242 places in 278 ms of which 3 ms to minimize.
[2024-05-27 23:59:36] [INFO ] Deduced a trap composed of 233 places in 304 ms of which 2 ms to minimize.
[2024-05-27 23:59:37] [INFO ] Deduced a trap composed of 110 places in 284 ms of which 3 ms to minimize.
[2024-05-27 23:59:37] [INFO ] Deduced a trap composed of 114 places in 342 ms of which 3 ms to minimize.
[2024-05-27 23:59:38] [INFO ] Deduced a trap composed of 229 places in 327 ms of which 3 ms to minimize.
[2024-05-27 23:59:38] [INFO ] Deduced a trap composed of 247 places in 270 ms of which 3 ms to minimize.
[2024-05-27 23:59:38] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 2 ms to minimize.
[2024-05-27 23:59:39] [INFO ] Deduced a trap composed of 89 places in 252 ms of which 2 ms to minimize.
[2024-05-27 23:59:40] [INFO ] Deduced a trap composed of 48 places in 288 ms of which 2 ms to minimize.
[2024-05-27 23:59:40] [INFO ] Deduced a trap composed of 273 places in 393 ms of which 3 ms to minimize.
[2024-05-27 23:59:40] [INFO ] Deduced a trap composed of 271 places in 373 ms of which 3 ms to minimize.
[2024-05-27 23:59:41] [INFO ] Deduced a trap composed of 275 places in 370 ms of which 2 ms to minimize.
[2024-05-27 23:59:41] [INFO ] Deduced a trap composed of 232 places in 390 ms of which 3 ms to minimize.
[2024-05-27 23:59:42] [INFO ] Deduced a trap composed of 265 places in 365 ms of which 3 ms to minimize.
[2024-05-27 23:59:42] [INFO ] Deduced a trap composed of 258 places in 307 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2038 variables, and 56 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 00:00:01] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 2 ms to minimize.
[2024-05-28 00:00:03] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-05-28 00:00:18] [INFO ] Deduced a trap composed of 232 places in 333 ms of which 3 ms to minimize.
[2024-05-28 00:00:18] [INFO ] Deduced a trap composed of 200 places in 302 ms of which 3 ms to minimize.
[2024-05-28 00:00:19] [INFO ] Deduced a trap composed of 234 places in 285 ms of which 3 ms to minimize.
[2024-05-28 00:00:19] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 3 ms to minimize.
[2024-05-28 00:00:20] [INFO ] Deduced a trap composed of 215 places in 295 ms of which 3 ms to minimize.
[2024-05-28 00:00:20] [INFO ] Deduced a trap composed of 207 places in 308 ms of which 3 ms to minimize.
[2024-05-28 00:00:20] [INFO ] Deduced a trap composed of 238 places in 326 ms of which 7 ms to minimize.
[2024-05-28 00:00:21] [INFO ] Deduced a trap composed of 216 places in 335 ms of which 4 ms to minimize.
[2024-05-28 00:00:21] [INFO ] Deduced a trap composed of 34 places in 364 ms of which 3 ms to minimize.
[2024-05-28 00:00:22] [INFO ] Deduced a trap composed of 3 places in 354 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2038 variables, and 68 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 30/30 constraints]
After SMT, in 77197ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 77215ms
Starting structural reductions in LTL mode, iteration 1 : 448/454 places, 1614/1614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138251 ms. Remains : 448/454 places, 1614/1614 transitions.
Support contains 178 out of 448 places after structural reductions.
[2024-05-28 00:00:25] [INFO ] Flatten gal took : 215 ms
[2024-05-28 00:00:25] [INFO ] Flatten gal took : 148 ms
[2024-05-28 00:00:26] [INFO ] Input system was already deterministic with 1614 transitions.
RANDOM walk for 40000 steps (218 resets) in 670 ms. (59 steps per ms) remains 9/19 properties
BEST_FIRST walk for 40002 steps (87 resets) in 245 ms. (162 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (75 resets) in 315 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (79 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (77 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (69 resets) in 231 ms. (172 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (332 resets) in 247 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (67 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (108 resets) in 207 ms. (192 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (103 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
[2024-05-28 00:00:27] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-28 00:00:27] [INFO ] Invariant cache hit.
[2024-05-28 00:00:27] [INFO ] State equation strengthened by 112 read => feed constraints.
Problem AtomicPropp4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 80/176 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/186 variables, 5/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 6 (OVERLAPS) 248/434 variables, 23/34 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/34 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/441 variables, 4/38 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/38 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/446 variables, 5/43 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1590/2036 variables, 446/489 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2036 variables, 112/601 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2036 variables, 0/601 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2038 variables, 2/603 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2038 variables, 1/604 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2038 variables, 0/604 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2038 variables, 0/604 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2038/2038 variables, and 604 constraints, problems are : Problem set: 8 solved, 1 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 448/448 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 348/353 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/380 variables, 14/22 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/445 variables, 20/42 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-28 00:00:28] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2024-05-28 00:00:28] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 2/44 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/44 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/446 variables, 1/45 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/45 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1590/2036 variables, 446/491 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2036/2038 variables, and 603 constraints, problems are : Problem set: 8 solved, 1 unsolved in 1672 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 446/448 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 3009ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 72 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 168 place count 364 transition count 1530
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 256 place count 320 transition count 1486
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 264 place count 320 transition count 1478
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 272 place count 312 transition count 1478
Applied a total of 272 rules in 231 ms. Remains 312 /448 variables (removed 136) and now considering 1478/1614 (removed 136) transitions.
Running 1472 sub problems to find dead transitions.
[2024-05-28 00:00:30] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
// Phase 1: matrix 1454 rows 312 cols
[2024-05-28 00:00:30] [INFO ] Computed 44 invariants in 48 ms
[2024-05-28 00:00:30] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:00:58] [INFO ] Deduced a trap composed of 51 places in 1128 ms of which 1 ms to minimize.
[2024-05-28 00:00:58] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2024-05-28 00:00:59] [INFO ] Deduced a trap composed of 51 places in 478 ms of which 0 ms to minimize.
[2024-05-28 00:01:00] [INFO ] Deduced a trap composed of 121 places in 1150 ms of which 2 ms to minimize.
[2024-05-28 00:01:00] [INFO ] Deduced a trap composed of 18 places in 354 ms of which 2 ms to minimize.
[2024-05-28 00:01:01] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 2 ms to minimize.
[2024-05-28 00:01:01] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-28 00:01:03] [INFO ] Deduced a trap composed of 129 places in 322 ms of which 2 ms to minimize.
[2024-05-28 00:01:03] [INFO ] Deduced a trap composed of 117 places in 330 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 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 9.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.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 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 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 306/1766 variables, and 47 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/312 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 00:01:12] [INFO ] Deduced a trap composed of 130 places in 269 ms of which 2 ms to minimize.
[2024-05-28 00:01:12] [INFO ] Deduced a trap composed of 141 places in 278 ms of which 3 ms to minimize.
[2024-05-28 00:01:14] [INFO ] Deduced a trap composed of 94 places in 355 ms of which 2 ms to minimize.
[2024-05-28 00:01:20] [INFO ] Deduced a trap composed of 90 places in 257 ms of which 2 ms to minimize.
[2024-05-28 00:01:21] [INFO ] Deduced a trap composed of 94 places in 221 ms of which 2 ms to minimize.
[2024-05-28 00:01:21] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/1766 variables, and 53 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/312 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 15/15 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60315 ms. Remains : 312/448 places, 1478/1614 transitions.
RANDOM walk for 40000 steps (409 resets) in 338 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (227 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 217590 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 217590 steps, saw 138671 distinct states, run finished after 3006 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-28 00:01:33] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 00:01:33] [INFO ] Invariant cache hit.
[2024-05-28 00:01:33] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/216 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/308 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/310 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1454/1764 variables, 310/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1764 variables, 112/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1764 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1766 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1766 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1766 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1766 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1766/1766 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 312/312 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/216 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/308 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 00:01:34] [INFO ] Deduced a trap composed of 33 places in 219 ms of which 2 ms to minimize.
[2024-05-28 00:01:34] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 2 ms to minimize.
[2024-05-28 00:01:34] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 4 ms to minimize.
[2024-05-28 00:01:34] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/310 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1454/1764 variables, 310/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1764 variables, 112/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1764 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1764 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1766 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1766 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1766 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1766 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1766/1766 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1787 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 312/312 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2427ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 1478/1478 transitions.
Applied a total of 0 rules in 48 ms. Remains 312 /312 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 312/312 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 1478/1478 transitions.
Applied a total of 0 rules in 36 ms. Remains 312 /312 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-05-28 00:01:36] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 00:01:36] [INFO ] Invariant cache hit.
[2024-05-28 00:01:36] [INFO ] Implicit Places using invariants in 558 ms returned [266, 267, 268, 269]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 565 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 308/312 places, 1478/1478 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 304 transition count 1474
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 304 transition count 1474
Applied a total of 8 rules in 37 ms. Remains 304 /308 variables (removed 4) and now considering 1474/1478 (removed 4) transitions.
[2024-05-28 00:01:36] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
// Phase 1: matrix 1450 rows 304 cols
[2024-05-28 00:01:36] [INFO ] Computed 40 invariants in 21 ms
[2024-05-28 00:01:37] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-28 00:01:37] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 00:01:37] [INFO ] Invariant cache hit.
[2024-05-28 00:01:37] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 00:01:41] [INFO ] Implicit Places using invariants and state equation in 3426 ms returned []
Implicit Place search using SMT with State Equation took 4193 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 304/312 places, 1474/1478 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4845 ms. Remains : 304/312 places, 1474/1478 transitions.
RANDOM walk for 40000 steps (488 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (202 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 223321 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 1
Probabilistic random walk after 223321 steps, saw 143265 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-28 00:01:44] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 00:01:44] [INFO ] Invariant cache hit.
[2024-05-28 00:01:44] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 224/229 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/250 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/301 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1450/1752 variables, 302/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1752 variables, 112/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1752 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1754 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1754 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1754 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1754 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1754/1754 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 304/304 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 224/229 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/250 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/301 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 00:01:45] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 1 ms to minimize.
[2024-05-28 00:01:45] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2024-05-28 00:01:45] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/302 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1450/1752 variables, 302/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1752 variables, 112/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1752 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1752 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1754 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1754 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 00:01:46] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 2 ms to minimize.
[2024-05-28 00:01:46] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1754 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1754 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1754 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1754/1754 variables, and 462 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1790 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 304/304 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2520ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 5 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 1474/1474 transitions.
Applied a total of 0 rules in 24 ms. Remains 304 /304 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 304/304 places, 1474/1474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 1474/1474 transitions.
Applied a total of 0 rules in 24 ms. Remains 304 /304 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
[2024-05-28 00:01:46] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 00:01:46] [INFO ] Invariant cache hit.
[2024-05-28 00:01:47] [INFO ] Implicit Places using invariants in 853 ms returned []
[2024-05-28 00:01:47] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 00:01:47] [INFO ] Invariant cache hit.
[2024-05-28 00:01:48] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 00:01:50] [INFO ] Implicit Places using invariants and state equation in 3247 ms returned []
Implicit Place search using SMT with State Equation took 4101 ms to find 0 implicit places.
[2024-05-28 00:01:50] [INFO ] Redundant transitions in 60 ms returned []
Running 1468 sub problems to find dead transitions.
[2024-05-28 00:01:50] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 00:01:50] [INFO ] Invariant cache hit.
[2024-05-28 00:01:50] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 00:02:17] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-05-28 00:02:17] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
[2024-05-28 00:02:17] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-05-28 00:02:17] [INFO ] Deduced a trap composed of 120 places in 309 ms of which 2 ms to minimize.
[2024-05-28 00:02:18] [INFO ] Deduced a trap composed of 138 places in 309 ms of which 2 ms to minimize.
[2024-05-28 00:02:18] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-28 00:02:18] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 1 ms to minimize.
[2024-05-28 00:02:21] [INFO ] Deduced a trap composed of 124 places in 316 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 00:02:34] [INFO ] Deduced a trap composed of 22 places in 313 ms of which 2 ms to minimize.
[2024-05-28 00:02:37] [INFO ] Deduced a trap composed of 91 places in 255 ms of which 2 ms to minimize.
[2024-05-28 00:02:37] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 2 ms to minimize.
[2024-05-28 00:02:38] [INFO ] Deduced a trap composed of 118 places in 267 ms of which 2 ms to minimize.
[2024-05-28 00:02:39] [INFO ] Deduced a trap composed of 119 places in 255 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/1754 variables, and 47 constraints, problems are : Problem set: 0 solved, 1468 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/304 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1468/1468 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1468 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 00:02:49] [INFO ] Deduced a trap composed of 3 places in 284 ms of which 2 ms to minimize.
[2024-05-28 00:02:49] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-28 00:02:49] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1468 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 298/1754 variables, and 50 constraints, problems are : Problem set: 0 solved, 1468 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/304 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1468 constraints, Known Traps: 16/16 constraints]
After SMT, in 79363ms problems are : Problem set: 0 solved, 1468 unsolved
Search for dead transitions found 0 dead transitions in 79378ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83574 ms. Remains : 304/304 places, 1474/1474 transitions.
Successfully simplified 8 atomic propositions for a total of 4 simplifications.
[2024-05-28 00:03:10] [INFO ] Flatten gal took : 85 ms
[2024-05-28 00:03:10] [INFO ] Flatten gal took : 86 ms
[2024-05-28 00:03:10] [INFO ] Input system was already deterministic with 1614 transitions.
Support contains 48 out of 448 places (down from 82) after GAL structural reductions.
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 448/448 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 72 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 168 place count 364 transition count 1530
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 256 place count 320 transition count 1486
Applied a total of 256 rules in 102 ms. Remains 320 /448 variables (removed 128) and now considering 1486/1614 (removed 128) transitions.
Running 1480 sub problems to find dead transitions.
[2024-05-28 00:03:10] [INFO ] Flow matrix only has 1462 transitions (discarded 24 similar events)
// Phase 1: matrix 1462 rows 320 cols
[2024-05-28 00:03:10] [INFO ] Computed 44 invariants in 22 ms
[2024-05-28 00:03:10] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 00:03:34] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-28 00:03:34] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 0 ms to minimize.
[2024-05-28 00:03:34] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-28 00:03:36] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/1782 variables, and 42 constraints, problems are : Problem set: 0 solved, 1480 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/320 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1480/1480 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 00:03:49] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-05-28 00:03:49] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 2 ms to minimize.
[2024-05-28 00:03:49] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-28 00:04:01] [INFO ] Deduced a trap composed of 94 places in 255 ms of which 2 ms to minimize.
[2024-05-28 00:04:02] [INFO ] Deduced a trap composed of 145 places in 266 ms of which 2 ms to minimize.
[2024-05-28 00:04:03] [INFO ] Deduced a trap composed of 134 places in 341 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 00:04:04] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 2 ms to minimize.
[2024-05-28 00:04:05] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/1782 variables, and 50 constraints, problems are : Problem set: 0 solved, 1480 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/320 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1480 constraints, Known Traps: 12/12 constraints]
After SMT, in 55861ms problems are : Problem set: 0 solved, 1480 unsolved
Search for dead transitions found 0 dead transitions in 55876ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 55993 ms. Remains : 320/448 places, 1486/1614 transitions.
[2024-05-28 00:04:06] [INFO ] Flatten gal took : 123 ms
[2024-05-28 00:04:06] [INFO ] Flatten gal took : 131 ms
[2024-05-28 00:04:07] [INFO ] Input system was already deterministic with 1486 transitions.
RANDOM walk for 523 steps (10 resets) in 8 ms. (58 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 1614/1614 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 440 transition count 1606
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 440 transition count 1606
Applied a total of 16 rules in 37 ms. Remains 440 /448 variables (removed 8) and now considering 1606/1614 (removed 8) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 00:04:07] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 440 cols
[2024-05-28 00:04:07] [INFO ] Computed 44 invariants in 62 ms
[2024-05-28 00:04:07] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 00:04:34] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
[2024-05-28 00:04:34] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 2 ms to minimize.
[2024-05-28 00:04:34] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 1 ms to minimize.
[2024-05-28 00:04:34] [INFO ] Deduced a trap composed of 241 places in 306 ms of which 3 ms to minimize.
[2024-05-28 00:04:35] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 3 ms to minimize.
[2024-05-28 00:04:35] [INFO ] Deduced a trap composed of 121 places in 264 ms of which 3 ms to minimize.
[2024-05-28 00:04:35] [INFO ] Deduced a trap composed of 102 places in 300 ms of which 3 ms to minimize.
[2024-05-28 00:04:36] [INFO ] Deduced a trap composed of 214 places in 362 ms of which 3 ms to minimize.
[2024-05-28 00:04:37] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2024-05-28 00:04:38] [INFO ] Deduced a trap composed of 267 places in 422 ms of which 3 ms to minimize.
[2024-05-28 00:04:38] [INFO ] Deduced a trap composed of 247 places in 370 ms of which 2 ms to minimize.
[2024-05-28 00:04:38] [INFO ] Deduced a trap composed of 236 places in 355 ms of which 2 ms to minimize.
[2024-05-28 00:04:40] [INFO ] Deduced a trap composed of 47 places in 322 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/2022 variables, and 51 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 00:04:50] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 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 9)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 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 0)
(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 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(timeout
s170 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/2022 variables, and 52 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/16 constraints, Generalized P Invariants (flows): 25/28 constraints, State Equation: 0/440 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 14/14 constraints]
After SMT, in 55530ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 55549ms
Finished structural reductions in LTL mode , in 1 iterations and 55590 ms. Remains : 440/448 places, 1606/1614 transitions.
[2024-05-28 00:05:02] [INFO ] Flatten gal took : 95 ms
[2024-05-28 00:05:03] [INFO ] Flatten gal took : 91 ms
[2024-05-28 00:05:03] [INFO ] Input system was already deterministic with 1606 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 448/448 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 72 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 168 place count 364 transition count 1530
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 256 place count 320 transition count 1486
Applied a total of 256 rules in 97 ms. Remains 320 /448 variables (removed 128) and now considering 1486/1614 (removed 128) transitions.
Running 1480 sub problems to find dead transitions.
[2024-05-28 00:05:03] [INFO ] Flow matrix only has 1462 transitions (discarded 24 similar events)
// Phase 1: matrix 1462 rows 320 cols
[2024-05-28 00:05:03] [INFO ] Computed 44 invariants in 30 ms
[2024-05-28 00:05:03] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 00:05:26] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 1 ms to minimize.
[2024-05-28 00:05:27] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
[2024-05-28 00:05:27] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-28 00:05:28] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/1782 variables, and 42 constraints, problems are : Problem set: 0 solved, 1480 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/320 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1480/1480 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 00:05:42] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
[2024-05-28 00:05:42] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2024-05-28 00:05:42] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-28 00:05:55] [INFO ] Deduced a trap composed of 94 places in 222 ms of which 2 ms to minimize.
[2024-05-28 00:05:55] [INFO ] Deduced a trap composed of 145 places in 223 ms of which 2 ms to minimize.
[2024-05-28 00:05:56] [INFO ] Deduced a trap composed of 134 places in 340 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 00:05:58] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 1 ms to minimize.
[2024-05-28 00:05:59] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/1782 variables, and 50 constraints, problems are : Problem set: 0 solved, 1480 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/320 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1480 constraints, Known Traps: 12/12 constraints]
After SMT, in 55970ms problems are : Problem set: 0 solved, 1480 unsolved
Search for dead transitions found 0 dead transitions in 55988ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 56089 ms. Remains : 320/448 places, 1486/1614 transitions.
[2024-05-28 00:05:59] [INFO ] Flatten gal took : 79 ms
[2024-05-28 00:05:59] [INFO ] Flatten gal took : 84 ms
[2024-05-28 00:05:59] [INFO ] Input system was already deterministic with 1486 transitions.
[2024-05-28 00:05:59] [INFO ] Flatten gal took : 71 ms
[2024-05-28 00:05:59] [INFO ] Flatten gal took : 68 ms
[2024-05-28 00:05:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-28 00:05:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 448 places, 1614 transitions and 9862 arcs took 15 ms.
Total runtime 479745 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-COL-S06J04T04
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 448
TRANSITIONS: 1614
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.041s, Sys 0.008s]
SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1097
MODEL NAME: /home/mcc/execution/417/model
448 places, 1614 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
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-COL-S06J04T04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-COL-S06J04T04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445300169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;