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.r231-tall-167856416000387.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 lolaxred
Input is LamportFastMutEx-COL-8, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416000387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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 3.7K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 44K 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-COL-8-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-8-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679449545671

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 01:45:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 01:45:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:45:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 01:45:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 01:45:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 452 ms
[2023-03-22 01:45:47] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 01:45:47] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 01:45:47] [INFO ] Skeletonized 16 HLPN properties in 9 ms.
Initial state reduction rules removed 2 formulas.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 426 steps, including 0 resets, run visited all 27 properties in 24 ms. (steps per millisecond=17 )
[2023-03-22 01:45:48] [INFO ] Flatten gal took : 15 ms
[2023-03-22 01:45:48] [INFO ] Flatten gal took : 2 ms
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 01:45:48] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 25 ms.
[2023-03-22 01:45:48] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Deduced a syphon composed of 49 places in 4 ms
Reduce places removed 49 places and 82 transitions.
Support contains 232 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 20 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:45:48] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:45:48] [INFO ] Computed 82 place invariants in 24 ms
[2023-03-22 01:45:48] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-22 01:45:48] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:45:48] [INFO ] Invariant cache hit.
[2023-03-22 01:45:48] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:45:48] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-22 01:45:48] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:45:48] [INFO ] Invariant cache hit.
[2023-03-22 01:45:49] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 837 ms. Remains : 266/266 places, 584/584 transitions.
Support contains 232 out of 266 places after structural reductions.
[2023-03-22 01:45:49] [INFO ] Flatten gal took : 57 ms
[2023-03-22 01:45:49] [INFO ] Flatten gal took : 36 ms
[2023-03-22 01:45:49] [INFO ] Input system was already deterministic with 584 transitions.
Finished random walk after 1757 steps, including 0 resets, run visited all 25 properties in 35 ms. (steps per millisecond=50 )
FORMULA LamportFastMutEx-COL-8-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 8 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 72 out of 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 13 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:45:49] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:45:49] [INFO ] Invariant cache hit.
[2023-03-22 01:45:49] [INFO ] Implicit Places using invariants in 166 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 169 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 9 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 191 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT 1 (ADD s50 s51 s52 s53 s54 s55 s56 s57)) (LEQ 1 (ADD s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 382 ms.
Product exploration explored 100000 steps with 50000 reset in 333 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 66 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-COL-8-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-01 finished in 1211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Support contains 88 out of 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 01:45:50] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:45:50] [INFO ] Invariant cache hit.
[2023-03-22 01:45:50] [INFO ] Implicit Places using invariants in 151 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 153 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 4 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 161 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s66 s67 s68 s69 s70 s71 s72 s73) (ADD s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1661 reset in 529 ms.
Product exploration explored 100000 steps with 1671 reset in 535 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-22 01:45:52] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 01:45:52] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-22 01:45:53] [INFO ] [Real]Absence check using 74 positive place invariants in 33 ms returned sat
[2023-03-22 01:45:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:45:53] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-22 01:45:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:45:53] [INFO ] [Nat]Absence check using 74 positive place invariants in 29 ms returned sat
[2023-03-22 01:45:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:45:54] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2023-03-22 01:45:54] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:45:54] [INFO ] [Nat]Added 48 Read/Feed constraints in 20 ms returned sat
[2023-03-22 01:45:54] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 4 ms to minimize.
[2023-03-22 01:45:54] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-03-22 01:45:54] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2023-03-22 01:45:54] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:45:54] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2023-03-22 01:45:54] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:45:54] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:45:54] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-22 01:45:54] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 0 ms to minimize.
[2023-03-22 01:45:54] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-03-22 01:45:55] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2023-03-22 01:45:55] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-22 01:45:55] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 01:45:55] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 01:45:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-22 01:45:55] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1281 ms
[2023-03-22 01:45:55] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 36 ms.
[2023-03-22 01:45:56] [INFO ] Added : 168 causal constraints over 35 iterations in 1174 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 88 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:45:56] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:45:56] [INFO ] Invariant cache hit.
[2023-03-22 01:45:56] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-22 01:45:56] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:45:56] [INFO ] Invariant cache hit.
[2023-03-22 01:45:56] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:45:56] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-22 01:45:56] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:45:56] [INFO ] Invariant cache hit.
[2023-03-22 01:45:57] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 258/258 places, 584/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-22 01:45:57] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:45:57] [INFO ] Invariant cache hit.
[2023-03-22 01:45:58] [INFO ] [Real]Absence check using 74 positive place invariants in 24 ms returned sat
[2023-03-22 01:45:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:45:58] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2023-03-22 01:45:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:45:58] [INFO ] [Nat]Absence check using 74 positive place invariants in 34 ms returned sat
[2023-03-22 01:45:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:45:58] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-22 01:45:58] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:45:58] [INFO ] [Nat]Added 48 Read/Feed constraints in 21 ms returned sat
[2023-03-22 01:45:58] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 01:45:58] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 01:45:58] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 01:45:59] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2023-03-22 01:45:59] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-22 01:45:59] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-22 01:45:59] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:45:59] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-22 01:45:59] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2023-03-22 01:45:59] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-22 01:45:59] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:45:59] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2023-03-22 01:45:59] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 996 ms
[2023-03-22 01:45:59] [INFO ] Computed and/alt/rep : 240/1056/240 causal constraints (skipped 168 transitions) in 28 ms.
[2023-03-22 01:46:00] [INFO ] Added : 162 causal constraints over 34 iterations in 992 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1670 reset in 471 ms.
Product exploration explored 100000 steps with 1668 reset in 489 ms.
Support contains 88 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 5 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:01] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:01] [INFO ] Invariant cache hit.
[2023-03-22 01:46:02] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-22 01:46:02] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:02] [INFO ] Invariant cache hit.
[2023-03-22 01:46:02] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:46:02] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-22 01:46:02] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:02] [INFO ] Invariant cache hit.
[2023-03-22 01:46:02] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 629 ms. Remains : 258/258 places, 584/584 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-02 finished in 11909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p0 U G(!p0)))))'
Support contains 8 out of 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 01:46:02] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:46:02] [INFO ] Computed 82 place invariants in 2 ms
[2023-03-22 01:46:02] [INFO ] Implicit Places using invariants in 300 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 302 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 3 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 310 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 133 ms :[p0, p0, true, true, true]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 1 (ADD s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 82 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-03 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&G(p1))))))'
Support contains 24 out of 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 6 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:03] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:03] [INFO ] Invariant cache hit.
[2023-03-22 01:46:03] [INFO ] Implicit Places using invariants in 166 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 167 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 3 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 178 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, p0, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LEQ 3 (ADD s234 s235 s236 s237 s238 s239 s240 s241)) (LEQ 2 (ADD s50 s51 s52 s53 s54 s55 s56 s57))), p1:(GT 1 (ADD s90 s91 s92 s93 s94 s95 s96 s97...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-04 finished in 333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||(X(!p0) U p1)||X(p1))))'
Support contains 24 out of 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 5 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:03] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:03] [INFO ] Invariant cache hit.
[2023-03-22 01:46:03] [INFO ] Implicit Places using invariants in 166 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 167 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 176 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s50 s51 s52 s53 s54 s55 s56 s57) (ADD s0 s1 s2 s3 s4 s5 s6 s7)), p0:(GT 1 (ADD s66 s67 s68 s69 s70 s71 s72 s73))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Stack based approach found an accepted trace after 398 steps with 1 reset with depth 371 and stack size 371 in 2 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-05 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!((p0 U p1) U X(X(p0))))))'
Support contains 16 out of 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 01:46:04] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:04] [INFO ] Invariant cache hit.
[2023-03-22 01:46:04] [INFO ] Implicit Places using invariants in 173 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 174 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 180 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 323 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0, 1} source=2 dest: 4}, { cond=p1, acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 2}], [{ cond=p0, acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 1}, { cond=p0, acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=6 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 5}]], initial=0, aps=[p1:(LEQ (ADD s50 s51 s52 s53 s54 s55 s56 s57) (ADD s58 s59 s60 s61 s62 s63 s64 s65)), p0:(LEQ 3 (ADD s50 s51 s52 s53 s54 s55 s56 s57))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22278 reset in 278 ms.
Product exploration explored 100000 steps with 22324 reset in 286 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 427 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1308 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Finished random walk after 757 steps, including 0 resets, run visited all 5 properties in 8 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 568 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Stuttering acceptance computed with spot in 292 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Support contains 16 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 3 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:08] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 258 cols
[2023-03-22 01:46:08] [INFO ] Computed 74 place invariants in 8 ms
[2023-03-22 01:46:08] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-22 01:46:08] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:08] [INFO ] Invariant cache hit.
[2023-03-22 01:46:08] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:46:08] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-22 01:46:08] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:08] [INFO ] Invariant cache hit.
[2023-03-22 01:46:08] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 ms. Remains : 258/258 places, 584/584 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 409 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Finished random walk after 2718 steps, including 0 resets, run visited all 5 properties in 14 ms. (steps per millisecond=194 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 3117 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter sensitive) to 8 states, 23 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Stuttering acceptance computed with spot in 306 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Stuttering acceptance computed with spot in 285 ms :[p0, p0, p0, false, p0, p0, (AND p1 p0), false]
Product exploration explored 100000 steps with 22130 reset in 288 ms.
Product exploration explored 100000 steps with 22207 reset in 285 ms.
Support contains 16 out of 258 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 258/258 places, 584/584 transitions.
Applied a total of 0 rules in 6 ms. Remains 258 /258 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:14] [INFO ] Invariant cache hit.
[2023-03-22 01:46:14] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-22 01:46:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:14] [INFO ] Invariant cache hit.
[2023-03-22 01:46:14] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:46:14] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-22 01:46:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:14] [INFO ] Invariant cache hit.
[2023-03-22 01:46:14] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 258/258 places, 584/584 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-06 finished in 10854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||F(p1))))))'
Support contains 80 out of 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 1 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:46:14] [INFO ] Computed 82 place invariants in 2 ms
[2023-03-22 01:46:15] [INFO ] Implicit Places using invariants in 159 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 160 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 164 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s82 s83 s84 s85 s86 s87 s88 s89) (ADD s50 s51 s52 s53 s54 s55 s56 s57)), p1:(AND (GT (ADD s82 s83 s84 s85 s86 s87 s88 s89) (ADD s50 s51 s52 s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2529 reset in 259 ms.
Stack based approach found an accepted trace after 80228 steps with 2059 reset with depth 154 and stack size 154 in 229 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-07 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 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 42 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 01:46:15] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 01:46:15] [INFO ] Computed 82 place invariants in 2 ms
[2023-03-22 01:46:15] [INFO ] Implicit Places using invariants in 156 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 158 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 01:46:15] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 01:46:15] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 01:46:16] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-22 01:46:16] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:46:16] [INFO ] Invariant cache hit.
[2023-03-22 01:46:16] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:46:16] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 514 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 735 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-COL-8-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s50 s51 s52 s53 s54 s55 s56 s57) 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 254 ms.
Stack based approach found an accepted trace after 1182 steps with 0 reset with depth 1183 and stack size 1183 in 4 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-08 finished in 1045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 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 17 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 01:46:16] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 01:46:16] [INFO ] Computed 82 place invariants in 2 ms
[2023-03-22 01:46:16] [INFO ] Implicit Places using invariants in 154 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 155 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 1 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 13 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
[2023-03-22 01:46:16] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 01:46:16] [INFO ] Computed 74 place invariants in 1 ms
[2023-03-22 01:46:17] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-22 01:46:17] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 01:46:17] [INFO ] Invariant cache hit.
[2023-03-22 01:46:17] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:46:17] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 500 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 685 ms. Remains : 242/266 places, 568/584 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 (ADD s218 s219 s220 s221 s222 s223 s224 s225)) (LEQ (ADD s82 s83 s84 s85 s86 s87 s88 s89) 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 285 ms.
Stack based approach found an accepted trace after 1067 steps with 0 reset with depth 1068 and stack size 1068 in 3 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-09 finished in 1055 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)||G(p1))))'
Support contains 80 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 01:46:17] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:46:17] [INFO ] Computed 82 place invariants in 1 ms
[2023-03-22 01:46:17] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-22 01:46:17] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:17] [INFO ] Invariant cache hit.
[2023-03-22 01:46:18] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:46:18] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-22 01:46:18] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:18] [INFO ] Invariant cache hit.
[2023-03-22 01:46:18] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 266/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s...], 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 3215 reset in 442 ms.
Product exploration explored 100000 steps with 3227 reset in 457 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 p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 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 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 44 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 225 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 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 80 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 1 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:20] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:20] [INFO ] Invariant cache hit.
[2023-03-22 01:46:20] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-22 01:46:20] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:20] [INFO ] Invariant cache hit.
[2023-03-22 01:46:20] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:46:20] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-22 01:46:20] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:20] [INFO ] Invariant cache hit.
[2023-03-22 01:46:20] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 266/266 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 p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 199 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 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 44 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 230 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 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3221 reset in 366 ms.
Product exploration explored 100000 steps with 3210 reset in 370 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 80 out of 266 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 18 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:22] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-22 01:46:22] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:22] [INFO ] Invariant cache hit.
[2023-03-22 01:46:22] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 266/266 places, 584/584 transitions.
Support contains 80 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 01:46:22] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:22] [INFO ] Invariant cache hit.
[2023-03-22 01:46:22] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-22 01:46:22] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:22] [INFO ] Invariant cache hit.
[2023-03-22 01:46:23] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:46:23] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-22 01:46:23] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:23] [INFO ] Invariant cache hit.
[2023-03-22 01:46:23] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 266/266 places, 584/584 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-12 finished in 5736 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)))'
Support contains 8 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 01:46:23] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:23] [INFO ] Invariant cache hit.
[2023-03-22 01:46:23] [INFO ] Implicit Places using invariants in 157 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 158 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 3 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 166 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-13 finished in 247 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(F(!(X(X((p0 U p1))) U X(p0))))))'
Support contains 24 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 5 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:23] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:23] [INFO ] Invariant cache hit.
[2023-03-22 01:46:23] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-22 01:46:23] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:23] [INFO ] Invariant cache hit.
[2023-03-22 01:46:24] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:46:24] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2023-03-22 01:46:24] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:24] [INFO ] Invariant cache hit.
[2023-03-22 01:46:24] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 754 ms. Remains : 266/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 149 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s74 s75 s76 s77 s78 s79 s80 s81) (ADD s162 s163 s164 s165 s166 s167 s168 s169)), p1:(AND (LEQ 2 (ADD s258 s259 s260 s261 s262 s263 s264 s265)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5419 reset in 296 ms.
Product exploration explored 100000 steps with 5459 reset in 305 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 554 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:46:26] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:26] [INFO ] Invariant cache hit.
[2023-03-22 01:46:26] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 10 factoid took 452 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR p1 p0), (OR p1 p0), p1]
Stuttering acceptance computed with spot in 84 ms :[(OR p1 p0), (OR p1 p0), p1]
[2023-03-22 01:46:26] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:26] [INFO ] Invariant cache hit.
[2023-03-22 01:46:27] [INFO ] [Real]Absence check using 82 positive place invariants in 25 ms returned sat
[2023-03-22 01:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:46:27] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2023-03-22 01:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:46:27] [INFO ] [Nat]Absence check using 82 positive place invariants in 38 ms returned sat
[2023-03-22 01:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:46:27] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-22 01:46:27] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:46:27] [INFO ] [Nat]Added 112 Read/Feed constraints in 20 ms returned sat
[2023-03-22 01:46:27] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 0 ms to minimize.
[2023-03-22 01:46:27] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2023-03-22 01:46:27] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2023-03-22 01:46:28] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-22 01:46:28] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2023-03-22 01:46:28] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2023-03-22 01:46:28] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2023-03-22 01:46:28] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 3 ms to minimize.
[2023-03-22 01:46:28] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:46:28] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-22 01:46:28] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-22 01:46:28] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 0 ms to minimize.
[2023-03-22 01:46:28] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2023-03-22 01:46:29] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 3 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 01:46:30] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2023-03-22 01:46:31] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2023-03-22 01:46:31] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:46:31] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2023-03-22 01:46:31] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 3 ms to minimize.
[2023-03-22 01:46:31] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 0 ms to minimize.
[2023-03-22 01:46:31] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2023-03-22 01:46:31] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2023-03-22 01:46:31] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-22 01:46:31] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2023-03-22 01:46:31] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 0 ms to minimize.
[2023-03-22 01:46:32] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2023-03-22 01:46:32] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-22 01:46:32] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:46:32] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 4557 ms
[2023-03-22 01:46:32] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 27 ms.
[2023-03-22 01:46:33] [INFO ] Added : 166 causal constraints over 35 iterations in 1112 ms. Result :sat
Could not prove EG p0
Support contains 24 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 5 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:33] [INFO ] Invariant cache hit.
[2023-03-22 01:46:33] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-22 01:46:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:33] [INFO ] Invariant cache hit.
[2023-03-22 01:46:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:46:33] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2023-03-22 01:46:33] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:33] [INFO ] Invariant cache hit.
[2023-03-22 01:46:34] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 780 ms. Remains : 266/266 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 p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 342 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR p1 p0), (OR p1 p0), p1]
Finished random walk after 282 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR p1 p0), (OR p1 p0), p1]
Stuttering acceptance computed with spot in 156 ms :[(OR p1 p0), (OR p1 p0), p1]
[2023-03-22 01:46:35] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:35] [INFO ] Invariant cache hit.
[2023-03-22 01:46:35] [INFO ] [Real]Absence check using 82 positive place invariants in 26 ms returned sat
[2023-03-22 01:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:46:35] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-22 01:46:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:46:35] [INFO ] [Nat]Absence check using 82 positive place invariants in 40 ms returned sat
[2023-03-22 01:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:46:35] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-22 01:46:35] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:46:35] [INFO ] [Nat]Added 112 Read/Feed constraints in 19 ms returned sat
[2023-03-22 01:46:36] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 0 ms to minimize.
[2023-03-22 01:46:36] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 1 ms to minimize.
[2023-03-22 01:46:36] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2023-03-22 01:46:36] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-22 01:46:36] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:46:36] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2023-03-22 01:46:36] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:46:36] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:46:36] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 01:46:36] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2023-03-22 01:46:37] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-22 01:46:37] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2023-03-22 01:46:37] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2023-03-22 01:46:37] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2023-03-22 01:46:37] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:46:37] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:46:37] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2023-03-22 01:46:37] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2023-03-22 01:46:37] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2023-03-22 01:46:37] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2023-03-22 01:46:38] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:46:39] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:46:40] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-22 01:46:40] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:46:40] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2023-03-22 01:46:40] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2023-03-22 01:46:40] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-22 01:46:40] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-22 01:46:40] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 4486 ms
[2023-03-22 01:46:40] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 24 ms.
[2023-03-22 01:46:41] [INFO ] Added : 166 causal constraints over 35 iterations in 1076 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 116 ms :[(OR p1 p0), (OR p1 p0), p1]
Product exploration explored 100000 steps with 5463 reset in 282 ms.
Product exploration explored 100000 steps with 5459 reset in 299 ms.
Support contains 24 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 5 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:42] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:42] [INFO ] Invariant cache hit.
[2023-03-22 01:46:42] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-22 01:46:42] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:42] [INFO ] Invariant cache hit.
[2023-03-22 01:46:42] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:46:42] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-22 01:46:42] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:42] [INFO ] Invariant cache hit.
[2023-03-22 01:46:43] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 735 ms. Remains : 266/266 places, 584/584 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-14 finished in 19263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G((p1&&X(p2)))))))'
Support contains 32 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 01:46:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:43] [INFO ] Invariant cache hit.
[2023-03-22 01:46:43] [INFO ] Implicit Places using invariants in 147 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 148 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 1 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 152 ms. Remains : 258/266 places, 584/584 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT (ADD s234 s235 s236 s237 s238 s239 s240 s241) (ADD s242 s243 s244 s245 s246 s247 s248 s249)), p1:(GT 3 (ADD s66 s67 s68 s69 s70 s71 s72 s73)), p2:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 3 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-8-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-15 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Found a Shortening insensitive property : LamportFastMutEx-COL-8-LTLCardinality-02
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 88 out of 266 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 11 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:43] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:43] [INFO ] Invariant cache hit.
[2023-03-22 01:46:43] [INFO ] Implicit Places using invariants in 139 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 141 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 258/266 places, 584/584 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 258 transition count 576
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 576
Applied a total of 16 rules in 8 ms. Remains 250 /258 variables (removed 8) and now considering 576/584 (removed 8) transitions.
[2023-03-22 01:46:43] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2023-03-22 01:46:43] [INFO ] Computed 74 place invariants in 3 ms
[2023-03-22 01:46:43] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-22 01:46:43] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:46:43] [INFO ] Invariant cache hit.
[2023-03-22 01:46:43] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:46:44] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 250/266 places, 576/584 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 626 ms. Remains : 250/266 places, 576/584 transitions.
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ (ADD s66 s67 s68 s69 s70 s71 s72 s73) (ADD s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1732 reset in 438 ms.
Product exploration explored 100000 steps with 1726 reset in 463 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-22 01:46:45] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:46:45] [INFO ] Invariant cache hit.
[2023-03-22 01:46:45] [INFO ] [Real]Absence check using 74 positive place invariants in 22 ms returned sat
[2023-03-22 01:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:46:46] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-22 01:46:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:46:46] [INFO ] [Nat]Absence check using 74 positive place invariants in 29 ms returned sat
[2023-03-22 01:46:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:46:46] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-22 01:46:46] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:46:46] [INFO ] [Nat]Added 48 Read/Feed constraints in 22 ms returned sat
[2023-03-22 01:46:46] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-22 01:46:46] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2023-03-22 01:46:46] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:46:46] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 0 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 0 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:46:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:46:48] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2023-03-22 01:46:48] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-22 01:46:48] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2023-03-22 01:46:48] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1582 ms
[2023-03-22 01:46:48] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 30 ms.
[2023-03-22 01:46:49] [INFO ] Added : 183 causal constraints over 37 iterations in 1184 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 88 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 01:46:49] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:46:49] [INFO ] Invariant cache hit.
[2023-03-22 01:46:49] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-22 01:46:49] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:46:49] [INFO ] Invariant cache hit.
[2023-03-22 01:46:49] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:46:49] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-22 01:46:49] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:46:49] [INFO ] Invariant cache hit.
[2023-03-22 01:46:50] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 651 ms. Remains : 250/250 places, 576/576 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2023-03-22 01:46:50] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:46:50] [INFO ] Invariant cache hit.
[2023-03-22 01:46:50] [INFO ] [Real]Absence check using 74 positive place invariants in 23 ms returned sat
[2023-03-22 01:46:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:46:51] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2023-03-22 01:46:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:46:51] [INFO ] [Nat]Absence check using 74 positive place invariants in 29 ms returned sat
[2023-03-22 01:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:46:51] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2023-03-22 01:46:51] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:46:51] [INFO ] [Nat]Added 48 Read/Feed constraints in 20 ms returned sat
[2023-03-22 01:46:51] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 01:46:51] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-22 01:46:51] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:46:51] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-22 01:46:51] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 01:46:52] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2023-03-22 01:46:53] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-22 01:46:53] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2023-03-22 01:46:53] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1637 ms
[2023-03-22 01:46:53] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 23 ms.
[2023-03-22 01:46:54] [INFO ] Added : 183 causal constraints over 37 iterations in 1194 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1717 reset in 460 ms.
Product exploration explored 100000 steps with 1720 reset in 476 ms.
Support contains 88 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-22 01:46:55] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:46:55] [INFO ] Invariant cache hit.
[2023-03-22 01:46:55] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-22 01:46:55] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:46:55] [INFO ] Invariant cache hit.
[2023-03-22 01:46:55] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 01:46:55] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-03-22 01:46:55] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2023-03-22 01:46:55] [INFO ] Invariant cache hit.
[2023-03-22 01:46:56] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 672 ms. Remains : 250/250 places, 576/576 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-02 finished in 12815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!((p0 U p1) U X(X(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||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' '!(X(G(F(!(X(X((p0 U p1))) U X(p0))))))'
Found a Shortening insensitive property : LamportFastMutEx-COL-8-LTLCardinality-14
Stuttering acceptance computed with spot in 148 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Support contains 24 out of 266 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:46:56] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 01:46:56] [INFO ] Computed 82 place invariants in 3 ms
[2023-03-22 01:46:56] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-22 01:46:56] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:56] [INFO ] Invariant cache hit.
[2023-03-22 01:46:56] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:46:57] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2023-03-22 01:46:57] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:57] [INFO ] Invariant cache hit.
[2023-03-22 01:46:57] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 760 ms. Remains : 266/266 places, 584/584 transitions.
Running random walk in product with property : LamportFastMutEx-COL-8-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s74 s75 s76 s77 s78 s79 s80 s81) (ADD s162 s163 s164 s165 s166 s167 s168 s169)), p1:(AND (LEQ 2 (ADD s258 s259 s260 s261 s262 s263 s264 s265)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5472 reset in 290 ms.
Product exploration explored 100000 steps with 5489 reset in 306 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 404 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[p0, p0, (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 01:46:58] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:58] [INFO ] Invariant cache hit.
[2023-03-22 01:46:58] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 10 factoid took 426 ms. Reduced automaton from 4 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR p1 p0), (OR p1 p0), p1]
Stuttering acceptance computed with spot in 132 ms :[(OR p1 p0), (OR p1 p0), p1]
[2023-03-22 01:46:59] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:46:59] [INFO ] Invariant cache hit.
[2023-03-22 01:46:59] [INFO ] [Real]Absence check using 82 positive place invariants in 25 ms returned sat
[2023-03-22 01:46:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:46:59] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-22 01:46:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:46:59] [INFO ] [Nat]Absence check using 82 positive place invariants in 39 ms returned sat
[2023-03-22 01:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:47:00] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-22 01:47:00] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:47:00] [INFO ] [Nat]Added 112 Read/Feed constraints in 16 ms returned sat
[2023-03-22 01:47:00] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2023-03-22 01:47:00] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 0 ms to minimize.
[2023-03-22 01:47:00] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 0 ms to minimize.
[2023-03-22 01:47:00] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-22 01:47:00] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-22 01:47:00] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2023-03-22 01:47:00] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2023-03-22 01:47:00] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-22 01:47:01] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-22 01:47:01] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2023-03-22 01:47:01] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-22 01:47:01] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 0 ms to minimize.
[2023-03-22 01:47:01] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 0 ms to minimize.
[2023-03-22 01:47:01] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2023-03-22 01:47:01] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2023-03-22 01:47:01] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2023-03-22 01:47:01] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-22 01:47:01] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 0 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 1 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:47:02] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2023-03-22 01:47:03] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:47:04] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:47:04] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-22 01:47:04] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:47:04] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:47:04] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-03-22 01:47:04] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2023-03-22 01:47:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-22 01:47:04] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 4367 ms
[2023-03-22 01:47:04] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 23 ms.
[2023-03-22 01:47:05] [INFO ] Added : 166 causal constraints over 35 iterations in 1098 ms. Result :sat
Could not prove EG p0
Support contains 24 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 01:47:05] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:47:05] [INFO ] Invariant cache hit.
[2023-03-22 01:47:05] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-22 01:47:05] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:47:05] [INFO ] Invariant cache hit.
[2023-03-22 01:47:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:47:06] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2023-03-22 01:47:06] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:47:06] [INFO ] Invariant cache hit.
[2023-03-22 01:47:06] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 750 ms. Remains : 266/266 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 p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR p1 p0), (OR p1 p0), p1]
Finished random walk after 5279 steps, including 1 resets, run visited all 3 properties in 18 ms. (steps per millisecond=293 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 370 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR p1 p0), (OR p1 p0), p1]
Stuttering acceptance computed with spot in 114 ms :[(OR p1 p0), (OR p1 p0), p1]
[2023-03-22 01:47:07] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:47:07] [INFO ] Invariant cache hit.
[2023-03-22 01:47:07] [INFO ] [Real]Absence check using 82 positive place invariants in 30 ms returned sat
[2023-03-22 01:47:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:47:07] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2023-03-22 01:47:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:47:08] [INFO ] [Nat]Absence check using 82 positive place invariants in 39 ms returned sat
[2023-03-22 01:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:47:08] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-22 01:47:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:47:08] [INFO ] [Nat]Added 112 Read/Feed constraints in 15 ms returned sat
[2023-03-22 01:47:08] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:47:08] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-03-22 01:47:08] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2023-03-22 01:47:08] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-22 01:47:08] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-22 01:47:08] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2023-03-22 01:47:08] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2023-03-22 01:47:09] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:47:09] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-22 01:47:09] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-22 01:47:09] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2023-03-22 01:47:09] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 0 ms to minimize.
[2023-03-22 01:47:09] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2023-03-22 01:47:09] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-22 01:47:09] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2023-03-22 01:47:09] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2023-03-22 01:47:09] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 1 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-22 01:47:10] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 0 ms to minimize.
[2023-03-22 01:47:11] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 0 ms to minimize.
[2023-03-22 01:47:12] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2023-03-22 01:47:12] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2023-03-22 01:47:12] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-22 01:47:12] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2023-03-22 01:47:12] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2023-03-22 01:47:12] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-22 01:47:12] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-22 01:47:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-22 01:47:12] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 4367 ms
[2023-03-22 01:47:12] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 22 ms.
[2023-03-22 01:47:13] [INFO ] Added : 166 causal constraints over 35 iterations in 1129 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 117 ms :[(OR p1 p0), (OR p1 p0), p1]
Product exploration explored 100000 steps with 5509 reset in 298 ms.
Product exploration explored 100000 steps with 5507 reset in 289 ms.
Support contains 24 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 5 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
[2023-03-22 01:47:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:47:14] [INFO ] Invariant cache hit.
[2023-03-22 01:47:14] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-22 01:47:14] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:47:14] [INFO ] Invariant cache hit.
[2023-03-22 01:47:14] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 01:47:15] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2023-03-22 01:47:15] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
[2023-03-22 01:47:15] [INFO ] Invariant cache hit.
[2023-03-22 01:47:15] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 761 ms. Remains : 266/266 places, 584/584 transitions.
Treatment of property LamportFastMutEx-COL-8-LTLCardinality-14 finished in 18921 ms.
[2023-03-22 01:47:15] [INFO ] Flatten gal took : 34 ms
[2023-03-22 01:47:15] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 01:47:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 584 transitions and 2560 arcs took 7 ms.
Total runtime 88059 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT LamportFastMutEx-COL-8
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA LamportFastMutEx-COL-8-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-8-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679449711471

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:409
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: RELEASE
lola: RELEASE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: RELEASE
lola: RELEASE
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: RELEASE
lola: RELEASE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 LamportFastMutEx-COL-8-LTLCardinality-06
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/900 4/32 LamportFastMutEx-COL-8-LTLCardinality-06 590342 m, 118068 m/sec, 3169066 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 4 (type EXCL) for LamportFastMutEx-COL-8-LTLCardinality-06
lola: result : false
lola: markings : 941049
lola: fired transitions : 5271627
lola: time used : 8.000000
lola: memory pages used : 7
lola: LAUNCH task # 10 (type EXCL) for 9 LamportFastMutEx-COL-8-LTLCardinality-14
lola: time limit : 1197 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 2/1197 3/32 LamportFastMutEx-COL-8-LTLCardinality-14 338872 m, 67774 m/sec, 764487 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 7/1197 10/32 LamportFastMutEx-COL-8-LTLCardinality-14 1287455 m, 189716 m/sec, 3118213 t fired, .

