Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r232-tall-171649621800159.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is LamportFastMutEx-COL-8, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r232-tall-171649621800159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.1K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 07:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 44K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716539008082

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=LamportFastMutEx-COL-8
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 08:23:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-24 08:23:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:23:29] [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-24 08:23:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 08:23:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 625 ms
[2024-05-24 08:23:30] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 18 ms.
[2024-05-24 08:23:30] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 08:23:30] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-24 08:23:30] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 28 ms.
[2024-05-24 08:23:30] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-24 08:23:30] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 9 ms.
[2024-05-24 08:23:30] [INFO ] Unfolded 17 HLPN properties in 1 ms.
[2024-05-24 08:23:30] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 0 ms.
[2024-05-24 08:23:30] [INFO ] Skeletonized 17 HLPN properties in 2 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 08:23:30] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 17 ms.
[2024-05-24 08:23:30] [INFO ] Unfolded 17 HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.25402KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 266/266 places, 584/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Applied a total of 0 rules in 41 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 51 ms. Remains : 266/266 places, 584/584 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 266/266 places, 584/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Applied a total of 0 rules in 30 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2024-05-24 08:23:30] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 08:23:30] [INFO ] Computed 82 invariants in 22 ms
[2024-05-24 08:23:30] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-24 08:23:30] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 08:23:30] [INFO ] Invariant cache hit.
[2024-05-24 08:23:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 08:23:30] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-24 08:23:30] [INFO ] Redundant transitions in 37 ms returned []
Running 576 sub problems to find dead transitions.
[2024-05-24 08:23:30] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2024-05-24 08:23:30] [INFO ] Invariant cache hit.
[2024-05-24 08:23:31] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-05-24 08:23:34] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 26 ms to minimize.
[2024-05-24 08:23:34] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-24 08:23:34] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-24 08:23:34] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
[2024-05-24 08:23:34] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-24 08:23:35] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-24 08:23:35] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-24 08:23:35] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-24 08:23:35] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:23:35] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-24 08:23:35] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-24 08:23:35] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-24 08:23:35] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-05-24 08:23:35] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 20/102 constraints. Problems are: Problem set: 5 solved, 571 unsolved
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:23:36] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 3 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-24 08:23:37] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 2 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 20/122 constraints. Problems are: Problem set: 12 solved, 564 unsolved
[2024-05-24 08:23:38] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-24 08:23:39] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 4 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-24 08:23:40] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 20/142 constraints. Problems are: Problem set: 16 solved, 560 unsolved
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:23:43] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:23:44] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 20/162 constraints. Problems are: Problem set: 20 solved, 556 unsolved
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-24 08:23:45] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:23:46] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:23:47] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/182 constraints. Problems are: Problem set: 29 solved, 547 unsolved
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:23:48] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:23:49] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:23:50] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:23:50] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:23:50] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:23:50] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:23:50] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:23:50] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:23:50] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/202 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:23:53] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-24 08:23:54] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:23:55] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/222 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 4 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 8 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:23:56] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 1 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:23:57] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/242 constraints. Problems are: Problem set: 35 solved, 541 unsolved
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:23:58] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 3 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:23:59] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 4 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:24:00] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/262 constraints. Problems are: Problem set: 38 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 266/682 variables, and 262 constraints, problems are : Problem set: 38 solved, 538 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 0/266 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 38 solved, 538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 10/10 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 124/134 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/134 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 3 (OVERLAPS) 8/266 variables, 72/206 constraints. Problems are: Problem set: 38 solved, 538 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 56/262 constraints. Problems are: Problem set: 38 solved, 538 unsolved
[2024-05-24 08:24:04] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-24 08:24:05] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-24 08:24:06] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:24:06] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:24:06] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-05-24 08:24:06] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:24:06] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-05-24 08:24:07] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:24:07] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-24 08:24:07] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD205 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 20/282 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:24:08] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:24:09] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:24:09] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:24:09] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:24:09] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:24:09] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:24:09] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-24 08:24:09] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:24:09] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:24:09] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-24 08:24:09] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 20/302 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 08:24:10] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-24 08:24:10] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 1 ms to minimize.
[2024-05-24 08:24:10] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-24 08:24:10] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-24 08:24:11] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:24:11] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:24:11] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:24:11] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:24:11] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:24:11] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:24:11] [INFO ] Deduced a trap composed of 47 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:24:11] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:24:11] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-24 08:24:11] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:24:12] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-24 08:24:12] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:24:12] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-24 08:24:12] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-24 08:24:12] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:24:12] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 20/322 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 08:24:13] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 1 ms to minimize.
[2024-05-24 08:24:13] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:24:13] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:13] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:24:13] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:24:13] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:24:14] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 5 ms to minimize.
[2024-05-24 08:24:15] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:24:15] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:24:15] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-05-24 08:24:15] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 20/342 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 08:24:15] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2024-05-24 08:24:15] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:24:16] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:24:17] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 20/362 constraints. Problems are: Problem set: 40 solved, 536 unsolved
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
[2024-05-24 08:24:18] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:24:19] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:20] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:24:20] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:24:20] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:24:20] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 20/382 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 08:24:20] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:24:20] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 1 ms to minimize.
[2024-05-24 08:24:21] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:24:22] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 20/402 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:23] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 3 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:24:24] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:24:25] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 20/422 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:24:26] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-05-24 08:24:27] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/266 variables, 20/442 constraints. Problems are: Problem set: 42 solved, 534 unsolved
[2024-05-24 08:24:28] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2024-05-24 08:24:28] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-24 08:24:28] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:24:28] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-24 08:24:28] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-05-24 08:24:29] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 1 ms to minimize.
[2024-05-24 08:24:30] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-05-24 08:24:31] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/266 variables, 20/462 constraints. Problems are: Problem set: 42 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 266/682 variables, and 462 constraints, problems are : Problem set: 42 solved, 534 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, State Equation: 0/266 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/576 constraints, Known Traps: 380/380 constraints]
After SMT, in 60559ms problems are : Problem set: 42 solved, 534 unsolved
Search for dead transitions found 42 dead transitions in 60597ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 266/266 places, 542/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Applied a total of 0 rules in 22 ms. Remains 266 /266 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-24 08:24:31] [INFO ] Redundant transitions in 13 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 61224 ms. Remains : 266/266 places, 542/584 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2675 ms (no deadlock found). (steps per millisecond=467 )
Random directed walk for 1250005 steps, including 0 resets, run took 2162 ms (no deadlock found). (steps per millisecond=578 )
[2024-05-24 08:24:36] [INFO ] Flow matrix only has 387 transitions (discarded 155 similar events)
// Phase 1: matrix 387 rows 266 cols
[2024-05-24 08:24:36] [INFO ] Computed 82 invariants in 19 ms
[2024-05-24 08:24:36] [INFO ] [Real]Absence check using 82 positive place invariants in 23 ms returned sat
[2024-05-24 08:24:36] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-24 08:24:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:24:36] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2024-05-24 08:24:37] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2024-05-24 08:24:37] [INFO ] State equation strengthened by 107 read => feed constraints.
[2024-05-24 08:24:37] [INFO ] [Nat]Added 107 Read/Feed constraints in 23 ms returned sat
[2024-05-24 08:24:37] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-05-24 08:24:37] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-24 08:24:37] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-24 08:24:37] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-05-24 08:24:37] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-24 08:24:37] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-24 08:24:37] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:24:37] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-24 08:24:37] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-24 08:24:38] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-24 08:24:39] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-24 08:24:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 44 trap constraints in 3567 ms
[2024-05-24 08:24:40] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 11 ms.
[2024-05-24 08:24:40] [INFO ] Unfolded 17 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 82 transitions.
RANDOM walk for 706 steps (0 resets) in 80 ms. (8 steps per ms) remains 0/16 properties
Able to resolve query QuasiLiveness after proving 17 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 82 transitions.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 82 transitions.
Unable to solve all queries for examination Liveness. Remains :17 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 17 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 71413 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-COL-8

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 18
TRANSITIONS: 17
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 4
COLOR VARS: 5
ARCS: 68
LOADING TIME: 0.149

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 315
TRANSITIONS: 666
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 2934
UNFOLDING TIME: 0.143

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.042
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.502
OK.
----------------------------------------------------------------------
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: 1830
MODEL NAME: /home/mcc/execution/model
315 places, 666 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="LamportFastMutEx-COL-8"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 LamportFastMutEx-COL-8, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r232-tall-171649621800159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;