Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418900443.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is LamportFastMutEx-PT-8, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418900443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 24K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Feb 25 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 228K Feb 25 13:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 64K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 321K Feb 25 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 329K Mar 5 18:22 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-8-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-8-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679525381065

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-PT-8
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 22:49:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 22:49:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:49:42] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-22 22:49:42] [INFO ] Transformed 315 places.
[2023-03-22 22:49:42] [INFO ] Transformed 666 transitions.
[2023-03-22 22:49:42] [INFO ] Found NUPN structural information;
[2023-03-22 22:49:42] [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_start_1_5, P_start_1_6, P_start_1_7, P_start_1_8, 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_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_b_8_false, P_b_8_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setx_3_8, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_setbi_5_8, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_ify0_4_8, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_sety_9_8, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_ifxi_10_8, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_setbi_11_8, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_fordo_12_8, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_0_8, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_1_8, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_2_8, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_3_8, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_4_8, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_5_8, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_6_8, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_wait_7_8, P_wait_8_0, P_wait_8_1, P_wait_8_2, P_wait_8_3, P_wait_8_4, P_wait_8_5, P_wait_8_6, P_wait_8_7, P_wait_8_8, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_await_13_8, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_0_8, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_1_8, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_2_8, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_3_8, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_4_8, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_5_8, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_6_8, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_done_7_8, P_done_8_0, P_done_8_1, P_done_8_2, P_done_8_3, P_done_8_4, P_done_8_5, P_done_8_6, P_done_8_7, P_done_8_8, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_ifyi_15_8, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_awaity_8, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_CS_21_8, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7, P_setbi_24_8]
[2023-03-22 22:49:42] [INFO ] Parsed PT model containing 315 places and 666 transitions and 2934 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-8-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 206 out of 266 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 17 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:49:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 22:49:43] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-22 22:49:43] [INFO ] Implicit Places using invariants in 374 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 401 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Applied a total of 0 rules in 7 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 426 ms. Remains : 258/266 places, 584/584 transitions.
Support contains 206 out of 258 places after structural reductions.
[2023-03-22 22:49:43] [INFO ] Flatten gal took : 77 ms
[2023-03-22 22:49:43] [INFO ] Flatten gal took : 57 ms
[2023-03-22 22:49:43] [INFO ] Input system was already deterministic with 584 transitions.
Finished random walk after 898 steps, including 0 resets, run visited all 19 properties in 43 ms. (steps per millisecond=20 )
FORMULA LamportFastMutEx-PT-8-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 8 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 72 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 9 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:49:44] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 22:49:44] [INFO ] Computed 74 place invariants in 9 ms
[2023-03-22 22:49:44] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-22 22:49:44] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:44] [INFO ] Invariant cache hit.
[2023-03-22 22:49:44] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:49:44] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-22 22:49:44] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:44] [INFO ] Invariant cache hit.
[2023-03-22 22:49:45] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 258/258 places, 584/584 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT 1 (ADD s50 s51 s52 s53 s54 s55 s56 s57)) (LEQ 1 (ADD s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-8-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-01 finished in 1811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Support contains 88 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:49:46] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:46] [INFO ] Invariant cache hit.
[2023-03-22 22:49:46] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-22 22:49:46] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:46] [INFO ] Invariant cache hit.
[2023-03-22 22:49:46] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:49:46] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-22 22:49:46] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:46] [INFO ] Invariant cache hit.
[2023-03-22 22:49:46] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 750 ms. Remains : 258/258 places, 584/584 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s66 s67 s68 s69 s70 s71 s72 s73) (ADD s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1655 reset in 628 ms.
Product exploration explored 100000 steps with 1652 reset in 570 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-22 22:49:49] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:49] [INFO ] Invariant cache hit.
[2023-03-22 22:49:49] [INFO ] [Real]Absence check using 74 positive place invariants in 38 ms returned sat
[2023-03-22 22:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:49:49] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-22 22:49:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:49:50] [INFO ] [Nat]Absence check using 74 positive place invariants in 24 ms returned sat
[2023-03-22 22:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:49:50] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2023-03-22 22:49:50] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:49:50] [INFO ] [Nat]Added 48 Read/Feed constraints in 27 ms returned sat
[2023-03-22 22:49:50] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 5 ms to minimize.
[2023-03-22 22:49:50] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-22 22:49:50] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 22:49:50] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 6 ms to minimize.
[2023-03-22 22:49:50] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2023-03-22 22:49:50] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2023-03-22 22:49:50] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2023-03-22 22:49:50] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-22 22:49:51] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2023-03-22 22:49:51] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2023-03-22 22:49:51] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2023-03-22 22:49:51] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 0 ms to minimize.
[2023-03-22 22:49:51] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2023-03-22 22:49:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1287 ms
[2023-03-22 22:49:51] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 35 ms.
[2023-03-22 22:49:53] [INFO ] Added : 185 causal constraints over 38 iterations in 1566 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 88 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 25 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:49:53] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:53] [INFO ] Invariant cache hit.
[2023-03-22 22:49:53] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-22 22:49:53] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:53] [INFO ] Invariant cache hit.
[2023-03-22 22:49:53] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:49:53] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-22 22:49:53] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:53] [INFO ] Invariant cache hit.
[2023-03-22 22:49:53] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 751 ms. Remains : 258/258 places, 584/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-22 22:49:54] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:54] [INFO ] Invariant cache hit.
[2023-03-22 22:49:54] [INFO ] [Real]Absence check using 74 positive place invariants in 33 ms returned sat
[2023-03-22 22:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:49:55] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-22 22:49:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:49:55] [INFO ] [Nat]Absence check using 74 positive place invariants in 24 ms returned sat
[2023-03-22 22:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:49:55] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-22 22:49:55] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:49:55] [INFO ] [Nat]Added 48 Read/Feed constraints in 30 ms returned sat
[2023-03-22 22:49:55] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-22 22:49:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-22 22:49:55] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 22:49:56] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-03-22 22:49:56] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 0 ms to minimize.
[2023-03-22 22:49:56] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-22 22:49:56] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-22 22:49:56] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-22 22:49:56] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2023-03-22 22:49:56] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2023-03-22 22:49:56] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2023-03-22 22:49:56] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 0 ms to minimize.
[2023-03-22 22:49:56] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 0 ms to minimize.
[2023-03-22 22:49:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1369 ms
[2023-03-22 22:49:57] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 31 ms.
[2023-03-22 22:49:58] [INFO ] Added : 185 causal constraints over 38 iterations in 1530 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1672 reset in 523 ms.
Product exploration explored 100000 steps with 1682 reset in 541 ms.
Support contains 88 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:49:59] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:49:59] [INFO ] Invariant cache hit.
[2023-03-22 22:50:00] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-22 22:50:00] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:00] [INFO ] Invariant cache hit.
[2023-03-22 22:50:00] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:00] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-22 22:50:00] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:00] [INFO ] Invariant cache hit.
[2023-03-22 22:50:00] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 809 ms. Remains : 258/258 places, 584/584 transitions.
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-02 finished in 14690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p0 U G(!p0)))))'
Support contains 8 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:50:00] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:00] [INFO ] Invariant cache hit.
[2023-03-22 22:50:01] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-22 22:50:01] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:01] [INFO ] Invariant cache hit.
[2023-03-22 22:50:01] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:01] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-22 22:50:01] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:01] [INFO ] Invariant cache hit.
[2023-03-22 22:50:01] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1067 ms. Remains : 258/258 places, 584/584 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, p0, true, true, true]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 1 (ADD s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-03 finished in 1248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&G(p1))))))'
Support contains 24 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:50:02] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:02] [INFO ] Invariant cache hit.
[2023-03-22 22:50:02] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-22 22:50:02] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:02] [INFO ] Invariant cache hit.
[2023-03-22 22:50:02] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:02] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 726 ms to find 0 implicit places.
[2023-03-22 22:50:02] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:02] [INFO ] Invariant cache hit.
[2023-03-22 22:50:03] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 258/258 places, 584/584 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, p0, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LEQ 3 (ADD s234 s235 s236 s237 s238 s239 s240 s241)) (LEQ 2 (ADD s50 s51 s52 s53 s54 s55 s56 s57))), p1:(GT 1 (ADD s90 s91 s92 s93 s94 s95 s96 s97...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-04 finished in 1207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||(X(!p0) U p1)||X(p1))))'
Support contains 24 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 8 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:50:03] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:03] [INFO ] Invariant cache hit.
[2023-03-22 22:50:03] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-22 22:50:03] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:03] [INFO ] Invariant cache hit.
[2023-03-22 22:50:03] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:03] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-22 22:50:04] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:04] [INFO ] Invariant cache hit.
[2023-03-22 22:50:04] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1007 ms. Remains : 258/258 places, 584/584 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s50 s51 s52 s53 s54 s55 s56 s57) (ADD s0 s1 s2 s3 s4 s5 s6 s7)), p0:(GT 1 (ADD s66 s67 s68 s69 s70 s71 s72 s73))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 269 ms.
Stack based approach found an accepted trace after 1683 steps with 0 reset with depth 1684 and stack size 1684 in 6 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-05 finished in 1456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!((p0 U p1) U X(X(p0))))))'
Support contains 16 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:50:04] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:04] [INFO ] Invariant cache hit.
[2023-03-22 22:50:05] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-22 22:50:05] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:05] [INFO ] Invariant cache hit.
[2023-03-22 22:50:05] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:05] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
[2023-03-22 22:50:05] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:05] [INFO ] Invariant cache hit.
[2023-03-22 22:50:05] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 961 ms. Remains : 258/258 places, 584/584 transitions.
Stuttering acceptance computed with spot in 295 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0, 1} source=2 dest: 4}, { cond=p1, acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 2}], [{ cond=p0, acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 1}, { cond=p0, acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=6 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 5}]], initial=0, aps=[p1:(LEQ (ADD s50 s51 s52 s53 s54 s55 s56 s57) (ADD s58 s59 s60 s61 s62 s63 s64 s65)), p0:(LEQ 3 (ADD s50 s51 s52 s53 s54 s55 s56 s57))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22277 reset in 257 ms.
Product exploration explored 100000 steps with 22235 reset in 264 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 624 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Finished random walk after 596 steps, including 0 resets, run visited all 5 properties in 12 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 649 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Stuttering acceptance computed with spot in 355 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Support contains 16 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:50:08] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:08] [INFO ] Invariant cache hit.
[2023-03-22 22:50:09] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-22 22:50:09] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:09] [INFO ] Invariant cache hit.
[2023-03-22 22:50:09] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:09] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-22 22:50:09] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:09] [INFO ] Invariant cache hit.
[2023-03-22 22:50:09] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 905 ms. Remains : 258/258 places, 584/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 555 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Finished random walk after 692 steps, including 0 resets, run visited all 5 properties in 12 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 614 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 408 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Stuttering acceptance computed with spot in 300 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Stuttering acceptance computed with spot in 303 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Product exploration explored 100000 steps with 22189 reset in 268 ms.
Product exploration explored 100000 steps with 22161 reset in 288 ms.
Support contains 16 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 4 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:50:13] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:13] [INFO ] Invariant cache hit.
[2023-03-22 22:50:13] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-22 22:50:13] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:13] [INFO ] Invariant cache hit.
[2023-03-22 22:50:13] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:13] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-22 22:50:13] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:13] [INFO ] Invariant cache hit.
[2023-03-22 22:50:13] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 887 ms. Remains : 258/258 places, 584/584 transitions.
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-06 finished in 9274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||F(p1))))))'
Support contains 80 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:50:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:14] [INFO ] Invariant cache hit.
[2023-03-22 22:50:14] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-22 22:50:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:14] [INFO ] Invariant cache hit.
[2023-03-22 22:50:14] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:14] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-22 22:50:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:14] [INFO ] Invariant cache hit.
[2023-03-22 22:50:14] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 258/258 places, 584/584 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s82 s83 s84 s85 s86 s87 s88 s89) (ADD s50 s51 s52 s53 s54 s55 s56 s57)), p1:(AND (GT (ADD s82 s83 s84 s85 s86 s87 s88 s89) (ADD s50 s51 s52 s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2565 reset in 298 ms.
Stack based approach found an accepted trace after 15847 steps with 383 reset with depth 97 and stack size 97 in 45 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-07 finished in 1317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 258 transition count 577
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 251 transition count 577
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 30 place count 243 transition count 569
Applied a total of 30 rules in 56 ms. Remains 243 /258 variables (removed 15) and now considering 569/584 (removed 15) transitions.
[2023-03-22 22:50:15] [INFO ] Flow matrix only has 401 transitions (discarded 168 similar events)
// Phase 1: matrix 401 rows 243 cols
[2023-03-22 22:50:15] [INFO ] Computed 74 place invariants in 5 ms
[2023-03-22 22:50:15] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-22 22:50:15] [INFO ] Flow matrix only has 401 transitions (discarded 168 similar events)
[2023-03-22 22:50:15] [INFO ] Invariant cache hit.
[2023-03-22 22:50:15] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:16] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2023-03-22 22:50:16] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-22 22:50:16] [INFO ] Flow matrix only has 401 transitions (discarded 168 similar events)
[2023-03-22 22:50:16] [INFO ] Invariant cache hit.
[2023-03-22 22:50:16] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/258 places, 569/584 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 945 ms. Remains : 243/258 places, 569/584 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s218 0) (NEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 250 ms.
Stack based approach found an accepted trace after 1627 steps with 0 reset with depth 1628 and stack size 1628 in 4 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-09 finished in 1261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(!p1))||(p1&&F(!p1)))))'
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 258 transition count 576
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 576
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 242 transition count 568
Applied a total of 32 rules in 31 ms. Remains 242 /258 variables (removed 16) and now considering 568/584 (removed 16) transitions.
[2023-03-22 22:50:16] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 22:50:16] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 22:50:16] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-22 22:50:16] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:16] [INFO ] Invariant cache hit.
[2023-03-22 22:50:16] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:17] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-22 22:50:17] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 22:50:17] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:17] [INFO ] Invariant cache hit.
[2023-03-22 22:50:17] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/258 places, 568/584 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 964 ms. Remains : 242/258 places, 568/584 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s233 0) (EQ s6 1)), p0:(AND (EQ s6 0) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 216 reset in 268 ms.
Stack based approach found an accepted trace after 1368 steps with 5 reset with depth 216 and stack size 216 in 9 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-12 finished in 1325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 258 transition count 576
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 576
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 242 transition count 568
Applied a total of 32 rules in 20 ms. Remains 242 /258 variables (removed 16) and now considering 568/584 (removed 16) transitions.
[2023-03-22 22:50:17] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:17] [INFO ] Invariant cache hit.
[2023-03-22 22:50:18] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-22 22:50:18] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:18] [INFO ] Invariant cache hit.
[2023-03-22 22:50:18] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:18] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2023-03-22 22:50:18] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 22:50:18] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:18] [INFO ] Invariant cache hit.
[2023-03-22 22:50:18] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/258 places, 568/584 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 970 ms. Remains : 242/258 places, 568/584 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s235 0) (EQ s231 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 188 reset in 244 ms.
Product exploration explored 100000 steps with 202 reset in 265 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 451 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=75 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 29 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 22:50:19] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:19] [INFO ] Invariant cache hit.
[2023-03-22 22:50:20] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-22 22:50:20] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:20] [INFO ] Invariant cache hit.
[2023-03-22 22:50:20] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:20] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-22 22:50:20] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 22:50:20] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:20] [INFO ] Invariant cache hit.
[2023-03-22 22:50:20] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 994 ms. Remains : 242/242 places, 568/568 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 511 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=63 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 211 reset in 248 ms.
Product exploration explored 100000 steps with 199 reset in 274 ms.
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 22:50:22] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:22] [INFO ] Invariant cache hit.
[2023-03-22 22:50:22] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-22 22:50:22] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:22] [INFO ] Invariant cache hit.
[2023-03-22 22:50:22] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:22] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-03-22 22:50:22] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 22:50:22] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:50:22] [INFO ] Invariant cache hit.
[2023-03-22 22:50:22] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 957 ms. Remains : 242/242 places, 568/568 transitions.
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-14 finished in 5103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 4 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:50:23] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 22:50:23] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 22:50:23] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-22 22:50:23] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:23] [INFO ] Invariant cache hit.
[2023-03-22 22:50:23] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:23] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2023-03-22 22:50:23] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:23] [INFO ] Invariant cache hit.
[2023-03-22 22:50:23] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 921 ms. Remains : 258/258 places, 584/584 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s74 0) (EQ s11 1) (EQ s87 0) (EQ s23 1)), p1:(OR (EQ s11 0) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-PT-8-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-15 finished in 1089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Found a Shortening insensitive property : LamportFastMutEx-PT-8-LTLCardinality-02
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 88 out of 258 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 258 transition count 576
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 576
Applied a total of 16 rules in 17 ms. Remains 250 /258 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 22:50:24] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2023-03-22 22:50:24] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 22:50:24] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-22 22:50:24] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 22:50:24] [INFO ] Invariant cache hit.
[2023-03-22 22:50:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:24] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2023-03-22 22:50:24] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 22:50:24] [INFO ] Invariant cache hit.
[2023-03-22 22:50:25] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 250/258 places, 576/584 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 880 ms. Remains : 250/258 places, 576/584 transitions.
Running random walk in product with property : LamportFastMutEx-PT-8-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s66 s67 s68 s69 s70 s71 s72 s73) (ADD s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1730 reset in 508 ms.
Product exploration explored 100000 steps with 1731 reset in 522 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-22 22:50:26] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 22:50:26] [INFO ] Invariant cache hit.
[2023-03-22 22:50:27] [INFO ] [Real]Absence check using 74 positive place invariants in 27 ms returned sat
[2023-03-22 22:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:50:27] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2023-03-22 22:50:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:50:27] [INFO ] [Nat]Absence check using 74 positive place invariants in 26 ms returned sat
[2023-03-22 22:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:50:27] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2023-03-22 22:50:27] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:27] [INFO ] [Nat]Added 48 Read/Feed constraints in 18 ms returned sat
[2023-03-22 22:50:28] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-22 22:50:28] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-22 22:50:28] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2023-03-22 22:50:28] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 22:50:28] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2023-03-22 22:50:28] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2023-03-22 22:50:28] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2023-03-22 22:50:28] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2023-03-22 22:50:28] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 22:50:29] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2023-03-22 22:50:29] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-22 22:50:29] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 0 ms to minimize.
[2023-03-22 22:50:29] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-22 22:50:29] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2023-03-22 22:50:29] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2023-03-22 22:50:29] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-03-22 22:50:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1695 ms
[2023-03-22 22:50:29] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 32 ms.
[2023-03-22 22:50:30] [INFO ] Added : 182 causal constraints over 38 iterations in 1276 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 88 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 22:50:30] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 22:50:30] [INFO ] Invariant cache hit.
[2023-03-22 22:50:31] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-22 22:50:31] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 22:50:31] [INFO ] Invariant cache hit.
[2023-03-22 22:50:31] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:31] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2023-03-22 22:50:31] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 22:50:31] [INFO ] Invariant cache hit.
[2023-03-22 22:50:31] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 810 ms. Remains : 250/250 places, 576/576 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 12 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-22 22:50:32] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 22:50:32] [INFO ] Invariant cache hit.
[2023-03-22 22:50:32] [INFO ] [Real]Absence check using 74 positive place invariants in 25 ms returned sat
[2023-03-22 22:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:50:32] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2023-03-22 22:50:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:50:33] [INFO ] [Nat]Absence check using 74 positive place invariants in 25 ms returned sat
[2023-03-22 22:50:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:50:33] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-22 22:50:33] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:33] [INFO ] [Nat]Added 48 Read/Feed constraints in 19 ms returned sat
[2023-03-22 22:50:33] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-22 22:50:33] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 0 ms to minimize.
[2023-03-22 22:50:33] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2023-03-22 22:50:33] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 22:50:33] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2023-03-22 22:50:34] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 0 ms to minimize.
[2023-03-22 22:50:34] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 0 ms to minimize.
[2023-03-22 22:50:34] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2023-03-22 22:50:34] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2023-03-22 22:50:34] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2023-03-22 22:50:34] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-22 22:50:34] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2023-03-22 22:50:34] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2023-03-22 22:50:34] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-22 22:50:34] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2023-03-22 22:50:35] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2023-03-22 22:50:35] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1616 ms
[2023-03-22 22:50:35] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 32 ms.
[2023-03-22 22:50:36] [INFO ] Added : 182 causal constraints over 38 iterations in 1240 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1724 reset in 532 ms.
Product exploration explored 100000 steps with 1749 reset in 553 ms.
Support contains 88 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 22:50:37] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 22:50:37] [INFO ] Invariant cache hit.
[2023-03-22 22:50:37] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-22 22:50:37] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 22:50:37] [INFO ] Invariant cache hit.
[2023-03-22 22:50:37] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:38] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2023-03-22 22:50:38] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 22:50:38] [INFO ] Invariant cache hit.
[2023-03-22 22:50:38] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 813 ms. Remains : 250/250 places, 576/576 transitions.
Treatment of property LamportFastMutEx-PT-8-LTLCardinality-02 finished in 14371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!((p0 U p1) U X(X(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-22 22:50:38] [INFO ] Flatten gal took : 36 ms
[2023-03-22 22:50:38] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 22:50:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 258 places, 584 transitions and 2416 arcs took 6 ms.
Total runtime 56113 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1904/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1904/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1904/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : LamportFastMutEx-PT-8-LTLCardinality-02
Could not compute solution for formula : LamportFastMutEx-PT-8-LTLCardinality-06
Could not compute solution for formula : LamportFastMutEx-PT-8-LTLCardinality-14

BK_STOP 1679525440060

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name LamportFastMutEx-PT-8-LTLCardinality-02
ltl formula formula --ltl=/tmp/1904/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 258 places, 584 transitions and 2416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1904/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1904/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1904/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1904/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name LamportFastMutEx-PT-8-LTLCardinality-06
ltl formula formula --ltl=/tmp/1904/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 258 places, 584 transitions and 2416 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1904/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1904/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1904/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1904/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name LamportFastMutEx-PT-8-LTLCardinality-14
ltl formula formula --ltl=/tmp/1904/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 258 places, 584 transitions and 2416 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1904/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1904/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1904/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1904/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-8"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-PT-8, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856418900443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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