Time elapsed: 15 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 12/1197 16/32 LamportFastMutEx-COL-8-LTLCardinality-14 2151201 m, 172749 m/sec, 5418638 t fired, .

Time elapsed: 20 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 17/1197 21/32 LamportFastMutEx-COL-8-LTLCardinality-14 2966712 m, 163102 m/sec, 7698600 t fired, .

Time elapsed: 25 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 22/1197 27/32 LamportFastMutEx-COL-8-LTLCardinality-14 3716871 m, 150031 m/sec, 9954074 t fired, .

Time elapsed: 30 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 27/1197 32/32 LamportFastMutEx-COL-8-LTLCardinality-14 4535911 m, 163808 m/sec, 12281752 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for LamportFastMutEx-COL-8-LTLCardinality-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 LamportFastMutEx-COL-8-LTLCardinality-12
lola: time limit : 1780 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1780 6/32 LamportFastMutEx-COL-8-LTLCardinality-12 788800 m, 157760 m/sec, 2907874 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1780 9/32 LamportFastMutEx-COL-8-LTLCardinality-12 1300939 m, 102427 m/sec, 6038571 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1780 13/32 LamportFastMutEx-COL-8-LTLCardinality-12 1901497 m, 120111 m/sec, 8987260 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1780 17/32 LamportFastMutEx-COL-8-LTLCardinality-12 2487935 m, 117287 m/sec, 11972647 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1780 22/32 LamportFastMutEx-COL-8-LTLCardinality-12 3159894 m, 134391 m/sec, 14817085 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1780 30/32 LamportFastMutEx-COL-8-LTLCardinality-12 4337042 m, 235429 m/sec, 17191924 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for LamportFastMutEx-COL-8-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
LamportFastMutEx-COL-8-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
LamportFastMutEx-COL-8-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0
LamportFastMutEx-COL-8-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 LamportFastMutEx-COL-8-LTLCardinality-02
lola: time limit : 3525 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for LamportFastMutEx-COL-8-LTLCardinality-02
lola: result : false
lola: markings : 16
lola: fired transitions : 16
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
LamportFastMutEx-COL-8-LTLCardinality-02: LTL false LTL model checker
LamportFastMutEx-COL-8-LTLCardinality-06: LTL false LTL model checker
LamportFastMutEx-COL-8-LTLCardinality-12: LTL unknown AGGR
LamportFastMutEx-COL-8-LTLCardinality-14: LTL unknown AGGR


Time elapsed: 75 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-8"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is LamportFastMutEx-COL-8, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r231-tall-167856416000387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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