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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 11K Apr 13 07:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 13 07:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 07:33 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 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 8.1K Apr 13 07:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 07:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 07:35 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 38K 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-2-CTLFireability-2024-00
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-01
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-02
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-03
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-04
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-05
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-06
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-07
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-08
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-09
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-10
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-11
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-12
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-13
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-14
FORMULA_NAME LamportFastMutEx-COL-2-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716522907458

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 03:55:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 03:55:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:55:08] [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:55:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 03:55:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 578 ms
[2024-05-24 03:55:09] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 69 PT places and 117.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2024-05-24 03:55:09] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 03:55:09] [INFO ] Skeletonized 3 HLPN properties in 2 ms. Removed 13 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 2 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 218 steps (0 resets) in 16 ms. (12 steps per ms) remains 0/2 properties
[2024-05-24 03:55:09] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:55:09] [INFO ] Flatten gal took : 3 ms
Domain [pid(3), pid(3)] 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:55:09] [INFO ] Unfolded HLPN to a Petri net with 69 places and 96 transitions 402 arcs in 22 ms.
[2024-05-24 03:55:09] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 62/62 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-24 03:55:09] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2024-05-24 03:55:09] [INFO ] Computed 10 invariants in 12 ms
[2024-05-24 03:55:09] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-24 03:55:09] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 03:55:09] [INFO ] Invariant cache hit.
[2024-05-24 03:55:09] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-24 03:55:09] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-24 03:55:09] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-05-24 03:55:09] [INFO ] Invariant cache hit.
[2024-05-24 03:55:09] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 03:55:11] [INFO ] Deduced a trap composed of 9 places in 1076 ms of which 23 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-24 03:55:11] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-24 03:55:11] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-24 03:55:11] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-24 03:55:11] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-24 03:55:11] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-24 03:55:12] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 25 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-24 03:55:12] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-24 03:55:12] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-24 03:55:13] [INFO ] Deduced a trap composed of 11 places in 1174 ms of which 7 ms to minimize.
[2024-05-24 03:55:14] [INFO ] Deduced a trap composed of 12 places in 605 ms of which 30 ms to minimize.
[2024-05-24 03:55:14] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
[2024-05-24 03:55:14] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 1 ms to minimize.
[2024-05-24 03:55:14] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-05-24 03:55:14] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:55:14] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:55:14] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:55:14] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:55:14] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 19/29 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 03:55:14] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2024-05-24 03:55:15] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 56/100 variables, 44/75 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 16/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 91 constraints, problems are : Problem set: 12 solved, 48 unsolved in 5836 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 13/17 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 6/23 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/31 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 03:55:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/32 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/32 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 56/100 variables, 44/76 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 16/92 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 48/140 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 03:55:16] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 1/141 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-05-24 03:55:16] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 1/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/100 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 142 constraints, problems are : Problem set: 12 solved, 48 unsolved in 2588 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 24/24 constraints]
After SMT, in 8546ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 8568ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 44/44 places, 50/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9002 ms. Remains : 44/44 places, 50/62 transitions.
Support contains 44 out of 44 places after structural reductions.
[2024-05-24 03:55:18] [INFO ] Flatten gal took : 28 ms
[2024-05-24 03:55:18] [INFO ] Flatten gal took : 37 ms
[2024-05-24 03:55:18] [INFO ] Input system was already deterministic with 50 transitions.
Reduction of identical properties reduced properties to check from 40 to 35
RANDOM walk for 40000 steps (8 resets) in 2252 ms. (17 steps per ms) remains 3/35 properties
BEST_FIRST walk for 40002 steps (8 resets) in 709 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 872 ms. (45 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 496 ms. (80 steps per ms) remains 3/3 properties
[2024-05-24 03:55:20] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-05-24 03:55:20] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:55:20] [INFO ] State equation strengthened by 14 read => feed constraints.
Problem AtomicPropp18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 20/41 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-24 03:55:20] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Problem AtomicPropp2 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/89 variables, 41/51 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 14/65 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-24 03:55:20] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:55:20] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 2/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/92 variables, 3/70 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 1/71 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 71 constraints, problems are : Problem set: 2 solved, 1 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 31/41 variables, 7/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-24 03:55:20] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:55:20] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:55:20] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
Problem AtomicPropp32 is UNSAT
After SMT solving in domain Int declared 41/92 variables, and 15 constraints, problems are : Problem set: 3 solved, 0 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 9/10 constraints, State Equation: 0/44 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 334ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:55:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 03:55:20] [INFO ] Flatten gal took : 18 ms
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:55:20] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:55:20] [INFO ] Input system was already deterministic with 50 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 48
Applied a total of 4 rules in 13 ms. Remains 42 /44 variables (removed 2) and now considering 48/50 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 42/44 places, 48/50 transitions.
[2024-05-24 03:55:20] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:55:20] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:55:20] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 55 steps (0 resets) in 8 ms. (6 steps per ms) remains 0/1 properties
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 03:55:20] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:55:20] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:55:20] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 03:55:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 29 ms
[2024-05-24 03:55:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 29 ms
[2024-05-24 03:55:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:55:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 28 ms
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:55:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 38 ms
[2024-05-24 03:55:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:55:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:55:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:55:21] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 44/44 places, 50/50 transitions.
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 28 ms
[2024-05-24 03:55:21] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:55:21] [INFO ] Flatten gal took : 32 ms
[2024-05-24 03:55:21] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 29 ms.
[2024-05-24 03:55:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 44 places, 50 transitions and 208 arcs took 3 ms.
Total runtime 13078 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-COL-2

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/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: 642
MODEL NAME: /home/mcc/execution/412/model
44 places, 50 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA LamportFastMutEx-COL-2-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716522923249

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

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

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-2"
export BK_EXAMINATION="CTLFireability"
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-2, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649610900202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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