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.r325-tall-167889197700812.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 RingSingleMessageInMbox-PT-d0m040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889197700812
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 6.6K Feb 26 05:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 05:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 05:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 05:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 05:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 05:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 05:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K Mar 5 18:23 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 RingSingleMessageInMbox-PT-d0m040-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679037301813

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=RingSingleMessageInMbox-PT-d0m040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-17 07:15:03] [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-17 07:15:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 07:15:03] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-17 07:15:03] [INFO ] Transformed 385 places.
[2023-03-17 07:15:03] [INFO ] Transformed 59 transitions.
[2023-03-17 07:15:03] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 52 transition count 57
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 52 transition count 57
Applied a total of 6 rules in 12 ms. Remains 52 /56 variables (removed 4) and now considering 57/59 (removed 2) transitions.
// Phase 1: matrix 57 rows 52 cols
[2023-03-17 07:15:03] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-17 07:15:03] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-17 07:15:03] [INFO ] Invariant cache hit.
[2023-03-17 07:15:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-17 07:15:03] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-17 07:15:03] [INFO ] Invariant cache hit.
[2023-03-17 07:15:03] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 57/59 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 52/56 places, 57/59 transitions.
Support contains 22 out of 52 places after structural reductions.
[2023-03-17 07:15:04] [INFO ] Flatten gal took : 28 ms
[2023-03-17 07:15:04] [INFO ] Flatten gal took : 8 ms
[2023-03-17 07:15:04] [INFO ] Input system was already deterministic with 57 transitions.
Incomplete random walk after 10000 steps, including 2173 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 506 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-17 07:15:05] [INFO ] Invariant cache hit.
[2023-03-17 07:15:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 07:15:05] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:05] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:5
[2023-03-17 07:15:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-17 07:15:05] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:05] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-17 07:15:05] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-17 07:15:05] [INFO ] After 39ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2023-03-17 07:15:05] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-17 07:15:05] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 57/57 transitions.
Graph (complete) has 137 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 51 transition count 54
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 48 transition count 49
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 48 transition count 49
Applied a total of 10 rules in 9 ms. Remains 48 /52 variables (removed 4) and now considering 49/57 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 48/52 places, 49/57 transitions.
Incomplete random walk after 10000 steps, including 2163 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1080414 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :{0=1, 3=1, 4=1}
Probabilistic random walk after 1080414 steps, saw 416152 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 49 rows 48 cols
[2023-03-17 07:15:09] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-17 07:15:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-17 07:15:09] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:09] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 07:15:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 07:15:09] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:09] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 07:15:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 07:15:09] [INFO ] After 18ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 07:15:09] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-17 07:15:09] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 48/48 places, 49/49 transitions.
Incomplete random walk after 10000 steps, including 2179 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1269920 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :{}
Probabilistic random walk after 1269920 steps, saw 487442 distinct states, run finished after 3001 ms. (steps per millisecond=423 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 07:15:12] [INFO ] Invariant cache hit.
[2023-03-17 07:15:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-17 07:15:12] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:12] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 07:15:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 07:15:12] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:12] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 07:15:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 07:15:12] [INFO ] After 10ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 07:15:12] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-17 07:15:12] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 49/49 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 48/48 places, 49/49 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 49/49 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 49/49 (removed 0) transitions.
[2023-03-17 07:15:12] [INFO ] Invariant cache hit.
[2023-03-17 07:15:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-17 07:15:12] [INFO ] Invariant cache hit.
[2023-03-17 07:15:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 07:15:12] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-17 07:15:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 07:15:12] [INFO ] Invariant cache hit.
[2023-03-17 07:15:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 48/48 places, 49/49 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 1 place count 48 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 13 place count 42 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 37 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 36 transition count 37
Applied a total of 25 rules in 7 ms. Remains 36 /48 variables (removed 12) and now considering 37/49 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 37 rows 36 cols
[2023-03-17 07:15:12] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-17 07:15:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 07:15:12] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-17 07:15:12] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 07:15:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 07:15:12] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-17 07:15:12] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 07:15:12] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
[2023-03-17 07:15:12] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2023-03-17 07:15:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 60 ms
[2023-03-17 07:15:12] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-17 07:15:12] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 159 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 52
Applied a total of 10 rules in 7 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
// Phase 1: matrix 52 rows 47 cols
[2023-03-17 07:15:13] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-17 07:15:13] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-17 07:15:13] [INFO ] Invariant cache hit.
[2023-03-17 07:15:13] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-17 07:15:13] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-17 07:15:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 07:15:13] [INFO ] Invariant cache hit.
[2023-03-17 07:15:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/52 places, 52/57 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23152 reset in 214 ms.
Product exploration explored 100000 steps with 23075 reset in 123 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 145 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 27 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 52/52 transitions.
Applied a total of 0 rules in 7 ms. Remains 47 /47 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-17 07:15:14] [INFO ] Invariant cache hit.
[2023-03-17 07:15:14] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-17 07:15:14] [INFO ] Invariant cache hit.
[2023-03-17 07:15:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-17 07:15:14] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-17 07:15:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 07:15:14] [INFO ] Invariant cache hit.
[2023-03-17 07:15:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 47/47 places, 52/52 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 145 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23249 reset in 77 ms.
Product exploration explored 100000 steps with 23283 reset in 165 ms.
Built C files in :
/tmp/ltsmin4862768192146498607
[2023-03-17 07:15:15] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2023-03-17 07:15:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 07:15:15] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2023-03-17 07:15:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 07:15:15] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2023-03-17 07:15:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 07:15:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4862768192146498607
Running compilation step : cd /tmp/ltsmin4862768192146498607;'/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 199 ms.
Running link step : cd /tmp/ltsmin4862768192146498607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4862768192146498607;'/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/stateBased4898803865842758545.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 52/52 transitions.
Applied a total of 0 rules in 7 ms. Remains 47 /47 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-17 07:15:30] [INFO ] Invariant cache hit.
[2023-03-17 07:15:30] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-17 07:15:30] [INFO ] Invariant cache hit.
[2023-03-17 07:15:30] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-17 07:15:30] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-17 07:15:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 07:15:30] [INFO ] Invariant cache hit.
[2023-03-17 07:15:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 47/47 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin826710405618718579
[2023-03-17 07:15:30] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2023-03-17 07:15:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 07:15:30] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2023-03-17 07:15:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 07:15:30] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2023-03-17 07:15:30] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 07:15:30] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin826710405618718579
Running compilation step : cd /tmp/ltsmin826710405618718579;'/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 136 ms.
Running link step : cd /tmp/ltsmin826710405618718579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin826710405618718579;'/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/stateBased12319781633786390842.hoa' '--buchi-type=spotba'
LTSmin run took 11032 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-00 finished in 28615 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&&X(G(!p0))))))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 52
Applied a total of 10 rules in 3 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
[2023-03-17 07:15:41] [INFO ] Invariant cache hit.
[2023-03-17 07:15:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-17 07:15:41] [INFO ] Invariant cache hit.
[2023-03-17 07:15:41] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-17 07:15:41] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-17 07:15:41] [INFO ] Invariant cache hit.
[2023-03-17 07:15:41] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 52/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, true, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-02 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' '!((X(p0)||F(p1)))'
Support contains 5 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 9 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-17 07:15:41] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-17 07:15:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-17 07:15:42] [INFO ] Invariant cache hit.
[2023-03-17 07:15:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-17 07:15:42] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-17 07:15:42] [INFO ] Invariant cache hit.
[2023-03-17 07:15:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s15 1)), p0:(OR (AND (GEQ s1 1) (GEQ s20 1) (GEQ s1 1) (GEQ s45 1)) (AND (GEQ s1 1) (GEQ s45 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]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-05 finished in 273 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((X(G(p1))||F(p2)))&&p0))))'
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 47 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 49
Applied a total of 12 rules in 7 ms. Remains 46 /52 variables (removed 6) and now considering 49/57 (removed 8) transitions.
// Phase 1: matrix 49 rows 46 cols
[2023-03-17 07:15:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-17 07:15:42] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-17 07:15:42] [INFO ] Invariant cache hit.
[2023-03-17 07:15:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-17 07:15:42] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-17 07:15:42] [INFO ] Invariant cache hit.
[2023-03-17 07:15:42] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 49/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={0, 1} source=5 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s20 1)), p2:(AND (GEQ s10 1) (GEQ s20 1)), p1:(OR (LT s8 1) (LT s28 1))], nbAcceptance=2, 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-07 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&X(p1)&&(G(X(p1))||p0))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 47 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 49
Applied a total of 12 rules in 6 ms. Remains 46 /52 variables (removed 6) and now considering 49/57 (removed 8) transitions.
[2023-03-17 07:15:42] [INFO ] Invariant cache hit.
[2023-03-17 07:15:42] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-17 07:15:42] [INFO ] Invariant cache hit.
[2023-03-17 07:15:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-17 07:15:42] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-17 07:15:42] [INFO ] Invariant cache hit.
[2023-03-17 07:15:42] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/52 places, 49/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s38 1)), p1:(AND (GEQ s1 1) (GEQ s16 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 RingSingleMessageInMbox-PT-d0m040-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-09 finished in 306 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(p0)||X((!p0 U !p1))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 52
Applied a total of 10 rules in 6 ms. Remains 47 /52 variables (removed 5) and now considering 52/57 (removed 5) transitions.
// Phase 1: matrix 52 rows 47 cols
[2023-03-17 07:15:43] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-17 07:15:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-17 07:15:43] [INFO ] Invariant cache hit.
[2023-03-17 07:15:43] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-17 07:15:43] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-17 07:15:43] [INFO ] Invariant cache hit.
[2023-03-17 07:15:43] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 52/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 47/52 places, 52/57 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, p1, (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s21 1)), p1:(AND (GEQ s1 1) (GEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 145 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 7 factoid took 114 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-10 finished in 677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 47 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 46 transition count 49
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 46 transition count 49
Applied a total of 12 rules in 10 ms. Remains 46 /52 variables (removed 6) and now considering 49/57 (removed 8) transitions.
// Phase 1: matrix 49 rows 46 cols
[2023-03-17 07:15:43] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 07:15:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-17 07:15:43] [INFO ] Invariant cache hit.
[2023-03-17 07:15:43] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-17 07:15:43] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-17 07:15:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 07:15:43] [INFO ] Invariant cache hit.
[2023-03-17 07:15:43] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/52 places, 49/57 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 46/52 places, 49/57 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-11 finished in 203 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(p0)||(G(!p1) U !p0)))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 7 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-17 07:15:43] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 07:15:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-17 07:15:43] [INFO ] Invariant cache hit.
[2023-03-17 07:15:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 07:15:43] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-17 07:15:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 07:15:43] [INFO ] Invariant cache hit.
[2023-03-17 07:15:44] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, false, p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s41 1) (LT s1 1) (LT s16 1)), p1:(AND (GEQ s1 1) (GEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 21551 reset in 144 ms.
Product exploration explored 100000 steps with 21519 reset in 135 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 144 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 461 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (AND p1 (NOT p0)), p1, (NOT p0), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2164 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 511 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 516 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 876828 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{0=1, 4=1, 5=1}
Probabilistic random walk after 876828 steps, saw 339293 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :3
Running SMT prover for 3 properties.
[2023-03-17 07:15:48] [INFO ] Invariant cache hit.
[2023-03-17 07:15:48] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-17 07:15:48] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:48] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-17 07:15:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-17 07:15:48] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:48] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-17 07:15:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 07:15:48] [INFO ] After 9ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-17 07:15:48] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-17 07:15:48] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 124 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 47
Applied a total of 4 rules in 11 ms. Remains 46 /47 variables (removed 1) and now considering 47/50 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 46/47 places, 47/50 transitions.
Incomplete random walk after 10000 steps, including 2203 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1219454 steps, run timeout after 3001 ms. (steps per millisecond=406 ) properties seen :{}
Probabilistic random walk after 1219454 steps, saw 470975 distinct states, run finished after 3001 ms. (steps per millisecond=406 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 47 rows 46 cols
[2023-03-17 07:15:52] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-17 07:15:52] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-17 07:15:52] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-17 07:15:52] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 07:15:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-17 07:15:52] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 07:15:52] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 07:15:52] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 07:15:52] [INFO ] After 9ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 07:15:52] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 07:15:52] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/46 places, 47/47 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-17 07:15:52] [INFO ] Invariant cache hit.
[2023-03-17 07:15:52] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-17 07:15:52] [INFO ] Invariant cache hit.
[2023-03-17 07:15:52] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 07:15:52] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-17 07:15:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 07:15:52] [INFO ] Invariant cache hit.
[2023-03-17 07:15:52] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 46/46 places, 47/47 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 46
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 1 place count 46 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 13 place count 40 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 35 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 34 transition count 35
Applied a total of 25 rules in 5 ms. Remains 34 /46 variables (removed 12) and now considering 35/47 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 35 rows 34 cols
[2023-03-17 07:15:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-17 07:15:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 07:15:52] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-17 07:15:52] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 07:15:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 07:15:52] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:52] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 07:15:52] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-17 07:15:52] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 14 factoid took 555 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-17 07:15:53] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 07:15:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 07:15:53] [INFO ] Invariant cache hit.
[2023-03-17 07:15:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 07:15:53] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-17 07:15:53] [INFO ] Invariant cache hit.
[2023-03-17 07:15:53] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 47/47 places, 50/50 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 144 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2127 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3703850 steps, run timeout after 3001 ms. (steps per millisecond=1234 ) properties seen :{}
Probabilistic random walk after 3703850 steps, saw 1420511 distinct states, run finished after 3001 ms. (steps per millisecond=1234 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 07:15:56] [INFO ] Invariant cache hit.
[2023-03-17 07:15:56] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-17 07:15:56] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-17 07:15:56] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 07:15:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-17 07:15:56] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-17 07:15:56] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 07:15:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 07:15:56] [INFO ] After 5ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 07:15:56] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-17 07:15:56] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 50/50 transitions.
Graph (complete) has 124 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 47
Applied a total of 4 rules in 2 ms. Remains 46 /47 variables (removed 1) and now considering 47/50 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 46/47 places, 47/50 transitions.
Incomplete random walk after 10000 steps, including 2148 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3953921 steps, run timeout after 3001 ms. (steps per millisecond=1317 ) properties seen :{}
Probabilistic random walk after 3953921 steps, saw 1504073 distinct states, run finished after 3001 ms. (steps per millisecond=1317 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 47 rows 46 cols
[2023-03-17 07:15:59] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 07:15:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-17 07:15:59] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:59] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 07:15:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 07:15:59] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-17 07:15:59] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 07:15:59] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 07:15:59] [INFO ] After 6ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 07:15:59] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-17 07:15:59] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/46 places, 47/47 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2023-03-17 07:15:59] [INFO ] Invariant cache hit.
[2023-03-17 07:15:59] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-17 07:15:59] [INFO ] Invariant cache hit.
[2023-03-17 07:15:59] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 07:15:59] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-17 07:15:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 07:15:59] [INFO ] Invariant cache hit.
[2023-03-17 07:15:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 46/46 places, 47/47 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 46
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 1 place count 46 transition count 40
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 13 place count 40 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 35 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 34 transition count 35
Applied a total of 25 rules in 6 ms. Remains 34 /46 variables (removed 12) and now considering 35/47 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 34 cols
[2023-03-17 07:15:59] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-17 07:15:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-17 07:15:59] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-17 07:15:59] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 07:15:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-17 07:15:59] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 07:15:59] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 07:15:59] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-17 07:15:59] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21679 reset in 78 ms.
Product exploration explored 100000 steps with 21505 reset in 80 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Applied a total of 0 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-17 07:16:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 47 cols
[2023-03-17 07:16:00] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 07:16:00] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 47/47 places, 50/50 transitions.
Built C files in :
/tmp/ltsmin2562308194824437076
[2023-03-17 07:16:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2562308194824437076
Running compilation step : cd /tmp/ltsmin2562308194824437076;'/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 122 ms.
Running link step : cd /tmp/ltsmin2562308194824437076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2562308194824437076;'/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/stateBased1343530977754008478.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-17 07:16:15] [INFO ] Invariant cache hit.
[2023-03-17 07:16:15] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-17 07:16:15] [INFO ] Invariant cache hit.
[2023-03-17 07:16:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 07:16:15] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-17 07:16:15] [INFO ] Invariant cache hit.
[2023-03-17 07:16:15] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 47/47 places, 50/50 transitions.
Built C files in :
/tmp/ltsmin1528071165391102531
[2023-03-17 07:16:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1528071165391102531
Running compilation step : cd /tmp/ltsmin1528071165391102531;'/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 122 ms.
Running link step : cd /tmp/ltsmin1528071165391102531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1528071165391102531;'/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/stateBased3401309997125606478.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-17 07:16:31] [INFO ] Flatten gal took : 6 ms
[2023-03-17 07:16:31] [INFO ] Flatten gal took : 4 ms
[2023-03-17 07:16:31] [INFO ] Time to serialize gal into /tmp/LTL11473934456856592708.gal : 2 ms
[2023-03-17 07:16:31] [INFO ] Time to serialize properties into /tmp/LTL17950822984706224727.prop : 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/LTL11473934456856592708.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15352996908199800749.hoa' '-atoms' '/tmp/LTL17950822984706224727.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...320
Loading property file /tmp/LTL17950822984706224727.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15352996908199800749.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t9, t12, t33, t40, t41, t42, t43, t44, t45, t46, t47, t51, t55, Intersection with re...232
Computing Next relation with stutter on 1.18888e+07 deadlock states
Detected timeout of ITS tools.
[2023-03-17 07:16:46] [INFO ] Flatten gal took : 4 ms
[2023-03-17 07:16:46] [INFO ] Flatten gal took : 4 ms
[2023-03-17 07:16:46] [INFO ] Time to serialize gal into /tmp/LTL5311715080627651922.gal : 1 ms
[2023-03-17 07:16:46] [INFO ] Time to serialize properties into /tmp/LTL70953381563136382.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/LTL5311715080627651922.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL70953381563136382.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...273
Read 1 LTL properties
Checking formula 0 : !(((G("(((s1<1)||(l356<1))||((s1<1)||(l40<1)))"))||((G(!("((s1>=1)&&(l356>=1))")))U(!("(((s1<1)||(l356<1))||((s1<1)||(l40<1)))")))))
Formula 0 simplified : F!"(((s1<1)||(l356<1))||((s1<1)||(l40<1)))" & (F"((s1>=1)&&(l356>=1))" R "(((s1<1)||(l356<1))||((s1<1)||(l40<1)))")
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t9, t12, t33, t40, t41, t42, t43, t44, t45, t46, t47, t51, t55, Intersection with re...232
Computing Next relation with stutter on 1.18888e+07 deadlock states
Detected timeout of ITS tools.
[2023-03-17 07:17:01] [INFO ] Flatten gal took : 5 ms
[2023-03-17 07:17:01] [INFO ] Applying decomposition
[2023-03-17 07:17:01] [INFO ] Flatten gal took : 5 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/graph6349648165351208515.txt' '-o' '/tmp/graph6349648165351208515.bin' '-w' '/tmp/graph6349648165351208515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6349648165351208515.bin' '-l' '-1' '-v' '-w' '/tmp/graph6349648165351208515.weights' '-q' '0' '-e' '0.001'
[2023-03-17 07:17:01] [INFO ] Decomposing Gal with order
[2023-03-17 07:17:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 07:17:01] [INFO ] Removed a total of 44 redundant transitions.
[2023-03-17 07:17:01] [INFO ] Flatten gal took : 28 ms
[2023-03-17 07:17:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 3 ms.
[2023-03-17 07:17:01] [INFO ] Time to serialize gal into /tmp/LTL12603800660979843607.gal : 2 ms
[2023-03-17 07:17:01] [INFO ] Time to serialize properties into /tmp/LTL3308403628953373200.ltl : 2 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/LTL12603800660979843607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3308403628953373200.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...255
Read 1 LTL properties
Checking formula 0 : !(((G("(((i3.u0.s1<1)||(u11.l356<1))||((i3.u0.s1<1)||(u1.l40<1)))"))||((G(!("((i3.u0.s1>=1)&&(u11.l356>=1))")))U(!("(((i3.u0.s1<1)||(u...201
Formula 0 simplified : F!"(((i3.u0.s1<1)||(u11.l356<1))||((i3.u0.s1<1)||(u1.l40<1)))" & (F"((i3.u0.s1>=1)&&(u11.l356>=1))" R "(((i3.u0.s1<1)||(u11.l356<1))...186
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7543371808226139814
[2023-03-17 07:17:16] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7543371808226139814
Running compilation step : cd /tmp/ltsmin7543371808226139814;'/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 124 ms.
Running link step : cd /tmp/ltsmin7543371808226139814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7543371808226139814;'/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' '([]((LTLAPp0==true))||([](!(LTLAPp1==true)) U !(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-13 finished in 107645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 3 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
[2023-03-17 07:17:31] [INFO ] Invariant cache hit.
[2023-03-17 07:17:31] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-17 07:17:31] [INFO ] Invariant cache hit.
[2023-03-17 07:17:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 07:17:31] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-17 07:17:31] [INFO ] Invariant cache hit.
[2023-03-17 07:17:31] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s41 1)), p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-14 finished in 316 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(!p0)) U (F(p1)&&(p2||X(G(!p0))))))'
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 57/57 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 48 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 47 transition count 50
Applied a total of 10 rules in 2 ms. Remains 47 /52 variables (removed 5) and now considering 50/57 (removed 7) transitions.
// Phase 1: matrix 50 rows 47 cols
[2023-03-17 07:17:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 07:17:31] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-17 07:17:31] [INFO ] Invariant cache hit.
[2023-03-17 07:17:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-17 07:17:31] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-17 07:17:31] [INFO ] Invariant cache hit.
[2023-03-17 07:17:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/52 places, 50/57 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 47/52 places, 50/57 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (NOT p1), p0, p0, (AND (NOT p1) p0), true]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s27 1)), p2:(AND (GEQ s10 1) (GEQ s15 1)), p0:(AND (GEQ s11 1) (GEQ s21 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m040-LTLFireability-15 finished in 355 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(p0)||(G(!p1) U !p0)))'
[2023-03-17 07:17:32] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11734543175105854411
[2023-03-17 07:17:32] [INFO ] Computing symmetric may disable matrix : 57 transitions.
[2023-03-17 07:17:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 07:17:32] [INFO ] Computing symmetric may enable matrix : 57 transitions.
[2023-03-17 07:17:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 07:17:32] [INFO ] Computing Do-Not-Accords matrix : 57 transitions.
[2023-03-17 07:17:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-17 07:17:32] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11734543175105854411
Running compilation step : cd /tmp/ltsmin11734543175105854411;'/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-17 07:17:32] [INFO ] Applying decomposition
[2023-03-17 07:17:32] [INFO ] Flatten gal took : 3 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/graph6632933251615080878.txt' '-o' '/tmp/graph6632933251615080878.bin' '-w' '/tmp/graph6632933251615080878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6632933251615080878.bin' '-l' '-1' '-v' '-w' '/tmp/graph6632933251615080878.weights' '-q' '0' '-e' '0.001'
[2023-03-17 07:17:32] [INFO ] Decomposing Gal with order
[2023-03-17 07:17:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-17 07:17:32] [INFO ] Removed a total of 48 redundant transitions.
[2023-03-17 07:17:32] [INFO ] Flatten gal took : 8 ms
[2023-03-17 07:17:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 1 ms.
[2023-03-17 07:17:32] [INFO ] Time to serialize gal into /tmp/LTLFireability12351610864792015600.gal : 1 ms
[2023-03-17 07:17:32] [INFO ] Time to serialize properties into /tmp/LTLFireability13752547732964158205.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/LTLFireability12351610864792015600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13752547732964158205.ltl' '-c' '-stutter-deadlock'
Compilation finished in 140 ms.
Running link step : cd /tmp/ltsmin11734543175105854411;'gcc' '-shared' '-o' 'gal.so' 'model.o'

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...278
Read 1 LTL properties
Checking formula 0 : !(((G("(((i0.u0.s1<1)||(u11.l356<1))||((i0.u0.s1<1)||(u1.l40<1)))"))||((G(!("((i0.u0.s1>=1)&&(u11.l356>=1))")))U(!("(((i0.u0.s1<1)||(u...201
Formula 0 simplified : F!"(((i0.u0.s1<1)||(u11.l356<1))||((i0.u0.s1<1)||(u1.l40<1)))" & (F"((i0.u0.s1>=1)&&(u11.l356>=1))" R "(((i0.u0.s1<1)||(u11.l356<1))...186
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin11734543175105854411;'/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' '--ltl' '([]((LTLAPp0==true))||([](!(LTLAPp1==true)) U !(LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 83029 ms.
FORMULA RingSingleMessageInMbox-PT-d0m040-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 232328 ms.

BK_STOP 1679037536492

--------------------
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="RingSingleMessageInMbox-PT-d0m040"
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 RingSingleMessageInMbox-PT-d0m040, 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 r325-tall-167889197700812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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