fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r504-tall-171649612400257
Last Updated
July 7, 2024

About the Execution of LTSMin+red for LamportFastMutEx-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
265.903 5980.00 15599.00 43.00 F??F?FTTT??FFTF? normal

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.r504-tall-171649612400257.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 ltsminxred
Input is LamportFastMutEx-PT-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612400257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 16K Apr 13 07:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 13 07:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 07:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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 5.9K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 07:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 13 07:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 07:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 48K 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-PT-2-CTLCardinality-2024-00
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-01
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-02
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-03
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-04
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-05
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-06
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-07
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-08
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-09
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-10
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-11
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-12
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-13
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-14
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717226435181

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:20:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:20:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:20:36] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-06-01 07:20:36] [INFO ] Transformed 69 places.
[2024-06-01 07:20:36] [INFO ] Transformed 96 transitions.
[2024-06-01 07:20:36] [INFO ] Found NUPN structural information;
[2024-06-01 07:20:36] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_await_13_0, P_await_13_1, P_await_13_2, P_done_0_0, P_done_0_1, P_done_0_2, P_done_1_0, P_done_1_1, P_done_1_2, P_done_2_0, P_done_2_1, P_done_2_2, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_awaity_0, P_awaity_1, P_awaity_2, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2]
[2024-06-01 07:20:36] [INFO ] Parsed PT model containing 69 places and 96 transitions and 402 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 34 transitions.
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 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 7 ms. Remains 44 /44 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-06-01 07:20:36] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2024-06-01 07:20:36] [INFO ] Computed 10 invariants in 14 ms
[2024-06-01 07:20:36] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 07:20:36] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-06-01 07:20:36] [INFO ] Invariant cache hit.
[2024-06-01 07:20:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 07:20:36] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 07:20:36] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
[2024-06-01 07:20:36] [INFO ] Invariant cache hit.
[2024-06-01 07:20:36] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 20/74 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/79 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/79 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 56/100 variables, 44/123 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 16/139 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 139 constraints, problems are : Problem set: 12 solved, 48 unsolved in 1699 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 12 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 4/46 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 15/61 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/61 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 2/44 variables, 6/67 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 2/69 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 10/79 constraints. Problems are: Problem set: 12 solved, 48 unsolved
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 1/80 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/80 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 56/100 variables, 44/124 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 16/140 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/100 variables, 48/188 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/188 constraints. Problems are: Problem set: 12 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/100 variables, 0/188 constraints. Problems are: Problem set: 12 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 188 constraints, problems are : Problem set: 12 solved, 48 unsolved in 908 ms.
Refiners :[Domain max(s): 44/44 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 44/44 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 48/60 constraints, Known Traps: 26/26 constraints]
After SMT, in 2664ms problems are : Problem set: 12 solved, 48 unsolved
Search for dead transitions found 12 dead transitions in 2676ms
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 2976 ms. Remains : 44/44 places, 50/62 transitions.
Support contains 37 out of 44 places after structural reductions.
[2024-06-01 07:20:39] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 07:20:39] [INFO ] Flatten gal took : 23 ms
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:20:39] [INFO ] Flatten gal took : 8 ms
[2024-06-01 07:20:39] [INFO ] Input system was already deterministic with 50 transitions.
RANDOM walk for 40000 steps (8 resets) in 2196 ms. (18 steps per ms) remains 25/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
[2024-06-01 07:20:40] [INFO ] Flow matrix only has 48 transitions (discarded 2 similar events)
// Phase 1: matrix 48 rows 44 cols
[2024-06-01 07:20:40] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 07:20:40] [INFO ] State equation strengthened by 14 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
After SMT solving in domain Real declared 32/92 variables, and 32 constraints, problems are : Problem set: 25 solved, 0 unsolved in 31 ms.
Refiners :[Domain max(s): 32/44 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/44 constraints, ReadFeed: 0/14 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 25 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 25 atomic propositions for a total of 8 simplifications.
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 5 ms
[2024-06-01 07:20:40] [INFO ] Input system was already deterministic with 50 transitions.
Support contains 29 out of 44 places (down from 35) after GAL structural reductions.
FORMULA LamportFastMutEx-PT-2-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 2 stable 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-06-01 07:20:40] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:20:40] [INFO ] Input system was already deterministic with 50 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 0 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 11 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 11 ms. Remains : 42/44 places, 48/50 transitions.
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:20:40] [INFO ] Input system was already deterministic with 48 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-06-01 07:20:40] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:20:40] [INFO ] Input system was already deterministic with 50 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 0 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 5 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 5 ms. Remains : 42/44 places, 48/50 transitions.
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:20:40] [INFO ] Input system was already deterministic with 48 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-06-01 07:20:40] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:20:40] [INFO ] Input system was already deterministic with 50 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 0 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 4 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 4 ms. Remains : 42/44 places, 48/50 transitions.
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:20:40] [INFO ] Input system was already deterministic with 48 transitions.
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 4 ms
[2024-06-01 07:20:40] [INFO ] Flatten gal took : 3 ms
[2024-06-01 07:20:40] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2024-06-01 07:20:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 44 places, 50 transitions and 208 arcs took 1 ms.
Total runtime 4653 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : LamportFastMutEx-PT-2-CTLCardinality-2024-01
Could not compute solution for formula : LamportFastMutEx-PT-2-CTLCardinality-2024-02
Could not compute solution for formula : LamportFastMutEx-PT-2-CTLCardinality-2024-04
Could not compute solution for formula : LamportFastMutEx-PT-2-CTLCardinality-2024-09
Could not compute solution for formula : LamportFastMutEx-PT-2-CTLCardinality-2024-10
Could not compute solution for formula : LamportFastMutEx-PT-2-CTLCardinality-2024-15

BK_STOP 1717226441161

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name LamportFastMutEx-PT-2-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/585/ctl_0_
ctl formula name LamportFastMutEx-PT-2-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/585/ctl_1_
ctl formula name LamportFastMutEx-PT-2-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/585/ctl_2_
ctl formula name LamportFastMutEx-PT-2-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/585/ctl_3_
ctl formula name LamportFastMutEx-PT-2-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/585/ctl_4_
ctl formula name LamportFastMutEx-PT-2-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/585/ctl_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-PT-2"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is LamportFastMutEx-PT-2, 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 r504-tall-171649612400257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 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 ;