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-171649612400277.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-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612400277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 17K Apr 13 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 13 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 13 07:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.5K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 13 07:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 13 07:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 13 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 222K Apr 13 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 114K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717226909180

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:28:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 07:28:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:28:30] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-01 07:28:30] [INFO ] Transformed 135 places.
[2024-06-01 07:28:30] [INFO ] Transformed 230 transitions.
[2024-06-01 07:28:30] [INFO ] Found NUPN structural information;
[2024-06-01 07:28:30] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, 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_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4]
[2024-06-01 07:28:30] [INFO ] Parsed PT model containing 135 places and 230 transitions and 990 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
FORMULA LamportFastMutEx-PT-4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 16, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 16, 1, 1, 1, 1, 1, 1]
[2024-06-01 07:28:30] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-06-01 07:28:30] [INFO ] Computed 26 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[4, 4, 4, 4, 4, 4, 16, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 39 ms. (250 steps per ms)
FORMULA LamportFastMutEx-PT-4-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 66 ms. (746 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 3, 3, 12] Max Struct:[4, 4, 4, 4, 16]
[2024-06-01 07:28:30] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2024-06-01 07:28:30] [INFO ] Invariant cache hit.
[2024-06-01 07:28:30] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2024-06-01 07:28:30] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 07:28:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 07:28:30] [INFO ] [Real]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-06-01 07:28:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:28:30] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2024-06-01 07:28:30] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-01 07:28:30] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 15 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 453 ms
[2024-06-01 07:28:31] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-06-01 07:28:31] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-06-01 07:28:31] [INFO ] [Real]Added 40 Read/Feed constraints in 3 ms returned sat
[2024-06-01 07:28:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:28:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-06-01 07:28:31] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 07:28:31] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 4 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:31] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 482 ms
[2024-06-01 07:28:32] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2024-06-01 07:28:32] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 07:28:32] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-01 07:28:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:28:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-06-01 07:28:32] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 07:28:32] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 281 ms
[2024-06-01 07:28:32] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-06-01 07:28:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 07:28:32] [INFO ] [Real]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-01 07:28:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:28:32] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-06-01 07:28:32] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-06-01 07:28:32] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:28:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 322 ms
[2024-06-01 07:28:32] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2024-06-01 07:28:32] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 07:28:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:28:33] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2024-06-01 07:28:33] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 07:28:33] [INFO ] [Nat]Added 40 Read/Feed constraints in 16 ms returned sat
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:28:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 565 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 3, 3, 12] Max Struct:[3, 3, 3, 3, 12]
FORMULA LamportFastMutEx-PT-4-UpperBounds-07 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-PT-4-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 3482 ms.
ITS solved all properties within timeout

BK_STOP 1717226913726

--------------------
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 UpperBounds -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-PT-4"
export BK_EXAMINATION="UpperBounds"
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-4, examination is UpperBounds"
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-171649612400277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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