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-167856418900444.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418900444
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-8-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679525449041

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=LTLFireability
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:50:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 22:50:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:50:50] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-22 22:50:50] [INFO ] Transformed 315 places.
[2023-03-22 22:50:50] [INFO ] Transformed 666 transitions.
[2023-03-22 22:50:50] [INFO ] Found NUPN structural information;
[2023-03-22 22:50:50] [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:50:50] [INFO ] Parsed PT model containing 315 places and 666 transitions and 2934 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 82 transitions.
FORMULA LamportFastMutEx-PT-8-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 186 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 19 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:50:51] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 22:50:51] [INFO ] Computed 82 place invariants in 11 ms
[2023-03-22 22:50:51] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-22 22:50:51] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:51] [INFO ] Invariant cache hit.
[2023-03-22 22:50:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 22:50:51] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2023-03-22 22:50:51] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:51] [INFO ] Invariant cache hit.
[2023-03-22 22:50:52] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 995 ms. Remains : 266/266 places, 584/584 transitions.
Support contains 186 out of 266 places after structural reductions.
[2023-03-22 22:50:52] [INFO ] Flatten gal took : 72 ms
[2023-03-22 22:50:52] [INFO ] Flatten gal took : 50 ms
[2023-03-22 22:50:52] [INFO ] Input system was already deterministic with 584 transitions.
Finished random walk after 1198 steps, including 0 resets, run visited all 28 properties in 101 ms. (steps per millisecond=11 )
FORMULA LamportFastMutEx-PT-8-LTLFireability-08 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 U p1)||G(F(p2))))))'
Support contains 26 out of 266 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 14 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:50:53] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:53] [INFO ] Invariant cache hit.
[2023-03-22 22:50:53] [INFO ] Implicit Places using invariants in 176 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 179 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 11 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 204 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s9 1) (EQ s80 1)) (AND (EQ s14 1) (EQ s81 1)) (AND (EQ s9 1) (EQ s78 1)) (AND (EQ s8 1) (EQ s76 1)) (AND (EQ s8 1) (EQ s78 1)) (AND (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6594 reset in 730 ms.
Product exploration explored 100000 steps with 6555 reset in 671 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 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-22 22:50:55] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 22:50:56] [INFO ] Computed 74 place invariants in 11 ms
[2023-03-22 22:50:56] [INFO ] [Real]Absence check using 74 positive place invariants in 32 ms returned sat
[2023-03-22 22:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:50:56] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-03-22 22:50:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:50:57] [INFO ] [Nat]Absence check using 74 positive place invariants in 28 ms returned sat
[2023-03-22 22:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:50:57] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-03-22 22:50:57] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:50:57] [INFO ] [Nat]Added 48 Read/Feed constraints in 15 ms returned sat
[2023-03-22 22:50:57] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 3 ms to minimize.
[2023-03-22 22:50:57] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-22 22:50:57] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-22 22:50:58] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2023-03-22 22:50:58] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2023-03-22 22:50:58] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-22 22:50:58] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2023-03-22 22:50:58] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-22 22:50:58] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-22 22:50:58] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2023-03-22 22:50:58] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2023-03-22 22:50:58] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2023-03-22 22:50:58] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1174 ms
[2023-03-22 22:50:58] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 31 ms.
[2023-03-22 22:50:59] [INFO ] Added : 162 causal constraints over 33 iterations in 1119 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 26 out of 258 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 258/258 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.
[2023-03-22 22:50:59] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:50:59] [INFO ] Invariant cache hit.
[2023-03-22 22:51:00] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-22 22:51:00] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:00] [INFO ] Invariant cache hit.
[2023-03-22 22:51:00] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:00] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-22 22:51:00] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:00] [INFO ] Invariant cache hit.
[2023-03-22 22:51:00] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 768 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) (NOT p2)), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-22 22:51:01] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:01] [INFO ] Invariant cache hit.
[2023-03-22 22:51:02] [INFO ] [Real]Absence check using 74 positive place invariants in 34 ms returned sat
[2023-03-22 22:51:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:51:02] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2023-03-22 22:51:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:51:03] [INFO ] [Nat]Absence check using 74 positive place invariants in 30 ms returned sat
[2023-03-22 22:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:51:03] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2023-03-22 22:51:03] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:03] [INFO ] [Nat]Added 48 Read/Feed constraints in 19 ms returned sat
[2023-03-22 22:51:03] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 0 ms to minimize.
[2023-03-22 22:51:03] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 1 ms to minimize.
[2023-03-22 22:51:03] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-03-22 22:51:03] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-22 22:51:03] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-22 22:51:03] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-22 22:51:04] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2023-03-22 22:51:04] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2023-03-22 22:51:04] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 0 ms to minimize.
[2023-03-22 22:51:04] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 1 ms to minimize.
[2023-03-22 22:51:04] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-03-22 22:51:04] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2023-03-22 22:51:04] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-22 22:51:04] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2023-03-22 22:51:04] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2023-03-22 22:51:04] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2023-03-22 22:51:05] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2023-03-22 22:51:05] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-22 22:51:05] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2023-03-22 22:51:05] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-22 22:51:05] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-22 22:51:05] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2035 ms
[2023-03-22 22:51:05] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 32 ms.
[2023-03-22 22:51:06] [INFO ] Added : 203 causal constraints over 41 iterations in 1551 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6634 reset in 623 ms.
Product exploration explored 100000 steps with 6583 reset in 613 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 26 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 258 transition count 584
Deduced a syphon composed of 8 places in 1 ms
Applied a total of 8 rules in 47 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:51:08] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-22 22:51:08] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 22:51:08] [INFO ] Computed 74 place invariants in 3 ms
[2023-03-22 22:51:09] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/258 places, 584/584 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 258/258 places, 584/584 transitions.
Support contains 26 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:51:09] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 22:51:09] [INFO ] Computed 74 place invariants in 7 ms
[2023-03-22 22:51:09] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-22 22:51:09] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:09] [INFO ] Invariant cache hit.
[2023-03-22 22:51:09] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:09] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-22 22:51:09] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:09] [INFO ] Invariant cache hit.
[2023-03-22 22:51:10] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 902 ms. Remains : 258/258 places, 584/584 transitions.
Treatment of property LamportFastMutEx-PT-8-LTLFireability-00 finished in 16978 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))))'
Support contains 16 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 4 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:51:10] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 22:51:10] [INFO ] Computed 82 place invariants in 2 ms
[2023-03-22 22:51:10] [INFO ] Implicit Places using invariants in 197 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 199 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 5 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 209 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (EQ s18 0) (EQ s226 0)) (OR (EQ s20 0) (EQ s228 0)) (OR (EQ s22 0) (EQ s230 0)) (OR (EQ s24 0) (EQ s232 0)) (OR (EQ s19 0) (EQ s227 0)) (OR (E...], 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, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 246 ms.
Product exploration explored 100000 steps with 33333 reset in 279 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-8-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-8-LTLFireability-01 finished in 902 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 G(p1)))'
Support contains 25 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
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 16 place count 258 transition count 576
Applied a total of 16 rules in 29 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 22:51:11] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 22:51:11] [INFO ] Computed 82 place invariants in 6 ms
[2023-03-22 22:51:11] [INFO ] Implicit Places using invariants in 202 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 205 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/266 places, 576/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 250 transition count 568
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 242 transition count 568
Applied a total of 16 rules in 20 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
[2023-03-22 22:51:11] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 22:51:11] [INFO ] Computed 74 place invariants in 5 ms
[2023-03-22 22:51:11] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-22 22:51:11] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:11] [INFO ] Invariant cache hit.
[2023-03-22 22:51:11] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:11] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/266 places, 568/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 867 ms. Remains : 242/266 places, 568/584 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s25 1) (EQ s230 1)) (AND (EQ s20 1) (EQ s227 1)) (AND (EQ s25 1) (EQ s232 1)) (AND (EQ s20 1) (EQ s229 1)) (AND (EQ s20 1) (EQ s231 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 30867 reset in 1208 ms.
Product exploration explored 100000 steps with 30888 reset in 1193 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 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 402 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:51:15] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:15] [INFO ] Invariant cache hit.
[2023-03-22 22:51:15] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 22:51:15] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:51:15] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 22:51:15] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:51:15] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:16] [INFO ] After 205ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:51:16] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-22 22:51:16] [INFO ] After 990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 242/242 places, 568/568 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 784503 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 784503 steps, saw 392658 distinct states, run finished after 3002 ms. (steps per millisecond=261 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:51:19] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:19] [INFO ] Invariant cache hit.
[2023-03-22 22:51:19] [INFO ] [Real]Absence check using 74 positive place invariants in 17 ms returned sat
[2023-03-22 22:51:20] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:51:20] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 22:51:20] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:51:20] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:20] [INFO ] After 209ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:51:20] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-22 22:51:21] [INFO ] After 1012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 20 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 22:51:21] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:21] [INFO ] Invariant cache hit.
[2023-03-22 22:51:21] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-22 22:51:21] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:21] [INFO ] Invariant cache hit.
[2023-03-22 22:51:21] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:21] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2023-03-22 22:51:21] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-22 22:51:21] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:21] [INFO ] Invariant cache hit.
[2023-03-22 22:51:22] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 915 ms. Remains : 242/242 places, 568/568 transitions.
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 242 transition count 400
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 168 place count 242 transition count 336
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 352 place count 122 transition count 336
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 1 with 16 rules applied. Total rules applied 368 place count 114 transition count 328
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 376 place count 106 transition count 312
Iterating global reduction 1 with 8 rules applied. Total rules applied 384 place count 106 transition count 312
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 392 place count 106 transition count 304
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 400 place count 98 transition count 304
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 408 place count 98 transition count 296
Applied a total of 408 rules in 28 ms. Remains 98 /242 variables (removed 144) and now considering 296/568 (removed 272) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 98 cols
[2023-03-22 22:51:22] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-22 22:51:22] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-22 22:51:22] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:51:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-22 22:51:22] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:51:22] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-22 22:51:22] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 495 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), p0, (AND p0 p1)]
[2023-03-22 22:51:23] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 22:51:23] [INFO ] Computed 74 place invariants in 6 ms
[2023-03-22 22:51:24] [INFO ] [Real]Absence check using 74 positive place invariants in 28 ms returned sat
[2023-03-22 22:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:51:24] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-22 22:51:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:51:24] [INFO ] [Nat]Absence check using 74 positive place invariants in 28 ms returned sat
[2023-03-22 22:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:51:24] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-22 22:51:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:24] [INFO ] [Nat]Added 48 Read/Feed constraints in 15 ms returned sat
[2023-03-22 22:51:25] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-22 22:51:25] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2023-03-22 22:51:25] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2023-03-22 22:51:25] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 0 ms to minimize.
[2023-03-22 22:51:25] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2023-03-22 22:51:25] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-22 22:51:25] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 22:51:25] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2023-03-22 22:51:25] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-22 22:51:25] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-22 22:51:26] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2023-03-22 22:51:26] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2023-03-22 22:51:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1126 ms
[2023-03-22 22:51:26] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 35 ms.
[2023-03-22 22:51:27] [INFO ] Added : 148 causal constraints over 30 iterations in 1027 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 25 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 19 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 22:51:27] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:27] [INFO ] Invariant cache hit.
[2023-03-22 22:51:27] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-22 22:51:27] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:27] [INFO ] Invariant cache hit.
[2023-03-22 22:51:27] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:27] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-22 22:51:27] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 22:51:27] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:27] [INFO ] Invariant cache hit.
[2023-03-22 22:51:27] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 859 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 : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 381 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:51:28] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:28] [INFO ] Invariant cache hit.
[2023-03-22 22:51:28] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 22:51:29] [INFO ] After 408ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:51:29] [INFO ] [Nat]Absence check using 74 positive place invariants in 20 ms returned sat
[2023-03-22 22:51:29] [INFO ] After 357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:51:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:29] [INFO ] After 205ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:51:29] [INFO ] After 403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-22 22:51:30] [INFO ] After 1084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 242/242 places, 568/568 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 851240 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :{}
Probabilistic random walk after 851240 steps, saw 422221 distinct states, run finished after 3001 ms. (steps per millisecond=283 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 22:51:33] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:33] [INFO ] Invariant cache hit.
[2023-03-22 22:51:33] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 22:51:33] [INFO ] After 394ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:51:33] [INFO ] [Nat]Absence check using 74 positive place invariants in 14 ms returned sat
[2023-03-22 22:51:34] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:51:34] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:34] [INFO ] After 203ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 22:51:34] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-22 22:51:34] [INFO ] After 981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 25 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY 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:51:34] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:34] [INFO ] Invariant cache hit.
[2023-03-22 22:51:34] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-22 22:51:34] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:34] [INFO ] Invariant cache hit.
[2023-03-22 22:51:35] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:35] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2023-03-22 22:51:35] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 22:51:35] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:35] [INFO ] Invariant cache hit.
[2023-03-22 22:51:35] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 867 ms. Remains : 242/242 places, 568/568 transitions.
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 242 transition count 400
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 168 place count 242 transition count 336
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 56 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 1 with 184 rules applied. Total rules applied 352 place count 122 transition count 336
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 1 with 16 rules applied. Total rules applied 368 place count 114 transition count 328
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 376 place count 106 transition count 312
Iterating global reduction 1 with 8 rules applied. Total rules applied 384 place count 106 transition count 312
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 392 place count 106 transition count 304
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 400 place count 98 transition count 304
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 408 place count 98 transition count 296
Applied a total of 408 rules in 28 ms. Remains 98 /242 variables (removed 144) and now considering 296/568 (removed 272) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 296 rows 98 cols
[2023-03-22 22:51:35] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-22 22:51:35] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-22 22:51:35] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 22:51:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-22 22:51:35] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 22:51:36] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-22 22:51:36] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 467 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), p0, (AND p0 p1)]
[2023-03-22 22:51:37] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 22:51:37] [INFO ] Computed 74 place invariants in 13 ms
[2023-03-22 22:51:37] [INFO ] [Real]Absence check using 74 positive place invariants in 28 ms returned sat
[2023-03-22 22:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:51:37] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2023-03-22 22:51:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:51:38] [INFO ] [Nat]Absence check using 74 positive place invariants in 27 ms returned sat
[2023-03-22 22:51:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:51:38] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-22 22:51:38] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:38] [INFO ] [Nat]Added 48 Read/Feed constraints in 15 ms returned sat
[2023-03-22 22:51:38] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 22:51:38] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-22 22:51:38] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2023-03-22 22:51:38] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2023-03-22 22:51:38] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2023-03-22 22:51:38] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2023-03-22 22:51:39] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-22 22:51:39] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 0 ms to minimize.
[2023-03-22 22:51:39] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-22 22:51:39] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-22 22:51:39] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2023-03-22 22:51:39] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2023-03-22 22:51:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1149 ms
[2023-03-22 22:51:39] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 26 ms.
[2023-03-22 22:51:40] [INFO ] Added : 148 causal constraints over 30 iterations in 918 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), p0, (AND p0 p1)]
Product exploration explored 100000 steps with 31045 reset in 997 ms.
Product exploration explored 100000 steps with 31056 reset in 978 ms.
Support contains 25 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 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 22:51:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:42] [INFO ] Invariant cache hit.
[2023-03-22 22:51:42] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-22 22:51:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:42] [INFO ] Invariant cache hit.
[2023-03-22 22:51:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:51:43] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2023-03-22 22:51:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 22:51:43] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:51:43] [INFO ] Invariant cache hit.
[2023-03-22 22:51:43] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 843 ms. Remains : 242/242 places, 568/568 transitions.
Treatment of property LamportFastMutEx-PT-8-LTLFireability-02 finished in 32475 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((X((p1&&G((F(p2) U p3))))||p0))))'
Support contains 130 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 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:51:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 22:51:43] [INFO ] Computed 82 place invariants in 3 ms
[2023-03-22 22:51:43] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-22 22:51:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:43] [INFO ] Invariant cache hit.
[2023-03-22 22:51:43] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 22:51:43] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2023-03-22 22:51:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:44] [INFO ] Invariant cache hit.
[2023-03-22 22:51:44] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 735 ms. Remains : 266/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={1} source=2 dest: 5}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(NOT p2), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (EQ s32 1) (EQ s85 1)) (AND (EQ s37 1) (EQ s87 1)) (AND (EQ s27 1) (EQ s82 1)) (AND (EQ s34 1) (EQ s86 1)) (AND (EQ s29 1) (EQ s83 1)) (AND (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 706 reset in 1147 ms.
Stack based approach found an accepted trace after 3403 steps with 22 reset with depth 92 and stack size 92 in 39 ms.
FORMULA LamportFastMutEx-PT-8-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-8-LTLFireability-03 finished in 2317 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((X(p1)&&p0)))))'
Support contains 96 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 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:51:45] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:45] [INFO ] Invariant cache hit.
[2023-03-22 22:51:45] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-22 22:51:45] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:45] [INFO ] Invariant cache hit.
[2023-03-22 22:51:46] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 22:51:46] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2023-03-22 22:51:46] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:46] [INFO ] Invariant cache hit.
[2023-03-22 22:51:46] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 801 ms. Remains : 266/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (OR (NEQ s32 1) (NEQ s125 1) (NEQ s165 1)) (OR (NEQ s30 1) (NEQ s156 1) (NEQ s169 1)) (OR (NEQ s26 1) (NEQ s122 1) (NEQ s165 1)) (OR (NEQ s38 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 26 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-PT-8-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLFireability-04 finished in 1006 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(p0) U ((p1 U G(p2))&&X(X(p3)))))'
Support contains 57 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 4 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:51:46] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:51:46] [INFO ] Invariant cache hit.
[2023-03-22 22:51:47] [INFO ] Implicit Places using invariants in 181 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 182 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 2 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 190 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 923 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(OR p2 p1), acceptance={0} source=0 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 8}, { cond=(AND p2 p1), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 9}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=4 dest: 10}, { cond=(OR p2 p1), acceptance={0} source=4 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 12}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p2 p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 14}, { cond=(AND p2 p1), acceptance={} source=6 dest: 15}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=8 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=8 dest: 2}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3))), acceptance={} source=8 dest: 3}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=8 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=9 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=9 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 6}], [{ cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3))), acceptance={} source=10 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=11 dest: 8}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=11 dest: 9}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3))), acceptance={} source=11 dest: 10}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=11 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 12}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=11 dest: 13}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=12 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=12 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=13 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=13 dest: 1}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=13 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=13 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=13 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=13 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=13 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=13 dest: 6}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=13 dest: 14}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=14 dest: 7}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=14 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=15 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=15 dest: 8}, { cond=(AND p2 p1), acceptance={} source=15 dest: 9}, { cond=(AND (NOT p2) p1), acceptance={0} source=15 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=15 dest: 10}, { cond=(AND (NOT p2) p1), acceptance={0} source=15 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=15 dest: 12}, { cond=(AND p2 (NOT p1)), acceptance={} source=15 dest: 13}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=15 dest: 16}, { cond=(AND p2 p1), acceptance={} source=15 dest: 17}], [{ cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=16 dest: 7}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=16 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=17 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=17 dest: 8}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=17 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=17 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=17 dest: 10}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=17 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=17 dest: 12}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=17 dest: 13}, { cond=(AND p2 p1 (NOT p0) (NOT p3)), acceptance={} source=17 dest: 16}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=17 dest: 17}]], initial=0, aps=[p2:(OR (AND (EQ s18 1) (EQ s73 1)) (AND (EQ s18 1) (EQ s71 1)) (AND (EQ s17 1) (EQ s67 1)) (AND (EQ s23 1) (EQ s66 1)) (AND (EQ s17 1) (EQ s69 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11219 reset in 1141 ms.
Product exploration explored 100000 steps with 11255 reset in 1161 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 (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (OR p2 p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))))]
Knowledge based reduction with 34 factoid took 4473 ms. Reduced automaton from 18 states, 96 edges and 4 AP (stutter sensitive) to 18 states, 96 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1018 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) p1), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) p1), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 26) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 22:51:56] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 22:51:56] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-22 22:51:56] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (NOT (OR p2 p1))), (X (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 p1)))), (G (NOT (AND (NOT p0) (NOT p3) p1 p2))), (G (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p3) p1 p2)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) (NOT p3) p2)), (F (OR p1 p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p1 p2)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (F (AND (NOT p3) (NOT p1) p2)), (F (AND (NOT p0) (NOT p3) (NOT p1) p2)), (F p0), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (AND (NOT p0) p1 p2)), (F (OR (AND (NOT p3) p1) (AND (NOT p3) p2))), (F (OR (AND (NOT p0) (NOT p3) p1) (AND (NOT p0) (NOT p3) p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 38 factoid took 5437 ms. Reduced automaton from 18 states, 96 edges and 4 AP (stutter sensitive) to 14 states, 58 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 677 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 694 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
[2023-03-22 22:52:03] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:03] [INFO ] Invariant cache hit.
[2023-03-22 22:52:04] [INFO ] [Real]Absence check using 74 positive place invariants in 33 ms returned sat
[2023-03-22 22:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:04] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-22 22:52:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:52:04] [INFO ] [Nat]Absence check using 74 positive place invariants in 22 ms returned sat
[2023-03-22 22:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:04] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-22 22:52:04] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:04] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2023-03-22 22:52:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-22 22:52:05] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 22:52:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-22 22:52:05] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 26 ms.
[2023-03-22 22:52:05] [INFO ] Added : 140 causal constraints over 29 iterations in 873 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-22 22:52:05] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:05] [INFO ] Invariant cache hit.
[2023-03-22 22:52:06] [INFO ] [Real]Absence check using 74 positive place invariants in 34 ms returned sat
[2023-03-22 22:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:06] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-22 22:52:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:52:06] [INFO ] [Nat]Absence check using 74 positive place invariants in 25 ms returned sat
[2023-03-22 22:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:07] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-22 22:52:07] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:07] [INFO ] [Nat]Added 48 Read/Feed constraints in 13 ms returned sat
[2023-03-22 22:52:07] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 3 ms to minimize.
[2023-03-22 22:52:07] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-22 22:52:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-22 22:52:07] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 36 ms.
[2023-03-22 22:52:07] [INFO ] Added : 109 causal constraints over 22 iterations in 671 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 57 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:52:07] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:07] [INFO ] Invariant cache hit.
[2023-03-22 22:52:07] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-22 22:52:07] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:07] [INFO ] Invariant cache hit.
[2023-03-22 22:52:08] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:08] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-22 22:52:08] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:08] [INFO ] Invariant cache hit.
[2023-03-22 22:52:08] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 710 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) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (OR (AND p1 p3) p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (OR (AND p1 p3) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0)))))), (X (X (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))))]
Knowledge based reduction with 29 factoid took 5901 ms. Reduced automaton from 14 states, 58 edges and 4 AP (stutter sensitive) to 14 states, 58 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 699 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
Finished random walk after 66 steps, including 0 resets, run visited all 19 properties in 7 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (OR (AND p1 p3) p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (OR (AND p1 p3) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p3 (NOT p0)))))), (X (X (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (F (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) p2)), (F p2), (F (NOT (AND (NOT p3) (NOT p2)))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (OR (AND p3 p1) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p3) p2)), (F (AND (NOT p0) (NOT p3) p2)), (F (AND p1 p2)), (F (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 29 factoid took 6484 ms. Reduced automaton from 14 states, 58 edges and 4 AP (stutter sensitive) to 14 states, 58 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 683 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 711 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
[2023-03-22 22:52:23] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:23] [INFO ] Invariant cache hit.
[2023-03-22 22:52:23] [INFO ] [Real]Absence check using 74 positive place invariants in 32 ms returned sat
[2023-03-22 22:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:23] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2023-03-22 22:52:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:52:24] [INFO ] [Nat]Absence check using 74 positive place invariants in 23 ms returned sat
[2023-03-22 22:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:24] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-22 22:52:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:24] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2023-03-22 22:52:24] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-22 22:52:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 6 ms to minimize.
[2023-03-22 22:52:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-22 22:52:24] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 27 ms.
[2023-03-22 22:52:25] [INFO ] Added : 140 causal constraints over 29 iterations in 891 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-22 22:52:25] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:25] [INFO ] Invariant cache hit.
[2023-03-22 22:52:25] [INFO ] [Real]Absence check using 74 positive place invariants in 33 ms returned sat
[2023-03-22 22:52:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:25] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2023-03-22 22:52:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:52:26] [INFO ] [Nat]Absence check using 74 positive place invariants in 25 ms returned sat
[2023-03-22 22:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:26] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-22 22:52:26] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:26] [INFO ] [Nat]Added 48 Read/Feed constraints in 16 ms returned sat
[2023-03-22 22:52:26] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-22 22:52:26] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 22:52:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2023-03-22 22:52:26] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 30 ms.
[2023-03-22 22:52:27] [INFO ] Added : 109 causal constraints over 22 iterations in 626 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 645 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 11026 reset in 1123 ms.
Product exploration explored 100000 steps with 10875 reset in 1130 ms.
Applying partial POR strategy [false, true, false, false, false, false, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 639 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3) p2), (NOT p3), false, (AND (NOT p2) (NOT p3))]
Support contains 57 out of 258 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 21 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:52:30] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 22:52:30] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:30] [INFO ] Invariant cache hit.
[2023-03-22 22:52:31] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 258/258 places, 584/584 transitions.
Support contains 57 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 1 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:52:31] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:31] [INFO ] Invariant cache hit.
[2023-03-22 22:52:31] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-22 22:52:31] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:31] [INFO ] Invariant cache hit.
[2023-03-22 22:52:31] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:31] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-22 22:52:31] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:31] [INFO ] Invariant cache hit.
[2023-03-22 22:52:31] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 707 ms. Remains : 258/258 places, 584/584 transitions.
Treatment of property LamportFastMutEx-PT-8-LTLFireability-06 finished in 45145 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' '!((!(p0 U p1) U X(X(!F(X(((p1 U p0)&&p2)))))))'
Support contains 48 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 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:52:31] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 22:52:31] [INFO ] Computed 82 place invariants in 3 ms
[2023-03-22 22:52:32] [INFO ] Implicit Places using invariants in 189 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 190 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 2 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 195 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 342 ms :[(AND p0 p2), (AND p1 p0 p2), (AND p0 p2), (AND p0 p2), true, (AND p0 (NOT p2)), (AND p0 p2 p1), (AND p0 p2), (AND p0 p2 p1), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=p1, acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 p1 p2), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 9}], [{ cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=9 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 9}]], initial=7, aps=[p1:(OR (AND (EQ s15 1) (EQ s80 1)) (AND (EQ s16 1) (EQ s81 1)) (AND (EQ s9 1) (EQ s74 1)) (AND (EQ s10 1) (EQ s75 1)) (AND (EQ s11 1) (EQ s76 1)) (AND (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 369 steps with 3 reset in 5 ms.
FORMULA LamportFastMutEx-PT-8-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLFireability-07 finished in 570 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(F(p0)))'
Support contains 2 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 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:52:32] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:32] [INFO ] Invariant cache hit.
[2023-03-22 22:52:32] [INFO ] Implicit Places using invariants in 188 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 190 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 2 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 194 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-09 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 (EQ s23 0) (EQ s231 0))], 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 271 ms.
Product exploration explored 100000 steps with 50000 reset in 276 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 51 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-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-8-LTLFireability-09 finished in 875 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))))'
Support contains 3 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 4 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:52:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:33] [INFO ] Invariant cache hit.
[2023-03-22 22:52:33] [INFO ] Implicit Places using invariants in 187 ms returned [162, 163, 164, 165, 166, 168, 169]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 188 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/266 places, 584/584 transitions.
Applied a total of 0 rules in 2 ms. Remains 259 /259 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 195 ms. Remains : 259/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s38 1) (NEQ s144 1) (NEQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 544 steps with 0 reset in 3 ms.
FORMULA LamportFastMutEx-PT-8-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLFireability-10 finished in 323 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 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 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:52:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:33] [INFO ] Invariant cache hit.
[2023-03-22 22:52:33] [INFO ] Implicit Places using invariants in 188 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 189 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 2 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 194 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-11 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:(OR (EQ s16 0) (EQ s81 0)), p1:(AND (EQ s31 1) (EQ s84 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 593 steps with 0 reset in 3 ms.
FORMULA LamportFastMutEx-PT-8-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLFireability-11 finished in 322 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)) U p1))'
Support contains 4 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 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:52:34] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:34] [INFO ] Invariant cache hit.
[2023-03-22 22:52:34] [INFO ] Implicit Places using invariants in 188 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 189 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 2 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 194 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-12 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=(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 s10 1) (EQ s75 1)), p1:(AND (EQ s17 1) (EQ s64 1))], 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, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-8-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLFireability-12 finished in 334 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))))'
Support contains 2 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 3 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:52:34] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:34] [INFO ] Invariant cache hit.
[2023-03-22 22:52:34] [INFO ] Implicit Places using invariants in 195 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 196 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 2 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 201 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s15 1) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-8-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-8-LTLFireability-13 finished in 331 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((X(p0)||F(p1))))'
Support contains 4 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 2 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 22:52:34] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 22:52:34] [INFO ] Invariant cache hit.
[2023-03-22 22:52:34] [INFO ] Implicit Places using invariants in 226 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 229 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 2 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 234 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s74 1)), p0:(OR (EQ s11 0) (EQ s76 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 31795 reset in 264 ms.
Stack based approach found an accepted trace after 2502 steps with 363 reset with depth 1432 and stack size 1432 in 7 ms.
FORMULA LamportFastMutEx-PT-8-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-8-LTLFireability-14 finished in 626 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(p0))'
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
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 16 place count 258 transition count 576
Applied a total of 16 rules in 16 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 22:52:35] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 22:52:35] [INFO ] Computed 82 place invariants in 3 ms
[2023-03-22 22:52:35] [INFO ] Implicit Places using invariants in 199 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 200 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/266 places, 576/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 250 transition count 568
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 242 transition count 568
Applied a total of 16 rules in 10 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
[2023-03-22 22:52:35] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 22:52:35] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 22:52:35] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-22 22:52:35] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:35] [INFO ] Invariant cache hit.
[2023-03-22 22:52:35] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:36] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/266 places, 568/584 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 861 ms. Remains : 242/266 places, 568/584 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s17 1) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1457 reset in 259 ms.
Stack based approach found an accepted trace after 3226 steps with 45 reset with depth 105 and stack size 105 in 9 ms.
FORMULA LamportFastMutEx-PT-8-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-PT-8-LTLFireability-15 finished in 1183 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(F(((p0 U p1)||G(F(p2))))))'
Found a Shortening insensitive property : LamportFastMutEx-PT-8-LTLFireability-00
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 26 out of 266 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
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 16 place count 258 transition count 576
Applied a total of 16 rules in 12 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 22:52:36] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 22:52:36] [INFO ] Computed 82 place invariants in 2 ms
[2023-03-22 22:52:36] [INFO ] Implicit Places using invariants in 176 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 188 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 250/266 places, 576/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 250 transition count 568
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 242 transition count 568
Applied a total of 16 rules in 7 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
[2023-03-22 22:52:36] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 22:52:36] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 22:52:37] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-22 22:52:37] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:37] [INFO ] Invariant cache hit.
[2023-03-22 22:52:37] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:37] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 242/266 places, 568/584 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 729 ms. Remains : 242/266 places, 568/584 transitions.
Running random walk in product with property : LamportFastMutEx-PT-8-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s9 1) (EQ s80 1)) (AND (EQ s14 1) (EQ s81 1)) (AND (EQ s9 1) (EQ s78 1)) (AND (EQ s8 1) (EQ s76 1)) (AND (EQ s8 1) (EQ s78 1)) (AND (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6558 reset in 600 ms.
Product exploration explored 100000 steps with 6600 reset in 611 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 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-22 22:52:39] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:39] [INFO ] Invariant cache hit.
[2023-03-22 22:52:39] [INFO ] [Real]Absence check using 74 positive place invariants in 31 ms returned sat
[2023-03-22 22:52:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:40] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2023-03-22 22:52:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:52:40] [INFO ] [Nat]Absence check using 74 positive place invariants in 27 ms returned sat
[2023-03-22 22:52:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:40] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2023-03-22 22:52:40] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:41] [INFO ] [Nat]Added 48 Read/Feed constraints in 22 ms returned sat
[2023-03-22 22:52:41] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-22 22:52:41] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2023-03-22 22:52:41] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 22:52:41] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 22:52:41] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2023-03-22 22:52:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 431 ms
[2023-03-22 22:52:41] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 23 ms.
[2023-03-22 22:52:42] [INFO ] Added : 156 causal constraints over 32 iterations in 1006 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 26 out of 242 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 6 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 22:52:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:42] [INFO ] Invariant cache hit.
[2023-03-22 22:52:42] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-22 22:52:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:42] [INFO ] Invariant cache hit.
[2023-03-22 22:52:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:42] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-03-22 22:52:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:42] [INFO ] Invariant cache hit.
[2023-03-22 22:52:43] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 755 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 : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-22 22:52:43] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:44] [INFO ] Invariant cache hit.
[2023-03-22 22:52:44] [INFO ] [Real]Absence check using 74 positive place invariants in 30 ms returned sat
[2023-03-22 22:52:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:44] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2023-03-22 22:52:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 22:52:45] [INFO ] [Nat]Absence check using 74 positive place invariants in 26 ms returned sat
[2023-03-22 22:52:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 22:52:45] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2023-03-22 22:52:45] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:45] [INFO ] [Nat]Added 48 Read/Feed constraints in 16 ms returned sat
[2023-03-22 22:52:45] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-22 22:52:45] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2023-03-22 22:52:45] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-22 22:52:45] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-22 22:52:46] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2023-03-22 22:52:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 442 ms
[2023-03-22 22:52:46] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 25 ms.
[2023-03-22 22:52:47] [INFO ] Added : 156 causal constraints over 32 iterations in 1000 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6549 reset in 615 ms.
Product exploration explored 100000 steps with 6579 reset in 619 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 26 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 15 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 22:52:48] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 22:52:48] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:48] [INFO ] Invariant cache hit.
[2023-03-22 22:52:48] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 242/242 places, 568/568 transitions.
Support contains 26 out of 242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 22:52:48] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:48] [INFO ] Invariant cache hit.
[2023-03-22 22:52:49] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-22 22:52:49] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:49] [INFO ] Invariant cache hit.
[2023-03-22 22:52:49] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 22:52:49] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-22 22:52:49] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 22:52:49] [INFO ] Invariant cache hit.
[2023-03-22 22:52:49] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 815 ms. Remains : 242/242 places, 568/568 transitions.
Treatment of property LamportFastMutEx-PT-8-LTLFireability-00 finished in 13166 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 G(p1)))'
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(p0) U ((p1 U G(p2))&&X(X(p3)))))'
[2023-03-22 22:52:49] [INFO ] Flatten gal took : 38 ms
[2023-03-22 22:52:49] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2023-03-22 22:52:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 584 transitions and 2560 arcs took 3 ms.
Total runtime 119419 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2998/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 6733840 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16120756 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2998/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 6391544 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16072936 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2998/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6674828 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16065636 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023

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="LTLFireability"
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 LTLFireability"
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-167856418900444"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;