About the Execution of ITS-Tools for LamportFastMutEx-COL-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16218.151 | 3600000.00 | 4702237.00 | 255205.60 | ?FTFFFFFTFFFTFFF | normal |
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.r229-tall-167856413200380.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 itstools
Input is LamportFastMutEx-COL-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413200380
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 13:41 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 4.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 25 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:47 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 43K 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-7-LTLFireability-00
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-01
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-02
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-03
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-04
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-05
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-06
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-07
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-08
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-09
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-10
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-11
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-12
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-13
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-14
FORMULA_NAME LamportFastMutEx-COL-7-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679477415564
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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-7
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-22 09:30:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 09:30:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:30:17] [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 09:30:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 09:30:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 764 ms
[2023-03-22 09:30:18] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 09:30:18] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 09:30:18] [INFO ] Skeletonized 12 HLPN properties in 2 ms. Removed 4 properties that had guard overlaps.
Initial state reduction rules removed 4 formulas.
FORMULA LamportFastMutEx-COL-7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 8 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 1974 steps, including 0 resets, run visited all 11 properties in 23 ms. (steps per millisecond=85 )
[2023-03-22 09:30:18] [INFO ] Flatten gal took : 14 ms
[2023-03-22 09:30:18] [INFO ] Flatten gal took : 2 ms
Domain [pid(8), pid(8)] 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 09:30:18] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 22 ms.
[2023-03-22 09:30:18] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 74 transitions.
FORMULA LamportFastMutEx-COL-7-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 149 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 12 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:30:18] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 09:30:18] [INFO ] Computed 65 place invariants in 21 ms
[2023-03-22 09:30:19] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-22 09:30:19] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:30:19] [INFO ] Invariant cache hit.
[2023-03-22 09:30:19] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 09:30:19] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-22 09:30:19] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:30:19] [INFO ] Invariant cache hit.
[2023-03-22 09:30:19] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 715 ms. Remains : 219/219 places, 462/462 transitions.
Support contains 149 out of 219 places after structural reductions.
[2023-03-22 09:30:19] [INFO ] Flatten gal took : 51 ms
[2023-03-22 09:30:19] [INFO ] Flatten gal took : 50 ms
[2023-03-22 09:30:19] [INFO ] Input system was already deterministic with 462 transitions.
Finished random walk after 188 steps, including 0 resets, run visited all 16 properties in 15 ms. (steps per millisecond=12 )
Computed a total of 1 stabilizing places and 7 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(X(F((G(F(p0))||(p1&&F(p0)))))))'
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 11 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:30:20] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:30:20] [INFO ] Invariant cache hit.
[2023-03-22 09:30:20] [INFO ] Implicit Places using invariants in 138 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 141 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 8 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s21 1) (GEQ s51 1)) (AND (GEQ s17 1) (GEQ s56 1)) (AND (GEQ s22 1) (GEQ s53 1)) (AND (GEQ s16 1) (GEQ s54 1)) (AND (GEQ s22 1) (GEQ s51 1...], 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 7086 reset in 496 ms.
Product exploration explored 100000 steps with 7114 reset in 446 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 159 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 12 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:30:22] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 09:30:22] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 09:30:22] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-22 09:30:22] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:30:22] [INFO ] Invariant cache hit.
[2023-03-22 09:30:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:30:23] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-22 09:30:23] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:30:23] [INFO ] Invariant cache hit.
[2023-03-22 09:30:23] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 671 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7135 reset in 383 ms.
Product exploration explored 100000 steps with 7110 reset in 374 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 462
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 7 rules in 33 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:30:25] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-22 09:30:25] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 09:30:25] [INFO ] Computed 58 place invariants in 11 ms
[2023-03-22 09:30:25] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 462/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 344 ms. Remains : 212/212 places, 462/462 transitions.
Built C files in :
/tmp/ltsmin17276662706621446091
[2023-03-22 09:30:25] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17276662706621446091
Running compilation step : cd /tmp/ltsmin17276662706621446091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 779 ms.
Running link step : cd /tmp/ltsmin17276662706621446091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17276662706621446091;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11325048547520151064.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 8 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:30:40] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 09:30:40] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 09:30:40] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-22 09:30:40] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:30:40] [INFO ] Invariant cache hit.
[2023-03-22 09:30:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:30:41] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-22 09:30:41] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:30:41] [INFO ] Invariant cache hit.
[2023-03-22 09:30:41] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 212/212 places, 462/462 transitions.
Built C files in :
/tmp/ltsmin7332664189241997223
[2023-03-22 09:30:41] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7332664189241997223
Running compilation step : cd /tmp/ltsmin7332664189241997223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 678 ms.
Running link step : cd /tmp/ltsmin7332664189241997223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7332664189241997223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12014229664897080345.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-22 09:30:56] [INFO ] Flatten gal took : 29 ms
[2023-03-22 09:30:56] [INFO ] Flatten gal took : 28 ms
[2023-03-22 09:30:56] [INFO ] Time to serialize gal into /tmp/LTL13814638305749005699.gal : 4 ms
[2023-03-22 09:30:56] [INFO ] Time to serialize properties into /tmp/LTL10177825186994315005.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13814638305749005699.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4192132675911333663.hoa' '-atoms' '/tmp/LTL10177825186994315005.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10177825186994315005.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4192132675911333663.hoa
Detected timeout of ITS tools.
[2023-03-22 09:31:11] [INFO ] Flatten gal took : 38 ms
[2023-03-22 09:31:11] [INFO ] Flatten gal took : 53 ms
[2023-03-22 09:31:11] [INFO ] Time to serialize gal into /tmp/LTL11660787321366713572.gal : 2 ms
[2023-03-22 09:31:11] [INFO ] Time to serialize properties into /tmp/LTL15405761009566200520.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11660787321366713572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15405761009566200520.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(((((x_1<1)||(P_ifxi_10_1<1))&&((x_2<1)||(P_ifxi_10_2<1)))&&(((x_3<1)||(P_ifxi_10_3<1))&&((x_4<1)||(P_ifxi_10_4<1))))&&...1989
Formula 0 simplified : XXG(FG!"(((((x_1<1)||(P_ifxi_10_1<1))&&((x_2<1)||(P_ifxi_10_2<1)))&&(((x_3<1)||(P_ifxi_10_3<1))&&((x_4<1)||(P_ifxi_10_4<1))))&&((((x...1975
Detected timeout of ITS tools.
[2023-03-22 09:31:26] [INFO ] Flatten gal took : 20 ms
[2023-03-22 09:31:26] [INFO ] Applying decomposition
[2023-03-22 09:31:27] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15132639373070923560.txt' '-o' '/tmp/graph15132639373070923560.bin' '-w' '/tmp/graph15132639373070923560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15132639373070923560.bin' '-l' '-1' '-v' '-w' '/tmp/graph15132639373070923560.weights' '-q' '0' '-e' '0.001'
[2023-03-22 09:31:27] [INFO ] Decomposing Gal with order
[2023-03-22 09:31:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 09:31:27] [INFO ] Removed a total of 686 redundant transitions.
[2023-03-22 09:31:27] [INFO ] Flatten gal took : 152 ms
[2023-03-22 09:31:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 19 ms.
[2023-03-22 09:31:27] [INFO ] Time to serialize gal into /tmp/LTL3774184436890639828.gal : 24 ms
[2023-03-22 09:31:27] [INFO ] Time to serialize properties into /tmp/LTL7125869892679173959.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3774184436890639828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7125869892679173959.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(((((i0.u9.x_1<1)||(u17.P_ifxi_10_1<1))&&((i1.u7.x_2<1)||(i12.u14.P_ifxi_10_2<1)))&&(((i2.u10.x_3<1)||(u18.P_ifxi_10_3<...2727
Formula 0 simplified : XXG(FG!"(((((i0.u9.x_1<1)||(u17.P_ifxi_10_1<1))&&((i1.u7.x_2<1)||(i12.u14.P_ifxi_10_2<1)))&&(((i2.u10.x_3<1)||(u18.P_ifxi_10_3<1))&&...2713
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9564548441872876802
[2023-03-22 09:31:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9564548441872876802
Running compilation step : cd /tmp/ltsmin9564548441872876802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 653 ms.
Running link step : cd /tmp/ltsmin9564548441872876802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin9564548441872876802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-00 finished in 97393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&(G(!p1) U p2)))))'
Support contains 106 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 31 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:31:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 09:31:57] [INFO ] Computed 65 place invariants in 3 ms
[2023-03-22 09:31:57] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-22 09:31:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:31:57] [INFO ] Invariant cache hit.
[2023-03-22 09:31:58] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 09:31:58] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-22 09:31:58] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 09:31:58] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:31:58] [INFO ] Invariant cache hit.
[2023-03-22 09:31:58] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 219/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (OR (NOT p2) p1), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), p1]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (GEQ s10 1) (GEQ s37 1)) (AND (GEQ s11 1) (GEQ s43 1)) (AND (GEQ s10 1) (GEQ s39 1)) (AND (GEQ s11 1) (GEQ s41 1)) (AND (GEQ s11 1) (GEQ s39 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 3 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-03 finished in 891 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&&F(p1))))'
Support contains 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:31:58] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:31:58] [INFO ] Invariant cache hit.
[2023-03-22 09:31:58] [INFO ] Implicit Places using invariants in 137 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 141 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (LT s22 1) (LT s60 1)) (OR (LT s22 1) (LT s58 1)) (OR (LT s22 1) (LT s64 1)) (OR (LT s17 1) (LT s61 1)) (OR (LT s22 1) (LT s62 1)) (OR (LT s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-04 finished in 295 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)||X(X(F(!p1)))) U (!p2 U (p3||G(!p2))))))'
Support contains 44 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:31:58] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:31:58] [INFO ] Invariant cache hit.
[2023-03-22 09:31:58] [INFO ] Implicit Places using invariants in 124 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 125 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 132 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 276 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p0) p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (NOT (OR (AND (GEQ s10 1) (GEQ s37 1)) (AND (GEQ s11 1) (GEQ s43 1)) (AND (GEQ s10 1) (GEQ s39 1)) (AND (GEQ s11 1) (GEQ s41 1)) (AND (GEQ s11 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15825 reset in 892 ms.
Product exploration explored 100000 steps with 15845 reset in 878 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p3) p2 (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0)))))]
Knowledge based reduction with 11 factoid took 577 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 09:32:02] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 09:32:02] [INFO ] Computed 58 place invariants in 13 ms
[2023-03-22 09:32:02] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2023-03-22 09:32:02] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:32:02] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-22 09:32:02] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:03] [INFO ] After 245ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:03] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 4 ms to minimize.
[2023-03-22 09:32:03] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2023-03-22 09:32:03] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-22 09:32:03] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2023-03-22 09:32:03] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-22 09:32:04] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2023-03-22 09:32:04] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 0 ms to minimize.
[2023-03-22 09:32:04] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2023-03-22 09:32:04] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2023-03-22 09:32:04] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2023-03-22 09:32:04] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2023-03-22 09:32:04] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 0 ms to minimize.
[2023-03-22 09:32:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1220 ms
[2023-03-22 09:32:04] [INFO ] After 1720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-22 09:32:04] [INFO ] After 2403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 455
Applied a total of 14 rules in 26 ms. Remains 205 /212 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 205/212 places, 455/462 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 878512 steps, run timeout after 3016 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 878512 steps, saw 388007 distinct states, run finished after 3017 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 09:32:08] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 09:32:08] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 09:32:08] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2023-03-22 09:32:08] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:32:08] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 09:32:08] [INFO ] After 314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:08] [INFO ] After 251ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:09] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2023-03-22 09:32:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-22 09:32:09] [INFO ] After 584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-22 09:32:09] [INFO ] After 1201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 16 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 09:32:09] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 09:32:09] [INFO ] Invariant cache hit.
[2023-03-22 09:32:09] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-22 09:32:09] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 09:32:09] [INFO ] Invariant cache hit.
[2023-03-22 09:32:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:09] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-22 09:32:09] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 09:32:09] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 09:32:09] [INFO ] Invariant cache hit.
[2023-03-22 09:32:09] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 205/205 places, 455/455 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 100 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 100 transition count 259
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 100 transition count 252
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 252
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 245
Applied a total of 322 rules in 26 ms. Remains 93 /205 variables (removed 112) and now considering 245/455 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 93 cols
[2023-03-22 09:32:09] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-22 09:32:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-22 09:32:10] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:32:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 09:32:10] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:10] [INFO ] After 597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-22 09:32:10] [INFO ] After 878ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p3) p2 (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (F p0), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3) (NOT p0) p1)), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 848 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 251 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 7 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:32:12] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 09:32:12] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 09:32:12] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-22 09:32:12] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:12] [INFO ] Invariant cache hit.
[2023-03-22 09:32:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:12] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-22 09:32:12] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:12] [INFO ] Invariant cache hit.
[2023-03-22 09:32:12] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (AND p2 (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 868 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 09:32:14] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:14] [INFO ] Invariant cache hit.
[2023-03-22 09:32:14] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 09:32:14] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:32:14] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 09:32:14] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:14] [INFO ] After 262ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:15] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2023-03-22 09:32:15] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2023-03-22 09:32:15] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2023-03-22 09:32:15] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2023-03-22 09:32:15] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2023-03-22 09:32:15] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2023-03-22 09:32:15] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-03-22 09:32:15] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-22 09:32:16] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2023-03-22 09:32:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 868 ms
[2023-03-22 09:32:16] [INFO ] After 1372ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 253 ms.
[2023-03-22 09:32:16] [INFO ] After 2018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 455
Applied a total of 14 rules in 11 ms. Remains 205 /212 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 205/212 places, 455/462 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 894892 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 894892 steps, saw 395025 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 09:32:19] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 09:32:19] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-22 09:32:19] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 09:32:19] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:32:19] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 09:32:19] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:20] [INFO ] After 248ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:20] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2023-03-22 09:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-22 09:32:20] [INFO ] After 571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-22 09:32:20] [INFO ] After 1192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 9 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 7 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 09:32:20] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 09:32:20] [INFO ] Invariant cache hit.
[2023-03-22 09:32:20] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-22 09:32:20] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 09:32:20] [INFO ] Invariant cache hit.
[2023-03-22 09:32:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:21] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-22 09:32:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 09:32:21] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 09:32:21] [INFO ] Invariant cache hit.
[2023-03-22 09:32:21] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 205/205 places, 455/455 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 100 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 100 transition count 259
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 100 transition count 252
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 252
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 245
Applied a total of 322 rules in 19 ms. Remains 93 /205 variables (removed 112) and now considering 245/455 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 93 cols
[2023-03-22 09:32:21] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 09:32:21] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 09:32:21] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:32:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 09:32:21] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:32:22] [INFO ] After 586ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 246 ms.
[2023-03-22 09:32:22] [INFO ] After 867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p3 (NOT p0) (NOT p1)), (X (AND p2 (NOT p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (AND p2 (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p2 (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 (NOT p3) (NOT p0)))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p2) (NOT p3))), (F (AND p2 (NOT p3) (NOT p0) p1)), (F (AND (NOT p2) (NOT p3) (NOT p0))), (F (AND p2 (NOT p3) (NOT p0))), (F (AND p2 (NOT p3))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 801 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 251 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 237 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 15751 reset in 739 ms.
Product exploration explored 100000 steps with 15822 reset in 744 ms.
Applying partial POR strategy [false, true, false, false, true, true]
Stuttering acceptance computed with spot in 250 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 462
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 17 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:32:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 09:32:25] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 09:32:25] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 09:32:26] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 462/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 212/212 places, 462/462 transitions.
Built C files in :
/tmp/ltsmin5338226490162127239
[2023-03-22 09:32:26] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5338226490162127239
Running compilation step : cd /tmp/ltsmin5338226490162127239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 718 ms.
Running link step : cd /tmp/ltsmin5338226490162127239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5338226490162127239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12916199349946706255.hoa' '--buchi-type=spotba'
LTSmin run took 178 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLFireability-05 finished in 28254 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((G(!p1)||p0))))'
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:32:27] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 09:32:27] [INFO ] Computed 65 place invariants in 2 ms
[2023-03-22 09:32:27] [INFO ] Implicit Places using invariants in 148 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 149 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (OR (LT s8 1) (LT s65 1)) (OR (LT s9 1) (LT s66 1)) (OR (LT s10 1) (LT s67 1)) (OR (LT s11 1) (LT s68 1)) (OR (LT s12 1) (LT s69 1)) (OR (LT s13 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4125 reset in 289 ms.
Product exploration explored 100000 steps with 4149 reset in 302 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (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))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 193 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p1 (NOT p0)), (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))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-22 09:32:28] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 09:32:28] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 09:32:28] [INFO ] [Real]Absence check using 58 positive place invariants in 16 ms returned sat
[2023-03-22 09:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:32:28] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-22 09:32:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:32:29] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-22 09:32:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:32:29] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-22 09:32:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:29] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2023-03-22 09:32:29] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-22 09:32:29] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2023-03-22 09:32:29] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2023-03-22 09:32:29] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-22 09:32:29] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2023-03-22 09:32:29] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2023-03-22 09:32:29] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2023-03-22 09:32:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-22 09:32:29] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 9 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 0 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 0 ms to minimize.
[2023-03-22 09:32:30] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1699 ms
[2023-03-22 09:32:30] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 30 ms.
[2023-03-22 09:32:32] [INFO ] Added : 242 causal constraints over 49 iterations in 1674 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 21 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:32:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:32] [INFO ] Invariant cache hit.
[2023-03-22 09:32:32] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-22 09:32:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:32] [INFO ] Invariant cache hit.
[2023-03-22 09:32:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:32] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-22 09:32:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:32] [INFO ] Invariant cache hit.
[2023-03-22 09:32:33] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-22 09:32:33] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:33] [INFO ] Invariant cache hit.
[2023-03-22 09:32:33] [INFO ] [Real]Absence check using 58 positive place invariants in 16 ms returned sat
[2023-03-22 09:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:32:34] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-22 09:32:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:32:34] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-22 09:32:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:32:34] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2023-03-22 09:32:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:34] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2023-03-22 09:32:34] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2023-03-22 09:32:34] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2023-03-22 09:32:34] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-22 09:32:34] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 0 ms to minimize.
[2023-03-22 09:32:34] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 09:32:34] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-22 09:32:34] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-22 09:32:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1351 ms
[2023-03-22 09:32:35] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 23 ms.
[2023-03-22 09:32:37] [INFO ] Added : 240 causal constraints over 48 iterations in 1527 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 4155 reset in 314 ms.
Product exploration explored 100000 steps with 4151 reset in 323 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 21 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 11 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:32:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 09:32:38] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:38] [INFO ] Invariant cache hit.
[2023-03-22 09:32:38] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 212/212 places, 462/462 transitions.
Built C files in :
/tmp/ltsmin15991722444603945620
[2023-03-22 09:32:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15991722444603945620
Running compilation step : cd /tmp/ltsmin15991722444603945620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 694 ms.
Running link step : cd /tmp/ltsmin15991722444603945620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15991722444603945620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16899434780415481733.hoa' '--buchi-type=spotba'
LTSmin run took 145 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLFireability-06 finished in 12141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 36 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:32:39] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 09:32:39] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 09:32:39] [INFO ] Implicit Places using invariants in 131 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 132 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (OR (LT s24 1) (LT s205 1)) (OR (LT s34 1) (LT s210 1)) (OR (LT s26 1) (LT s206 1)) (OR (LT s32 1) (LT s209 1)) (OR (LT s28 1) (LT s207 1)) (O...], 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 5114 reset in 314 ms.
Product exploration explored 100000 steps with 5122 reset in 322 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 259 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 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 145 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=72 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 337 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 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2023-03-22 09:32:41] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 09:32:41] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-22 09:32:41] [INFO ] [Real]Absence check using 58 positive place invariants in 19 ms returned sat
[2023-03-22 09:32:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:32:41] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-22 09:32:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:32:41] [INFO ] [Nat]Absence check using 58 positive place invariants in 23 ms returned sat
[2023-03-22 09:32:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:32:41] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-22 09:32:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2023-03-22 09:32:41] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2023-03-22 09:32:42] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2023-03-22 09:32:42] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-22 09:32:42] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2023-03-22 09:32:42] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 0 ms to minimize.
[2023-03-22 09:32:42] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 0 ms to minimize.
[2023-03-22 09:32:42] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2023-03-22 09:32:42] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2023-03-22 09:32:42] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2023-03-22 09:32:42] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2023-03-22 09:32:42] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2023-03-22 09:32:43] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2023-03-22 09:32:43] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2023-03-22 09:32:43] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 0 ms to minimize.
[2023-03-22 09:32:43] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-22 09:32:43] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2023-03-22 09:32:43] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-22 09:32:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 09:32:43] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1668 ms
[2023-03-22 09:32:43] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 28 ms.
[2023-03-22 09:32:44] [INFO ] Added : 222 causal constraints over 45 iterations in 1392 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 36 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:32:44] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:44] [INFO ] Invariant cache hit.
[2023-03-22 09:32:45] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-22 09:32:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:45] [INFO ] Invariant cache hit.
[2023-03-22 09:32:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:45] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-22 09:32:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:45] [INFO ] Invariant cache hit.
[2023-03-22 09:32:45] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 565 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 240 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 106 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 255 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=127 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), true, (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 305 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 249 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 612 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2023-03-22 09:32:47] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:32:47] [INFO ] Invariant cache hit.
[2023-03-22 09:32:47] [INFO ] [Real]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-22 09:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:32:47] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-22 09:32:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:32:47] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-22 09:32:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:32:47] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-22 09:32:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:32:47] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2023-03-22 09:32:47] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-22 09:32:47] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 09:32:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1198 ms
[2023-03-22 09:32:48] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 23 ms.
[2023-03-22 09:32:50] [INFO ] Added : 205 causal constraints over 41 iterations in 1262 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 5119 reset in 304 ms.
Product exploration explored 100000 steps with 5118 reset in 315 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 36 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 462
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 14 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:32:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 09:32:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 09:32:51] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 09:32:51] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 462/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 212/212 places, 462/462 transitions.
Built C files in :
/tmp/ltsmin17892832947774190336
[2023-03-22 09:32:51] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17892832947774190336
Running compilation step : cd /tmp/ltsmin17892832947774190336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 860 ms.
Running link step : cd /tmp/ltsmin17892832947774190336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17892832947774190336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16746406859380751182.hoa' '--buchi-type=spotba'
LTSmin run took 13138 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLFireability-07 finished in 26211 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 56 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:33:05] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 09:33:05] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 09:33:05] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-22 09:33:05] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:33:05] [INFO ] Invariant cache hit.
[2023-03-22 09:33:05] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 09:33:05] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-22 09:33:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 09:33:05] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:33:05] [INFO ] Invariant cache hit.
[2023-03-22 09:33:06] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 624 ms. Remains : 219/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s135 1) (GEQ s142 1) (GEQ s143 1) (GEQ s144 1) (GEQ s145 1) (GEQ s146 1) (GEQ s147 1) (GEQ s148 1)) (AND (GEQ s136 1) (GEQ s149 1) (GEQ s...], 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 263 ms.
Stack based approach found an accepted trace after 722 steps with 0 reset with depth 723 and stack size 723 in 2 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-09 finished in 944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:33:06] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:33:06] [INFO ] Invariant cache hit.
[2023-03-22 09:33:06] [INFO ] Implicit Places using invariants in 135 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 150 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 823 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (AND (GEQ s15 1) (GEQ s186 1)) (AND (GEQ s20 1) (GEQ s187 1)) (AND (GEQ s15 1) (GEQ s184 1)) (AND (GEQ s20 1) (GEQ s189 1)) (AND (GEQ s15 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-10 finished in 999 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 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:33:07] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 09:33:07] [INFO ] Invariant cache hit.
[2023-03-22 09:33:07] [INFO ] Implicit Places using invariants in 134 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 136 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 119 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s10 1) (GEQ s37 1)) (AND (GEQ s11 1) (GEQ s43 1)) (AND (GEQ s10 1) (GEQ s39 1)) (AND (GEQ s11 1) (GEQ s41 1)) (AND (GEQ s11 1) (GEQ s39 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5224 reset in 581 ms.
Product exploration explored 100000 steps with 5170 reset in 579 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[p0, false, (AND p0 (NOT p1))]
Finished random walk after 14 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 317 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[p0, false, (AND p0 (NOT p1))]
Support contains 22 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 212 transition count 455
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 455
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 198 transition count 448
Applied a total of 28 rules in 22 ms. Remains 198 /212 variables (removed 14) and now considering 448/462 (removed 14) transitions.
[2023-03-22 09:33:09] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 09:33:09] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 09:33:09] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-22 09:33:09] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:09] [INFO ] Invariant cache hit.
[2023-03-22 09:33:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:33:10] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-22 09:33:10] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 09:33:10] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:10] [INFO ] Invariant cache hit.
[2023-03-22 09:33:10] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 198/212 places, 448/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 608 ms. Remains : 198/212 places, 448/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 308 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[p0, false, (AND p0 (NOT p1))]
Finished random walk after 13 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 413 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[p0, false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[p0, false, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[p0, false, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 9208 reset in 639 ms.
Product exploration explored 100000 steps with 9596 reset in 653 ms.
Built C files in :
/tmp/ltsmin2661841562848103229
[2023-03-22 09:33:12] [INFO ] Computing symmetric may disable matrix : 448 transitions.
[2023-03-22 09:33:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 09:33:12] [INFO ] Computing symmetric may enable matrix : 448 transitions.
[2023-03-22 09:33:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 09:33:12] [INFO ] Computing Do-Not-Accords matrix : 448 transitions.
[2023-03-22 09:33:12] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 09:33:12] [INFO ] Built C files in 97ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2661841562848103229
Running compilation step : cd /tmp/ltsmin2661841562848103229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1000 ms.
Running link step : cd /tmp/ltsmin2661841562848103229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2661841562848103229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18344535208530872886.hoa' '--buchi-type=spotba'
LTSmin run took 2139 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property LamportFastMutEx-COL-7-LTLFireability-11 finished in 8704 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)&&F(G(p1)))))'
Support contains 29 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 11 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 09:33:16] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 09:33:16] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 09:33:16] [INFO ] Implicit Places using invariants in 250 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 252 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 448
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 448
Applied a total of 14 rules in 8 ms. Remains 198 /205 variables (removed 7) and now considering 448/455 (removed 7) transitions.
[2023-03-22 09:33:16] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 09:33:16] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 09:33:16] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-22 09:33:16] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:16] [INFO ] Invariant cache hit.
[2023-03-22 09:33:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:33:16] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 198/219 places, 448/462 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 727 ms. Remains : 198/219 places, 448/462 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s57 1)) (AND (GEQ s15 1) (GEQ s56 1)) (AND (GEQ s15 1) (GEQ s55 1)) (AND (GEQ s15 1) (GEQ s54 1)) (AND (GEQ s15 1) (GEQ s53 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11269 reset in 275 ms.
Stack based approach found an accepted trace after 3061 steps with 296 reset with depth 425 and stack size 425 in 10 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-14 finished in 1114 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 14 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 09:33:17] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 09:33:17] [INFO ] Computed 65 place invariants in 2 ms
[2023-03-22 09:33:17] [INFO ] Implicit Places using invariants in 144 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 164 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-15 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=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s8 1) (LT s65 1)) (OR (LT s9 1) (LT s66 1)) (OR (LT s10 1) (LT s67 1)) (OR (LT s11 1) (LT s68 1)) (OR (LT s12 1) (LT s69 1)) (OR (LT s13 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-COL-7-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-COL-7-LTLFireability-15 finished in 268 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((G(F(p0))||(p1&&F(p0)))))))'
Found a Shortening insensitive property : LamportFastMutEx-COL-7-LTLFireability-00
Stuttering acceptance computed with spot in 442 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 12 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 09:33:18] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 09:33:18] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 09:33:18] [INFO ] Implicit Places using invariants in 243 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 252 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 448
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 448
Applied a total of 14 rules in 6 ms. Remains 198 /205 variables (removed 7) and now considering 448/455 (removed 7) transitions.
[2023-03-22 09:33:18] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 09:33:18] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 09:33:18] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-22 09:33:18] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:18] [INFO ] Invariant cache hit.
[2023-03-22 09:33:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:33:18] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 198/219 places, 448/462 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 707 ms. Remains : 198/219 places, 448/462 transitions.
Running random walk in product with property : LamportFastMutEx-COL-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s21 1) (GEQ s51 1)) (AND (GEQ s17 1) (GEQ s56 1)) (AND (GEQ s22 1) (GEQ s53 1)) (AND (GEQ s16 1) (GEQ s54 1)) (AND (GEQ s22 1) (GEQ s51 1...], nbAcceptance=1, 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 7094 reset in 365 ms.
Product exploration explored 100000 steps with 7127 reset in 370 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 113 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=113 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 1 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 09:33:20] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:20] [INFO ] Invariant cache hit.
[2023-03-22 09:33:20] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-22 09:33:20] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:20] [INFO ] Invariant cache hit.
[2023-03-22 09:33:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:33:20] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-22 09:33:20] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:20] [INFO ] Invariant cache hit.
[2023-03-22 09:33:20] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 623 ms. Remains : 198/198 places, 448/448 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7120 reset in 359 ms.
Product exploration explored 100000 steps with 7142 reset in 375 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 28 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 09:33:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 09:33:22] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:22] [INFO ] Invariant cache hit.
[2023-03-22 09:33:22] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 198/198 places, 448/448 transitions.
Built C files in :
/tmp/ltsmin4298127770685313752
[2023-03-22 09:33:23] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4298127770685313752
Running compilation step : cd /tmp/ltsmin4298127770685313752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 719 ms.
Running link step : cd /tmp/ltsmin4298127770685313752;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4298127770685313752;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15137293411652522868.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 28 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 09:33:38] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:38] [INFO ] Invariant cache hit.
[2023-03-22 09:33:38] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-22 09:33:38] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:38] [INFO ] Invariant cache hit.
[2023-03-22 09:33:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 09:33:38] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-22 09:33:38] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 09:33:38] [INFO ] Invariant cache hit.
[2023-03-22 09:33:38] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 198/198 places, 448/448 transitions.
Built C files in :
/tmp/ltsmin17980548051992286341
[2023-03-22 09:33:38] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17980548051992286341
Running compilation step : cd /tmp/ltsmin17980548051992286341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 713 ms.
Running link step : cd /tmp/ltsmin17980548051992286341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17980548051992286341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13653607862126543776.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-22 09:33:53] [INFO ] Flatten gal took : 21 ms
[2023-03-22 09:33:53] [INFO ] Flatten gal took : 21 ms
[2023-03-22 09:33:53] [INFO ] Time to serialize gal into /tmp/LTL8607957445543558294.gal : 4 ms
[2023-03-22 09:33:53] [INFO ] Time to serialize properties into /tmp/LTL7936413400172041722.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8607957445543558294.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13076088230508367204.hoa' '-atoms' '/tmp/LTL7936413400172041722.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7936413400172041722.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13076088230508367204.hoa
Detected timeout of ITS tools.
[2023-03-22 09:34:08] [INFO ] Flatten gal took : 18 ms
[2023-03-22 09:34:09] [INFO ] Flatten gal took : 17 ms
[2023-03-22 09:34:09] [INFO ] Time to serialize gal into /tmp/LTL17436677663487988733.gal : 3 ms
[2023-03-22 09:34:09] [INFO ] Time to serialize properties into /tmp/LTL12488286919810272864.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17436677663487988733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12488286919810272864.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(((((x_1<1)||(P_ifxi_10_1<1))&&((x_2<1)||(P_ifxi_10_2<1)))&&(((x_3<1)||(P_ifxi_10_3<1))&&((x_4<1)||(P_ifxi_10_4<1))))&&...1989
Formula 0 simplified : XXG(FG!"(((((x_1<1)||(P_ifxi_10_1<1))&&((x_2<1)||(P_ifxi_10_2<1)))&&(((x_3<1)||(P_ifxi_10_3<1))&&((x_4<1)||(P_ifxi_10_4<1))))&&((((x...1975
Detected timeout of ITS tools.
[2023-03-22 09:34:24] [INFO ] Flatten gal took : 16 ms
[2023-03-22 09:34:24] [INFO ] Applying decomposition
[2023-03-22 09:34:24] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9181627851843306137.txt' '-o' '/tmp/graph9181627851843306137.bin' '-w' '/tmp/graph9181627851843306137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9181627851843306137.bin' '-l' '-1' '-v' '-w' '/tmp/graph9181627851843306137.weights' '-q' '0' '-e' '0.001'
[2023-03-22 09:34:24] [INFO ] Decomposing Gal with order
[2023-03-22 09:34:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 09:34:24] [INFO ] Removed a total of 663 redundant transitions.
[2023-03-22 09:34:24] [INFO ] Flatten gal took : 29 ms
[2023-03-22 09:34:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 8 ms.
[2023-03-22 09:34:24] [INFO ] Time to serialize gal into /tmp/LTL13874084546497648525.gal : 3 ms
[2023-03-22 09:34:24] [INFO ] Time to serialize properties into /tmp/LTL13947641574216748275.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13874084546497648525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13947641574216748275.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(((((i9.u3.x_1<1)||(u11.P_ifxi_10_1<1))&&((i10.u0.x_2<1)||(u12.P_ifxi_10_2<1)))&&(((i11.u1.x_3<1)||(i8.u13.P_ifxi_10_3<...2691
Formula 0 simplified : XXG(FG!"(((((i9.u3.x_1<1)||(u11.P_ifxi_10_1<1))&&((i10.u0.x_2<1)||(u12.P_ifxi_10_2<1)))&&(((i11.u1.x_3<1)||(i8.u13.P_ifxi_10_3<1))&&...2677
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12631977973251459381
[2023-03-22 09:34:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12631977973251459381
Running compilation step : cd /tmp/ltsmin12631977973251459381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 713 ms.
Running link step : cd /tmp/ltsmin12631977973251459381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12631977973251459381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property LamportFastMutEx-COL-7-LTLFireability-00 finished in 96905 ms.
[2023-03-22 09:34:54] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14495776463838706931
[2023-03-22 09:34:54] [INFO ] Computing symmetric may disable matrix : 462 transitions.
[2023-03-22 09:34:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 09:34:54] [INFO ] Applying decomposition
[2023-03-22 09:34:54] [INFO ] Computing symmetric may enable matrix : 462 transitions.
[2023-03-22 09:34:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 09:34:54] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18049617145594727753.txt' '-o' '/tmp/graph18049617145594727753.bin' '-w' '/tmp/graph18049617145594727753.weights'
[2023-03-22 09:34:54] [INFO ] Computing Do-Not-Accords matrix : 462 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18049617145594727753.bin' '-l' '-1' '-v' '-w' '/tmp/graph18049617145594727753.weights' '-q' '0' '-e' '0.001'
[2023-03-22 09:34:54] [INFO ] Decomposing Gal with order
[2023-03-22 09:34:54] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-22 09:34:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 09:34:54] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14495776463838706931
Running compilation step : cd /tmp/ltsmin14495776463838706931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-22 09:34:54] [INFO ] Removed a total of 721 redundant transitions.
[2023-03-22 09:34:54] [INFO ] Flatten gal took : 26 ms
[2023-03-22 09:34:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 12 ms.
[2023-03-22 09:34:54] [INFO ] Time to serialize gal into /tmp/LTLFireability10960725770499845612.gal : 5 ms
[2023-03-22 09:34:54] [INFO ] Time to serialize properties into /tmp/LTLFireability8171814893443121634.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10960725770499845612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8171814893443121634.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(((((i5.i0.u7.x_1<1)||(i5.i0.u14.P_ifxi_10_1<1))&&((i0.i0.u8.x_2<1)||(i0.i0.u17.P_ifxi_10_2<1)))&&(((i4.i0.u12.x_3<1)||...3168
Formula 0 simplified : XXG(FG!"(((((i5.i0.u7.x_1<1)||(i5.i0.u14.P_ifxi_10_1<1))&&((i0.i0.u8.x_2<1)||(i0.i0.u17.P_ifxi_10_2<1)))&&(((i4.i0.u12.x_3<1)||(i4.i...3154
Compilation finished in 1004 ms.
Running link step : cd /tmp/ltsmin14495776463838706931;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14495776463838706931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.015: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: LTL layer: formula: X(X(<>(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&<>((LTLAPp0==true)))))))
pins2lts-mc-linux64( 5/ 8), 0.014: "X(X(<>(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&<>((LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.014: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.034: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.034: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.049: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.049: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.088: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.112: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.233: DFS-FIFO for weak LTL, using special progress label 465
pins2lts-mc-linux64( 0/ 8), 0.233: There are 466 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.233: State length is 220, there are 467 groups
pins2lts-mc-linux64( 0/ 8), 0.233: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.233: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.233: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.233: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 1.566: ~7 levels ~960 states ~2520 transitions
pins2lts-mc-linux64( 7/ 8), 1.629: ~8 levels ~1920 states ~7000 transitions
pins2lts-mc-linux64( 7/ 8), 1.724: ~8 levels ~3840 states ~10864 transitions
pins2lts-mc-linux64( 7/ 8), 2.146: ~8 levels ~7680 states ~21112 transitions
pins2lts-mc-linux64( 4/ 8), 2.287: ~15 levels ~15360 states ~24888 transitions
pins2lts-mc-linux64( 6/ 8), 2.517: ~15 levels ~30720 states ~65496 transitions
pins2lts-mc-linux64( 7/ 8), 2.843: ~9 levels ~61440 states ~128608 transitions
pins2lts-mc-linux64( 7/ 8), 3.551: ~16 levels ~122880 states ~232968 transitions
pins2lts-mc-linux64( 7/ 8), 4.817: ~17 levels ~245760 states ~450576 transitions
pins2lts-mc-linux64( 7/ 8), 7.173: ~17 levels ~491520 states ~878120 transitions
pins2lts-mc-linux64( 4/ 8), 11.098: ~22 levels ~983040 states ~1703456 transitions
pins2lts-mc-linux64( 3/ 8), 18.797: ~18 levels ~1966080 states ~3497728 transitions
pins2lts-mc-linux64( 4/ 8), 34.960: ~26 levels ~3932160 states ~8115040 transitions
pins2lts-mc-linux64( 7/ 8), 66.450: ~26 levels ~7864320 states ~14542968 transitions
pins2lts-mc-linux64( 3/ 8), 129.953: ~26 levels ~15728640 states ~33208968 transitions
pins2lts-mc-linux64( 1/ 8), 260.790: ~27 levels ~31457280 states ~66996744 transitions
pins2lts-mc-linux64( 4/ 8), 374.144: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 374.238:
pins2lts-mc-linux64( 0/ 8), 374.238: mean standard work distribution: 8.5% (states) 8.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 374.238:
pins2lts-mc-linux64( 0/ 8), 374.239: Explored 42848349 states 94136479 transitions, fanout: 2.197
pins2lts-mc-linux64( 0/ 8), 374.239: Total exploration time 373.990 sec (373.930 sec minimum, 373.970 sec on average)
pins2lts-mc-linux64( 0/ 8), 374.239: States per second: 114571, Transitions per second: 251709
pins2lts-mc-linux64( 0/ 8), 374.239:
pins2lts-mc-linux64( 0/ 8), 374.239: Progress states detected: 83215
pins2lts-mc-linux64( 0/ 8), 374.239: Redundant explorations: -0.0859
pins2lts-mc-linux64( 0/ 8), 374.239:
pins2lts-mc-linux64( 0/ 8), 374.239: Queue width: 8B, total height: 64918, memory: 0.50MB
pins2lts-mc-linux64( 0/ 8), 374.239: Tree memory: 583.2MB, 14.3 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 374.239: Tree fill ratio (roots/leafs): 31.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 374.239: Stored 512 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 374.239: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 374.239: Est. total memory use: 583.7MB (~1024.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14495776463838706931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14495776463838706931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(([](<>((LTLAPp0==true)))||((LTLAPp1==true)&&<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t17, t18, t19, t20, t21, t23, t25, t26, t27, t28, t29, t31, t32, t34, t35, t36, t37...1779
Detected timeout of ITS tools.
[2023-03-22 09:56:26] [INFO ] Applying decomposition
[2023-03-22 09:56:26] [INFO ] Flatten gal took : 16 ms
[2023-03-22 09:56:26] [INFO ] Decomposing Gal with order
[2023-03-22 09:56:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 09:56:26] [INFO ] Removed a total of 723 redundant transitions.
[2023-03-22 09:56:26] [INFO ] Flatten gal took : 28 ms
[2023-03-22 09:56:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2023-03-22 09:56:26] [INFO ] Time to serialize gal into /tmp/LTLFireability6433516612565760229.gal : 3 ms
[2023-03-22 09:56:27] [INFO ] Time to serialize properties into /tmp/LTLFireability8626916131662817302.ltl : 94 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6433516612565760229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8626916131662817302.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F("(((((pid1.x_1<1)||(pid1.P_ifxi_10_1<1))&&((pid2.x_2<1)||(pid2.P_ifxi_10_2<1)))&&(((pid3.x_3<1)||(pid3.P_ifxi_10_3<1))&&...2619
Formula 0 simplified : XXG(FG!"(((((pid1.x_1<1)||(pid1.P_ifxi_10_1<1))&&((pid2.x_2<1)||(pid2.P_ifxi_10_2<1)))&&(((pid3.x_3<1)||(pid3.P_ifxi_10_3<1))&&((pid...2605
Detected timeout of ITS tools.
[2023-03-22 10:18:07] [INFO ] Flatten gal took : 243 ms
[2023-03-22 10:18:08] [INFO ] Input system was already deterministic with 462 transitions.
[2023-03-22 10:18:08] [INFO ] Transformed 219 places.
[2023-03-22 10:18:08] [INFO ] Transformed 462 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-22 10:18:08] [INFO ] Time to serialize gal into /tmp/LTLFireability10247445128243621314.gal : 8 ms
[2023-03-22 10:18:08] [INFO ] Time to serialize properties into /tmp/LTLFireability111677267221926640.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10247445128243621314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability111677267221926640.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F((G(F("(((((x_1<1)||(P_ifxi_10_1<1))&&((x_2<1)||(P_ifxi_10_2<1)))&&(((x_3<1)||(P_ifxi_10_3<1))&&((x_4<1)||(P_ifxi_10_4<1))))&&...1989
Formula 0 simplified : XXG(FG!"(((((x_1<1)||(P_ifxi_10_1<1))&&((x_2<1)||(P_ifxi_10_2<1)))&&(((x_3<1)||(P_ifxi_10_3<1))&&((x_4<1)||(P_ifxi_10_4<1))))&&((((x...1975
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 166232 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16056844 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-7"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is LamportFastMutEx-COL-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r229-tall-167856413200380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;