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.r223-tall-171649610900209.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-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610900209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.6K Apr 13 07:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 07:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 13 07:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 13 07:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.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.6K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 13 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 13 07:47 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 39K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-COL-3-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716523003164

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 03:56:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 03:56:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:56:44] [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 03:56:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 03:56:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 548 ms
[2024-05-24 03:56:44] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
[2024-05-24 03:56:45] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 03:56:45] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40002 steps (8 resets) in 2044 ms. (19 steps per ms) remains 58/80 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 74 ms. (53 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
// Phase 1: matrix 17 rows 15 cols
[2024-05-24 03:56:46] [INFO ] Computed 2 invariants in 4 ms
[2024-05-24 03:56:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
After SMT solving in domain Real declared 15/32 variables, and 2 constraints, problems are : Problem set: 58 solved, 0 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/15 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 187ms problems are : Problem set: 58 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 58 atomic propositions for a total of 16 simplifications.
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:56:46] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-24 03:56:46] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:56:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:56:46] [INFO ] Flatten gal took : 3 ms
Domain [pid(4), pid(4)] 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 03:56:46] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 33 ms.
[2024-05-24 03:56:46] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
Support contains 57 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 114/114 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 03:56:46] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2024-05-24 03:56:46] [INFO ] Computed 17 invariants in 7 ms
[2024-05-24 03:56:46] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-24 03:56:46] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 03:56:46] [INFO ] Invariant cache hit.
[2024-05-24 03:56:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 03:56:46] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-24 03:56:46] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 03:56:46] [INFO ] Invariant cache hit.
[2024-05-24 03:56:46] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 8 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 20/37 constraints. Problems are: Problem set: 8 solved, 103 unsolved
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-24 03:56:47] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/57 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:56:48] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:56:49] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:56:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:56:49] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:56:49] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 9/66 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 03:56:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/67 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 03:56:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:56:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:56:49] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:56:49] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 4/71 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 03:56:49] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:56:50] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/73 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 96/167 variables, 71/144 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 27/171 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/171 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/171 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 171 constraints, problems are : Problem set: 18 solved, 93 unsolved in 4685 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 34/39 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/39 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 12/51 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 22/73 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 03:56:51] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 4 ms to minimize.
[2024-05-24 03:56:51] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 2/75 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/75 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 96/167 variables, 71/146 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 27/173 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 93/266 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 03:56:53] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:56:53] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:56:53] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 3/269 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 03:56:53] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:56:53] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 2/271 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 03:56:54] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:56:54] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 2/273 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 03:56:55] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:56:55] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 2/275 constraints. Problems are: Problem set: 18 solved, 93 unsolved
[2024-05-24 03:56:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:56:56] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:56:56] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 3/278 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/167 variables, 0/278 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 16 (OVERLAPS) 0/167 variables, 0/278 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 278 constraints, problems are : Problem set: 18 solved, 93 unsolved in 7214 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 70/70 constraints]
After SMT, in 11939ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 11944ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 71/71 places, 96/114 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12153 ms. Remains : 71/71 places, 96/114 transitions.
Support contains 57 out of 71 places after structural reductions.
[2024-05-24 03:56:58] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:56:58] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:56:58] [INFO ] Input system was already deterministic with 96 transitions.
RANDOM walk for 40000 steps (8 resets) in 1477 ms. (27 steps per ms) remains 33/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
[2024-05-24 03:56:59] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 71 cols
[2024-05-24 03:56:59] [INFO ] Computed 17 invariants in 2 ms
[2024-05-24 03:56:59] [INFO ] State equation strengthened by 24 read => feed constraints.
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 12/12 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 84/141 variables, 57/69 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 24/93 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/93 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 14/155 variables, 14/107 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 5/112 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/112 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/112 constraints. Problems are: Problem set: 31 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 112 constraints, problems are : Problem set: 31 solved, 2 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/57 variables, 12/12 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/141 variables, 57/69 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 24/93 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/93 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 14/155 variables, 14/107 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 5/112 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 2/114 constraints. Problems are: Problem set: 31 solved, 2 unsolved
[2024-05-24 03:56:59] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:56:59] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 2/116 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/116 constraints. Problems are: Problem set: 31 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/155 variables, 0/116 constraints. Problems are: Problem set: 31 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 116 constraints, problems are : Problem set: 31 solved, 2 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/33 constraints, Known Traps: 2/2 constraints]
After SMT, in 282ms problems are : Problem set: 31 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 9 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 96/96 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 68 transition count 93
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 68 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 65 transition count 90
Applied a total of 12 rules in 17 ms. Remains 65 /71 variables (removed 6) and now considering 90/96 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 65/71 places, 90/96 transitions.
RANDOM walk for 40000 steps (8 resets) in 325 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Probably explored full state space saw : 15512 states, properties seen :0
Probabilistic random walk after 61100 steps, saw 15512 distinct states, run finished after 244 ms. (steps per millisecond=250 ) properties seen :0
Explored full state space saw : 15512 states, properties seen :0
Exhaustive walk after 61100 steps, saw 15512 distinct states, run finished after 203 ms. (steps per millisecond=300 ) properties seen :0
Successfully simplified 33 atomic propositions for a total of 8 simplifications.
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:57:00] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 21 out of 71 places (down from 24) after GAL structural reductions.
Computed a total of 1 stabilizing places and 3 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:57:00] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:57:00] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:57:00] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:57:00] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:57:00] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 71/71 places, 96/96 transitions.
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:57:00] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:57:00] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:57:00] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2024-05-24 03:57:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 96 transitions and 408 arcs took 1 ms.
Total runtime 16396 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-COL-3

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 71
TRANSITIONS: 96
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 763
MODEL NAME: /home/mcc/execution/406/model
71 places, 96 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.
Building monolithic NSF...
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-3-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716523022333

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

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-3"
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 LamportFastMutEx-COL-3, 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 r223-tall-171649610900209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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