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-171649621700134.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 Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r232-tall-171649621700134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-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 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716537683024

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-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 08:01:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-24 08:01:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:01:24] [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:01:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 08:01:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 588 ms
[2024-05-24 08:01:24] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 19 ms.
[2024-05-24 08:01:24] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 08:01:24] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-24 08:01:24] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 17 ms.
[2024-05-24 08:01:24] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-24 08:01:24] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 5 ms.
[2024-05-24 08:01:24] [INFO ] Unfolded 17 HLPN properties in 1 ms.
[2024-05-24 08:01:24] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 1 ms.
[2024-05-24 08:01:24] [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(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 08:01:25] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 13 ms.
[2024-05-24 08:01:25] [INFO ] Unfolded 17 HLPN properties in 0 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.30374KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 71/71 places, 114/114 transitions.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Applied a total of 0 rules in 14 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 26 ms. Remains : 71/71 places, 114/114 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 71/71 places, 114/114 transitions.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-24 08:01:25] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2024-05-24 08:01:25] [INFO ] Computed 17 invariants in 13 ms
[2024-05-24 08:01:25] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-24 08:01:25] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 08:01:25] [INFO ] Invariant cache hit.
[2024-05-24 08:01:25] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 08:01:25] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-24 08:01:25] [INFO ] Redundant transitions in 6 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-24 08:01:25] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-05-24 08:01:25] [INFO ] Invariant cache hit.
[2024-05-24 08:01:25] [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 08:01:25] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 11 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 12 places in 32 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 08:01:26] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 08:01:26] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [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 08:01:27] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 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 08:01:27] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-24 08:01:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-24 08:01:28] [INFO ] Deduced a trap composed of 15 places in 33 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 08:01:28] [INFO ] Deduced a trap composed of 12 places in 36 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 08:01:28] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 08:01:28] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 08:01:28] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 08:01:28] [INFO ] Deduced a trap composed of 17 places in 31 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 08:01:28] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 08:01:28] [INFO ] Deduced a trap composed of 20 places in 30 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 5021 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 08:01:30] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 5 ms to minimize.
[2024-05-24 08:01:31] [INFO ] Deduced a trap composed of 12 places in 24 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 08:01:32] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:01:32] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:01:32] [INFO ] Deduced a trap composed of 18 places in 35 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 08:01:33] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:01:33] [INFO ] Deduced a trap composed of 14 places in 30 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 08:01:33] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:01:33] [INFO ] Deduced a trap composed of 17 places in 33 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 08:01:34] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 08:01:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 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 08:01:35] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 08:01:35] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-24 08:01:35] [INFO ] Deduced a trap composed of 15 places in 35 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 7510 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 12645ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 12661ms
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 DEADLOCK mode, iteration 1 : 71/71 places, 96/114 transitions.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Applied a total of 0 rules in 9 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-24 08:01:38] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 13018 ms. Remains : 71/71 places, 96/114 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1335 ms (no deadlock found). (steps per millisecond=936 )
Random directed walk for 1250000 steps, including 0 resets, run took 959 ms (no deadlock found). (steps per millisecond=1303 )
[2024-05-24 08:01:40] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 71 cols
[2024-05-24 08:01:40] [INFO ] Computed 17 invariants in 6 ms
[2024-05-24 08:01:40] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-24 08:01:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 08:01:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:01:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2024-05-24 08:01:40] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-24 08:01:40] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 08:01:40] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 08:01:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-24 08:01:41] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-24 08:01:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-24 08:01:41] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-24 08:01:41] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-24 08:01:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 600 ms
[2024-05-24 08:01:41] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 4 ms.
[2024-05-24 08:01:41] [INFO ] Unfolded 17 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
RANDOM walk for 359 steps (0 resets) in 62 ms. (5 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 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 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 17021 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-COL-3

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.161

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 100
TRANSITIONS: 156
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 664
UNFOLDING TIME: 0.094

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.031
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.469
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: 808
MODEL NAME: /home/mcc/execution/model
100 places, 156 transitions.

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.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716537724781

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -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="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-3, 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-171649621700134"
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 [ "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 ;