Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282800868.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d0m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282800868
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 9.7K Jun 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Jun 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Jun 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 57K Jun 6 12:11 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 SieveSingleMsgMbox-PT-d0m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654946150666

Running Version 202205111006
[2022-06-11 11:15:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 11:15:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 11:15:51] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2022-06-11 11:15:52] [INFO ] Transformed 262 places.
[2022-06-11 11:15:52] [INFO ] Transformed 73 transitions.
[2022-06-11 11:15:52] [INFO ] Parsed PT model containing 262 places and 73 transitions in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 63 transition count 66
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 63 transition count 66
Applied a total of 16 rules in 15 ms. Remains 63 /72 variables (removed 9) and now considering 66/73 (removed 7) transitions.
// Phase 1: matrix 66 rows 63 cols
[2022-06-11 11:15:52] [INFO ] Computed 5 place invariants in 9 ms
[2022-06-11 11:15:52] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 66 rows 63 cols
[2022-06-11 11:15:52] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 11:15:52] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:15:52] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 63 cols
[2022-06-11 11:15:52] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-11 11:15:52] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/72 places, 66/73 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/72 places, 66/73 transitions.
Support contains 27 out of 63 places after structural reductions.
[2022-06-11 11:15:52] [INFO ] Flatten gal took : 32 ms
[2022-06-11 11:15:52] [INFO ] Flatten gal took : 10 ms
[2022-06-11 11:15:52] [INFO ] Input system was already deterministic with 66 transitions.
Support contains 25 out of 63 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2210 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 22) seen :7
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 109 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 119 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 153 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 102 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 66 rows 63 cols
[2022-06-11 11:15:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:15:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:15:53] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 11:15:53] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2022-06-11 11:15:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 11:15:53] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:15:53] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2022-06-11 11:15:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:15:54] [INFO ] After 159ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :14
[2022-06-11 11:15:54] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-06-11 11:15:54] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 218 ms.
Support contains 17 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 65
Applied a total of 2 rules in 18 ms. Remains 62 /63 variables (removed 1) and now considering 65/66 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/63 places, 65/66 transitions.
Incomplete random walk after 10000 steps, including 2223 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 498 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1044 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 510 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1011 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1027 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1037 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 65 rows 62 cols
[2022-06-11 11:15:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:15:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:15:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:15:56] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-11 11:15:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:15:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:15:56] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-06-11 11:15:56] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:15:56] [INFO ] After 80ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2022-06-11 11:15:56] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-06-11 11:15:56] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 3 properties in 120 ms.
Support contains 13 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 64
Applied a total of 2 rules in 6 ms. Remains 61 /62 variables (removed 1) and now considering 64/65 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 64/65 transitions.
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1054 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 995 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 495 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 1068 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Finished probabilistic random walk after 1208 steps, run visited all 9 properties in 26 ms. (steps per millisecond=46 )
Probabilistic random walk after 1208 steps, saw 593 distinct states, run finished after 26 ms. (steps per millisecond=46 ) properties seen :9
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G((F(p0)&&p1)))))))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 60 transition count 62
Applied a total of 7 rules in 14 ms. Remains 60 /63 variables (removed 3) and now considering 62/66 (removed 4) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:15:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:15:58] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:15:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:15:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:15:58] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2022-06-11 11:15:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:15:58] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 11:15:58] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/63 places, 62/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/63 places, 62/66 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s10 1) (LT s19 1)), p0:(OR (LT s1 1) (LT s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22417 reset in 348 ms.
Product exploration explored 100000 steps with 22332 reset in 173 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 256 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1025 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Finished probabilistic random walk after 324 steps, run visited all 3 properties in 7 ms. (steps per millisecond=46 )
Probabilistic random walk after 324 steps, saw 181 distinct states, run finished after 7 ms. (steps per millisecond=46 ) properties seen :3
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:16:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:16:00] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:16:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:16:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:16:00] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2022-06-11 11:16:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:16:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:16:00] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1045 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Finished probabilistic random walk after 324 steps, run visited all 3 properties in 5 ms. (steps per millisecond=64 )
Probabilistic random walk after 324 steps, saw 181 distinct states, run finished after 6 ms. (steps per millisecond=54 ) properties seen :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 22364 reset in 102 ms.
Product exploration explored 100000 steps with 22492 reset in 189 ms.
Built C files in :
/tmp/ltsmin12501734128568707534
[2022-06-11 11:16:01] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2022-06-11 11:16:01] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:16:01] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2022-06-11 11:16:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:16:01] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2022-06-11 11:16:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:16:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12501734128568707534
Running compilation step : cd /tmp/ltsmin12501734128568707534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 250 ms.
Running link step : cd /tmp/ltsmin12501734128568707534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12501734128568707534;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2538386111326435539.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:16:17] [INFO ] Computed 5 place invariants in 3 ms
[2022-06-11 11:16:17] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:16:17] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:16:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:16:17] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-06-11 11:16:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:16:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:16:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 62/62 transitions.
Built C files in :
/tmp/ltsmin9597977056674067663
[2022-06-11 11:16:17] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2022-06-11 11:16:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:16:17] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2022-06-11 11:16:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:16:17] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2022-06-11 11:16:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:16:17] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9597977056674067663
Running compilation step : cd /tmp/ltsmin9597977056674067663;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin9597977056674067663;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9597977056674067663;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3569422848719588280.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 11:16:32] [INFO ] Flatten gal took : 7 ms
[2022-06-11 11:16:32] [INFO ] Flatten gal took : 5 ms
[2022-06-11 11:16:32] [INFO ] Time to serialize gal into /tmp/LTL1532309050725359518.gal : 2 ms
[2022-06-11 11:16:32] [INFO ] Time to serialize properties into /tmp/LTL18389584387772085951.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1532309050725359518.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18389584387772085951.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1532309...267
Read 1 LTL properties
Checking formula 0 : !((X(F(X(F(G((F("((s1<1)||(l235<1))"))&&("((p12<1)||(l0<1))"))))))))
Formula 0 simplified : !XFXFG("((p12<1)||(l0<1))" & F"((s1<1)||(l235<1))")
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t53, t55, t57, t58, t59, t60, t61, t63, t65, Intersection...240
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2022-06-11 11:16:47] [INFO ] Flatten gal took : 9 ms
[2022-06-11 11:16:47] [INFO ] Applying decomposition
[2022-06-11 11:16:47] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17681423805632419092.txt' '-o' '/tmp/graph17681423805632419092.bin' '-w' '/tmp/graph17681423805632419092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17681423805632419092.bin' '-l' '-1' '-v' '-w' '/tmp/graph17681423805632419092.weights' '-q' '0' '-e' '0.001'
[2022-06-11 11:16:47] [INFO ] Decomposing Gal with order
[2022-06-11 11:16:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 11:16:47] [INFO ] Removed a total of 57 redundant transitions.
[2022-06-11 11:16:47] [INFO ] Flatten gal took : 34 ms
[2022-06-11 11:16:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2022-06-11 11:16:47] [INFO ] Time to serialize gal into /tmp/LTL17596374127961458765.gal : 2 ms
[2022-06-11 11:16:47] [INFO ] Time to serialize properties into /tmp/LTL4770207011058206780.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17596374127961458765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4770207011058206780.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1759637...246
Read 1 LTL properties
Checking formula 0 : !((X(F(X(F(G((F("((i4.u0.s1<1)||(i6.u14.l235<1))"))&&("((i4.u10.p12<1)||(i4.u0.l0<1))"))))))))
Formula 0 simplified : !XFXFG("((i4.u10.p12<1)||(i4.u0.l0<1))" & F"((i4.u0.s1<1)||(i6.u14.l235<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18385523389948996736
[2022-06-11 11:17:02] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18385523389948996736
Running compilation step : cd /tmp/ltsmin18385523389948996736;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin18385523389948996736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18385523389948996736;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(<>([]((<>((LTLAPp0==true))&&(LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-00 finished in 79596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 60 transition count 62
Applied a total of 7 rules in 12 ms. Remains 60 /63 variables (removed 3) and now considering 62/66 (removed 4) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:17:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:17] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:17:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:17:17] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:17:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:18] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/63 places, 62/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/63 places, 62/66 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LT s9 1) (LT s19 1)), p0:(OR (LT s1 1) (LT s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1156 steps with 253 reset in 6 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-01 finished in 355 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(F(p0))))&&X(G(p1))))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 60 transition count 62
Applied a total of 7 rules in 8 ms. Remains 60 /63 variables (removed 3) and now considering 62/66 (removed 4) transitions.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:17:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:18] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:17:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:17:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:17:18] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 62 rows 60 cols
[2022-06-11 11:17:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:18] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/63 places, 62/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/63 places, 62/66 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GEQ s11 1) (GEQ s19 1)), p0:(OR (LT s1 1) (LT s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 finished in 347 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0)&&G(p1)))&&p2)))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 12 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:17:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:18] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:17:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:17:18] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:17:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:18] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 61/66 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (LT s1 1) (LT s41 1)), p0:(AND (GEQ s1 1) (GEQ s32 1)), p1:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 finished in 349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 10 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:17:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:18] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:17:18] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:17:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:17:18] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:17:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:17:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 61/66 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s1 1) (LT s52 1)), p0:(OR (LT s1 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 finished in 745 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!p0) U (G(!p1)||G(p2)))))'
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Applied a total of 4 rules in 4 ms. Remains 61 /63 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:17:19] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:19] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:17:19] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:19] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:17:19] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/63 places, 64/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/63 places, 64/66 transitions.
Stuttering acceptance computed with spot in 372 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), p0, (AND p1 p0), (AND p1 (NOT p2) p0), (AND (NOT p2) p0), true, p1, (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 6}, { cond=(AND p2 p0), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=9 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s19 1)), p2:(AND (GEQ s1 1) (GEQ s49 1)), p0:(AND (GEQ s2 1) (GEQ s48 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29807 reset in 128 ms.
Product exploration explored 100000 steps with 29824 reset in 237 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 941 ms. Reduced automaton from 10 states, 27 edges and 3 AP to 10 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 364 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), p0, (AND p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p0), true, p1, (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1124 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1541 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1523 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1552 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1025 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1056 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 455 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:23] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:17:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:17:24] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:17:24] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2022-06-11 11:17:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:17:24] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:17:24] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :7
[2022-06-11 11:17:24] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:17:24] [INFO ] After 52ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :7 sat :7
[2022-06-11 11:17:24] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :7
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-06-11 11:17:24] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :7
Fused 14 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 64/64 transitions.
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1091 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1054 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1101 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 7) seen :0
Finished probabilistic random walk after 1120 steps, run visited all 7 properties in 13 ms. (steps per millisecond=86 )
Probabilistic random walk after 1120 steps, saw 533 distinct states, run finished after 14 ms. (steps per millisecond=80 ) properties seen :7
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND (NOT p2) p0 p1))), (G (NOT (AND p2 p0 p1))), (G (NOT (AND p2 p0))), (G (NOT (AND p0 p1))), (G (NOT (AND p2 (NOT p0) p1))), (G (NOT (AND p2 p1))), (G (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F p0), (F p2), (F (AND (NOT p2) p1)), (F p1), (F (AND p0 (NOT p1))), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 25 factoid took 1479 ms. Reduced automaton from 10 states, 27 edges and 3 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Stuttering acceptance computed with spot in 199 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Support contains 4 out of 61 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:27] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:27] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:17:27] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:27] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:27] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 64/64 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1043 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 998 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1120 steps, run visited all 3 properties in 7 ms. (steps per millisecond=160 )
Probabilistic random walk after 1120 steps, saw 533 distinct states, run finished after 7 ms. (steps per millisecond=160 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 4 factoid took 261 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 305 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Stuttering acceptance computed with spot in 182 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Stuttering acceptance computed with spot in 175 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Product exploration explored 100000 steps with 29735 reset in 115 ms.
Product exploration explored 100000 steps with 29795 reset in 110 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 191 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2022-06-11 11:17:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:29] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:17:29] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 64/64 transitions.
Product exploration explored 100000 steps with 29860 reset in 129 ms.
Product exploration explored 100000 steps with 29814 reset in 148 ms.
Built C files in :
/tmp/ltsmin15930129235678555789
[2022-06-11 11:17:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15930129235678555789
Running compilation step : cd /tmp/ltsmin15930129235678555789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 157 ms.
Running link step : cd /tmp/ltsmin15930129235678555789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin15930129235678555789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5015301802079706221.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:17:45] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:17:45] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:17:45] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:17:45] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:17:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin106079198356433282
[2022-06-11 11:17:45] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin106079198356433282
Running compilation step : cd /tmp/ltsmin106079198356433282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 147 ms.
Running link step : cd /tmp/ltsmin106079198356433282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin106079198356433282;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16247005088612247459.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 11:18:00] [INFO ] Flatten gal took : 6 ms
[2022-06-11 11:18:00] [INFO ] Flatten gal took : 4 ms
[2022-06-11 11:18:00] [INFO ] Time to serialize gal into /tmp/LTL6177140905825409613.gal : 1 ms
[2022-06-11 11:18:00] [INFO ] Time to serialize properties into /tmp/LTL11145684378212814850.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6177140905825409613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11145684378212814850.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6177140...267
Read 1 LTL properties
Checking formula 0 : !((X((X(!("((s2>=1)&&(l128>=1))")))U((G(!("((s7>=1)&&(l0>=1))")))||(G("((s1>=1)&&(l129>=1))"))))))
Formula 0 simplified : !X(X!"((s2>=1)&&(l128>=1))" U (G!"((s7>=1)&&(l0>=1))" | G"((s1>=1)&&(l129>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t52, t53, t55, t57, t59, t60, t61, t63, t65, Intersection...240
Computing Next relation with stutter on 2.42093e+09 deadlock states
Detected timeout of ITS tools.
[2022-06-11 11:18:15] [INFO ] Flatten gal took : 10 ms
[2022-06-11 11:18:15] [INFO ] Applying decomposition
[2022-06-11 11:18:15] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3590939244219031875.txt' '-o' '/tmp/graph3590939244219031875.bin' '-w' '/tmp/graph3590939244219031875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3590939244219031875.bin' '-l' '-1' '-v' '-w' '/tmp/graph3590939244219031875.weights' '-q' '0' '-e' '0.001'
[2022-06-11 11:18:15] [INFO ] Decomposing Gal with order
[2022-06-11 11:18:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 11:18:15] [INFO ] Removed a total of 56 redundant transitions.
[2022-06-11 11:18:15] [INFO ] Flatten gal took : 10 ms
[2022-06-11 11:18:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 2 ms.
[2022-06-11 11:18:15] [INFO ] Time to serialize gal into /tmp/LTL16683589424872994254.gal : 2 ms
[2022-06-11 11:18:15] [INFO ] Time to serialize properties into /tmp/LTL11375194146895844889.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16683589424872994254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11375194146895844889.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1668358...247
Read 1 LTL properties
Checking formula 0 : !((X((X(!("((i4.u0.s2>=1)&&(i4.u11.l128>=1))")))U((G(!("((i2.u5.s7>=1)&&(i4.u0.l0>=1))")))||(G("((i4.u0.s1>=1)&&(i3.u9.l129>=1))")))))...156
Formula 0 simplified : !X(X!"((i4.u0.s2>=1)&&(i4.u11.l128>=1))" U (G!"((i2.u5.s7>=1)&&(i4.u0.l0>=1))" | G"((i4.u0.s1>=1)&&(i3.u9.l129>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18049638596467956709
[2022-06-11 11:18:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18049638596467956709
Running compilation step : cd /tmp/ltsmin18049638596467956709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 150 ms.
Running link step : cd /tmp/ltsmin18049638596467956709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18049638596467956709;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(!(LTLAPp0==true)) U ([](!(LTLAPp1==true))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 finished in 86058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 22 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:18:45] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:18:45] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:18:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:18:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:18:45] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-06-11 11:18:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:18:45] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:18:45] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/63 places, 61/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 61/66 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 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 s52 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 22217 reset in 88 ms.
Product exploration explored 100000 steps with 22353 reset in 88 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 385 steps, run visited all 1 properties in 4 ms. (steps per millisecond=96 )
Probabilistic random walk after 385 steps, saw 225 distinct states, run finished after 4 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:18:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:18:46] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:18:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:18:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:18:46] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2022-06-11 11:18:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:18:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:18:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 385 steps, run visited all 1 properties in 4 ms. (steps per millisecond=96 )
Probabilistic random walk after 385 steps, saw 225 distinct states, run finished after 5 ms. (steps per millisecond=77 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22318 reset in 87 ms.
Product exploration explored 100000 steps with 22200 reset in 89 ms.
Built C files in :
/tmp/ltsmin8606031696569503818
[2022-06-11 11:18:47] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 11:18:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:18:47] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 11:18:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:18:47] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 11:18:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:18:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8606031696569503818
Running compilation step : cd /tmp/ltsmin8606031696569503818;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin8606031696569503818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8606031696569503818;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12094345552776185113.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:19:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:19:02] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:19:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:19:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:19:02] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-06-11 11:19:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:19:02] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-11 11:19:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin4765466756966506138
[2022-06-11 11:19:02] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 11:19:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:19:02] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 11:19:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:19:02] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 11:19:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:19:02] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4765466756966506138
Running compilation step : cd /tmp/ltsmin4765466756966506138;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 152 ms.
Running link step : cd /tmp/ltsmin4765466756966506138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4765466756966506138;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16697281170940761178.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 11:19:17] [INFO ] Flatten gal took : 4 ms
[2022-06-11 11:19:17] [INFO ] Flatten gal took : 3 ms
[2022-06-11 11:19:17] [INFO ] Time to serialize gal into /tmp/LTL11169376842363484996.gal : 2 ms
[2022-06-11 11:19:17] [INFO ] Time to serialize properties into /tmp/LTL9987369933409534982.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11169376842363484996.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9987369933409534982.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1116937...267
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l208<1))"))))
Formula 0 simplified : !GF"((s1<1)||(l208<1))"
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t53, t55, t57, t59, t60, t61, t63, t65, Intersection with...235
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2022-06-11 11:19:32] [INFO ] Flatten gal took : 5 ms
[2022-06-11 11:19:32] [INFO ] Applying decomposition
[2022-06-11 11:19:33] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1460344845575218322.txt' '-o' '/tmp/graph1460344845575218322.bin' '-w' '/tmp/graph1460344845575218322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1460344845575218322.bin' '-l' '-1' '-v' '-w' '/tmp/graph1460344845575218322.weights' '-q' '0' '-e' '0.001'
[2022-06-11 11:19:33] [INFO ] Decomposing Gal with order
[2022-06-11 11:19:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 11:19:33] [INFO ] Removed a total of 56 redundant transitions.
[2022-06-11 11:19:33] [INFO ] Flatten gal took : 8 ms
[2022-06-11 11:19:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 2 ms.
[2022-06-11 11:19:33] [INFO ] Time to serialize gal into /tmp/LTL15779097298613866656.gal : 1 ms
[2022-06-11 11:19:33] [INFO ] Time to serialize properties into /tmp/LTL17735324185097757662.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15779097298613866656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17735324185097757662.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1577909...247
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u0.s1<1)||(i0.u11.l208<1))"))))
Formula 0 simplified : !GF"((i0.u0.s1<1)||(i0.u11.l208<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15889557804099921595
[2022-06-11 11:19:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15889557804099921595
Running compilation step : cd /tmp/ltsmin15889557804099921595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin15889557804099921595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15889557804099921595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 finished in 77561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))&&F(G(F(X(!(!p2 U p3)))))))'
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 2 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:20:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:20:03] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:20:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:20:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:20:03] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:20:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:20:03] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 61/66 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR p1 p3), (OR p1 p3), true, p1, p3, p3]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 4}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=p3, acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s18 1)), p0:(AND (GEQ s1 1) (GEQ s31 1)), p3:(AND (GEQ s1 1) (GEQ s19 1)), p2:(AND (GEQ s1 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22398 reset in 102 ms.
Product exploration explored 100000 steps with 22347 reset in 105 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) p3)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 368 ms. Reduced automaton from 6 states, 12 edges and 4 AP to 4 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 118 ms :[false, (AND (NOT p0) p3), p3, p3]
Finished random walk after 3157 steps, including 716 resets, run visited all 4 properties in 6 ms. (steps per millisecond=526 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p1) p3)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p3), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 460 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 4 states, 8 edges and 4 AP.
Stuttering acceptance computed with spot in 167 ms :[false, (AND (NOT p0) p3), p3, p3]
Stuttering acceptance computed with spot in 173 ms :[false, (AND (NOT p0) p3), p3, p3]
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:20:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:20:05] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:20:05] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:20:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:20:05] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:20:05] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:20:05] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT p3))), true, (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 307 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 3 states, 5 edges and 4 AP.
Stuttering acceptance computed with spot in 117 ms :[false, p3, p3]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT p3))), true, (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3)]
Knowledge based reduction with 8 factoid took 322 ms. Reduced automaton from 3 states, 5 edges and 4 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[p3, p3, p3]
Stuttering acceptance computed with spot in 102 ms :[p3, p3, p3]
Stuttering acceptance computed with spot in 114 ms :[p3, p3, p3]
Product exploration explored 100000 steps with 22475 reset in 106 ms.
Product exploration explored 100000 steps with 22470 reset in 105 ms.
Built C files in :
/tmp/ltsmin12730063393406407955
[2022-06-11 11:20:06] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 11:20:06] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:20:06] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 11:20:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:20:06] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 11:20:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:20:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12730063393406407955
Running compilation step : cd /tmp/ltsmin12730063393406407955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 155 ms.
Running link step : cd /tmp/ltsmin12730063393406407955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12730063393406407955;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14214380075039680200.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:20:21] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:20:21] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:20:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:20:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:20:21] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2022-06-11 11:20:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:20:21] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:20:22] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin16975337226582643976
[2022-06-11 11:20:22] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2022-06-11 11:20:22] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:20:22] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2022-06-11 11:20:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:20:22] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2022-06-11 11:20:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:20:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16975337226582643976
Running compilation step : cd /tmp/ltsmin16975337226582643976;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 157 ms.
Running link step : cd /tmp/ltsmin16975337226582643976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16975337226582643976;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11651984300369436575.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 11:20:37] [INFO ] Flatten gal took : 6 ms
[2022-06-11 11:20:37] [INFO ] Flatten gal took : 3 ms
[2022-06-11 11:20:37] [INFO ] Time to serialize gal into /tmp/LTL717697643376250999.gal : 1 ms
[2022-06-11 11:20:37] [INFO ] Time to serialize properties into /tmp/LTL12948406986220729236.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL717697643376250999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12948406986220729236.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7176976...266
Read 1 LTL properties
Checking formula 0 : !(((X(!(("((s1>=1)&&(l63>=1))")U("((s8>=1)&&(l0>=1))"))))&&(F(G(F(X(!((!("((s1>=1)&&(l64>=1))"))U("((s1>=1)&&(l1>=1))")))))))))
Formula 0 simplified : !(X!("((s1>=1)&&(l63>=1))" U "((s8>=1)&&(l0>=1))") & FGFX!(!"((s1>=1)&&(l64>=1))" U "((s1>=1)&&(l1>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t53, t55, t57, t59, t60, t61, t63, t65, Intersection with...235
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2022-06-11 11:20:52] [INFO ] Flatten gal took : 7 ms
[2022-06-11 11:20:52] [INFO ] Applying decomposition
[2022-06-11 11:20:52] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11945821096190570675.txt' '-o' '/tmp/graph11945821096190570675.bin' '-w' '/tmp/graph11945821096190570675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11945821096190570675.bin' '-l' '-1' '-v' '-w' '/tmp/graph11945821096190570675.weights' '-q' '0' '-e' '0.001'
[2022-06-11 11:20:52] [INFO ] Decomposing Gal with order
[2022-06-11 11:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 11:20:52] [INFO ] Removed a total of 57 redundant transitions.
[2022-06-11 11:20:52] [INFO ] Flatten gal took : 7 ms
[2022-06-11 11:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 2 ms.
[2022-06-11 11:20:52] [INFO ] Time to serialize gal into /tmp/LTL863884608823513479.gal : 1 ms
[2022-06-11 11:20:52] [INFO ] Time to serialize properties into /tmp/LTL12376724505290127651.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL863884608823513479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12376724505290127651.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8638846...245
Read 1 LTL properties
Checking formula 0 : !(((X(!(("((i5.u0.s1>=1)&&(i3.u4.l63>=1))")U("((i0.u5.s8>=1)&&(i5.u0.l0>=1))"))))&&(F(G(F(X(!((!("((i5.u0.s1>=1)&&(u7.l64>=1))"))U("((...190
Formula 0 simplified : !(X!("((i5.u0.s1>=1)&&(i3.u4.l63>=1))" U "((i0.u5.s8>=1)&&(i5.u0.l0>=1))") & FGFX!(!"((i5.u0.s1>=1)&&(u7.l64>=1))" U "((i5.u0.s1>=1)...171
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15210756840258240315
[2022-06-11 11:21:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15210756840258240315
Running compilation step : cd /tmp/ltsmin15210756840258240315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 149 ms.
Running link step : cd /tmp/ltsmin15210756840258240315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15210756840258240315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(!((LTLAPp0==true) U (LTLAPp1==true)))&&<>([](<>(X(!(!(LTLAPp2==true) U (LTLAPp3==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 finished in 79179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 3 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:21:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:22] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:21:22] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:21:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:21:22] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:21:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:22] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 61/66 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s53 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][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 finished in 282 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0 U p1))&&!((p0 U !p2) U !p2))))'
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 4 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:21:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:22] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:21:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:21:22] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:21:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:22] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 61/66 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s57 1)), p0:(AND (GEQ s1 1) (GEQ s38 1)), p1:(AND (GEQ s5 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 finished in 297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((X(F(p0))||G(!p0)))&&X(G(p1))))))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 3 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:21:22] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:23] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:21:23] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:21:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-11 11:21:23] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 61 rows 59 cols
[2022-06-11 11:21:23] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:21:23] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 61/66 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p1:(AND (GEQ s1 1) (GEQ s45 1)), p0:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 finished in 432 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G((F(p0)&&p1)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!p0) U (G(!p1)||G(p2)))))'
Found a SL insensitive property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-05
Stuttering acceptance computed with spot in 376 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), p0, (AND p1 p0), (AND p1 (NOT p2) p0), (AND (NOT p2) p0), true, p1, (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Applied a total of 4 rules in 2 ms. Remains 61 /63 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:23] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:21:23] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:23] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:21:24] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:21:24] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:24] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:21:24] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 61/63 places, 64/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/63 places, 64/66 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 7}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 6}, { cond=(AND p2 p0), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 6}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=9 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s19 1)), p2:(AND (GEQ s1 1) (GEQ s49 1)), p0:(AND (GEQ s2 1) (GEQ s48 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29761 reset in 138 ms.
Product exploration explored 100000 steps with 29791 reset in 145 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1008 ms. Reduced automaton from 10 states, 27 edges and 3 AP to 10 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 356 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), p0, (AND p1 p0), (AND (NOT p2) p1 p0), (AND (NOT p2) p0), true, p1, (NOT p2), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2269 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1115 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1534 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1548 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1548 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1015 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1110 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:27] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:21:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 11:21:28] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 7 ms returned sat
[2022-06-11 11:21:28] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2022-06-11 11:21:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 11:21:28] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 11:21:28] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :7
[2022-06-11 11:21:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:21:28] [INFO ] After 54ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :7 sat :7
[2022-06-11 11:21:28] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :7
Attempting to minimize the solution found.
Minimization took 50 ms.
[2022-06-11 11:21:28] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :7
Fused 14 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 64/64 transitions.
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1086 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1009 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1111 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 7) seen :0
Finished probabilistic random walk after 1120 steps, run visited all 7 properties in 17 ms. (steps per millisecond=65 )
Probabilistic random walk after 1120 steps, saw 533 distinct states, run finished after 17 ms. (steps per millisecond=65 ) properties seen :7
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND (NOT p2) p0 p1))), (G (NOT (AND p2 p0 p1))), (G (NOT (AND p2 p0))), (G (NOT (AND p0 p1))), (G (NOT (AND p2 (NOT p0) p1))), (G (NOT (AND p2 p1))), (G (NOT (AND p2 p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) p1)), (F p0), (F p2), (F (AND (NOT p2) p1)), (F p1), (F (AND p0 (NOT p1))), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 25 factoid took 1512 ms. Reduced automaton from 10 states, 27 edges and 3 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 273 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Stuttering acceptance computed with spot in 190 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Support contains 4 out of 61 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:31] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:31] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:21:31] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:31] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 64/64 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 203 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Incomplete random walk after 10000 steps, including 2216 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1040 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1034 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Finished probabilistic random walk after 1120 steps, run visited all 3 properties in 7 ms. (steps per millisecond=160 )
Probabilistic random walk after 1120 steps, saw 533 distinct states, run finished after 7 ms. (steps per millisecond=160 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 6 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 198 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Stuttering acceptance computed with spot in 191 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Stuttering acceptance computed with spot in 213 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Product exploration explored 100000 steps with 29794 reset in 110 ms.
Product exploration explored 100000 steps with 29818 reset in 118 ms.
Applying partial POR strategy [false, false, true, false, true, true]
Stuttering acceptance computed with spot in 208 ms :[p1, p1, p0, (AND p0 p1), true, p1]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 10 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2022-06-11 11:21:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:33] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 64/64 transitions.
Product exploration explored 100000 steps with 29763 reset in 106 ms.
Product exploration explored 100000 steps with 29848 reset in 117 ms.
Built C files in :
/tmp/ltsmin9549877639624906149
[2022-06-11 11:21:33] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9549877639624906149
Running compilation step : cd /tmp/ltsmin9549877639624906149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 153 ms.
Running link step : cd /tmp/ltsmin9549877639624906149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin9549877639624906149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12807819652014463838.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:49] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 11:21:49] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:49] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 11:21:49] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-06-11 11:21:49] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 61 cols
[2022-06-11 11:21:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 11:21:49] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/61 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin16801872601543665052
[2022-06-11 11:21:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16801872601543665052
Running compilation step : cd /tmp/ltsmin16801872601543665052;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 156 ms.
Running link step : cd /tmp/ltsmin16801872601543665052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16801872601543665052;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2755134985201796139.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 11:22:04] [INFO ] Flatten gal took : 6 ms
[2022-06-11 11:22:04] [INFO ] Flatten gal took : 5 ms
[2022-06-11 11:22:04] [INFO ] Time to serialize gal into /tmp/LTL3653699934862694460.gal : 1 ms
[2022-06-11 11:22:04] [INFO ] Time to serialize properties into /tmp/LTL6662940295635615896.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3653699934862694460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6662940295635615896.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3653699...266
Read 1 LTL properties
Checking formula 0 : !((X((X(!("((s2>=1)&&(l128>=1))")))U((G(!("((s7>=1)&&(l0>=1))")))||(G("((s1>=1)&&(l129>=1))"))))))
Formula 0 simplified : !X(X!"((s2>=1)&&(l128>=1))" U (G!"((s7>=1)&&(l0>=1))" | G"((s1>=1)&&(l129>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t52, t53, t55, t57, t59, t60, t61, t63, t65, Intersection...240
Computing Next relation with stutter on 2.42093e+09 deadlock states
Detected timeout of ITS tools.
[2022-06-11 11:22:19] [INFO ] Flatten gal took : 4 ms
[2022-06-11 11:22:19] [INFO ] Applying decomposition
[2022-06-11 11:22:19] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1854672362436863788.txt' '-o' '/tmp/graph1854672362436863788.bin' '-w' '/tmp/graph1854672362436863788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1854672362436863788.bin' '-l' '-1' '-v' '-w' '/tmp/graph1854672362436863788.weights' '-q' '0' '-e' '0.001'
[2022-06-11 11:22:19] [INFO ] Decomposing Gal with order
[2022-06-11 11:22:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 11:22:19] [INFO ] Removed a total of 60 redundant transitions.
[2022-06-11 11:22:19] [INFO ] Flatten gal took : 6 ms
[2022-06-11 11:22:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 2 ms.
[2022-06-11 11:22:19] [INFO ] Time to serialize gal into /tmp/LTL17984191718043084658.gal : 1 ms
[2022-06-11 11:22:19] [INFO ] Time to serialize properties into /tmp/LTL7315019994377999471.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17984191718043084658.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7315019994377999471.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1798419...246
Read 1 LTL properties
Checking formula 0 : !((X((X(!("((i0.u0.s2>=1)&&(i4.u8.l128>=1))")))U((G(!("((i2.u4.s7>=1)&&(i0.u0.l0>=1))")))||(G("((i0.u0.s1>=1)&&(i4.u9.l129>=1))"))))))
Formula 0 simplified : !X(X!"((i0.u0.s2>=1)&&(i4.u8.l128>=1))" U (G!"((i2.u4.s7>=1)&&(i0.u0.l0>=1))" | G"((i0.u0.s1>=1)&&(i4.u9.l129>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1921537145771708591
[2022-06-11 11:22:34] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1921537145771708591
Running compilation step : cd /tmp/ltsmin1921537145771708591;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 148 ms.
Running link step : cd /tmp/ltsmin1921537145771708591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1921537145771708591;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(!(LTLAPp0==true)) U ([](!(LTLAPp1==true))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 finished in 86090 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))&&F(G(F(X(!(!p2 U p3)))))))'
[2022-06-11 11:22:49] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15893221915033318316
[2022-06-11 11:22:49] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2022-06-11 11:22:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:22:49] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2022-06-11 11:22:49] [INFO ] Applying decomposition
[2022-06-11 11:22:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:22:49] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2022-06-11 11:22:49] [INFO ] Flatten gal took : 3 ms
[2022-06-11 11:22:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 11:22:49] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15893221915033318316
Running compilation step : cd /tmp/ltsmin15893221915033318316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16516034551743192474.txt' '-o' '/tmp/graph16516034551743192474.bin' '-w' '/tmp/graph16516034551743192474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16516034551743192474.bin' '-l' '-1' '-v' '-w' '/tmp/graph16516034551743192474.weights' '-q' '0' '-e' '0.001'
[2022-06-11 11:22:49] [INFO ] Decomposing Gal with order
[2022-06-11 11:22:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 11:22:49] [INFO ] Removed a total of 60 redundant transitions.
[2022-06-11 11:22:49] [INFO ] Flatten gal took : 7 ms
[2022-06-11 11:22:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 2 ms.
[2022-06-11 11:22:49] [INFO ] Time to serialize gal into /tmp/LTLFireability16390971091501729525.gal : 1 ms
[2022-06-11 11:22:49] [INFO ] Time to serialize properties into /tmp/LTLFireability4510831347663072461.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16390971091501729525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4510831347663072461.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !((X(F(X(F(G((F("((i0.u0.s1<1)||(i3.u16.l235<1))"))&&("((i0.u12.p12<1)||(i0.u0.l0<1))"))))))))
Formula 0 simplified : !XFXFG("((i0.u12.p12<1)||(i0.u0.l0<1))" & F"((i0.u0.s1<1)||(i3.u16.l235<1))")
Compilation finished in 171 ms.
Running link step : cd /tmp/ltsmin15893221915033318316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15893221915033318316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(<>([]((<>((LTLAPp0==true))&&(LTLAPp1==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t52, t53, t55, t59, t60, t61, t63, t65, i0.t58, i0.t56, I...251
Computing Next relation with stutter on 2.42093e+09 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: LTL layer: formula: X(<>(X(<>([]((<>((LTLAPp0==true))&&(LTLAPp1==true)))))))
pins2lts-mc-linux64( 6/ 8), 0.003: "X(<>(X(<>([]((<>((LTLAPp0==true))&&(LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: There are 77 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.018: State length is 64, there are 73 groups
pins2lts-mc-linux64( 0/ 8), 0.018: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.018: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.018: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.018: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.029: [Blue] ~39 levels ~960 states ~1888 transitions
pins2lts-mc-linux64( 0/ 8), 0.040: [Blue] ~64 levels ~1920 states ~4016 transitions
pins2lts-mc-linux64( 7/ 8), 0.062: [Blue] ~135 levels ~3840 states ~9488 transitions
pins2lts-mc-linux64( 6/ 8), 0.094: [Blue] ~155 levels ~7680 states ~18336 transitions
pins2lts-mc-linux64( 6/ 8), 0.163: [Blue] ~267 levels ~15360 states ~34432 transitions
pins2lts-mc-linux64( 6/ 8), 0.285: [Blue] ~489 levels ~30720 states ~66336 transitions
pins2lts-mc-linux64( 6/ 8), 0.492: [Blue] ~839 levels ~61440 states ~130864 transitions
pins2lts-mc-linux64( 3/ 8), 0.818: [Blue] ~427 levels ~122880 states ~175712 transitions
pins2lts-mc-linux64( 3/ 8), 1.332: [Blue] ~526 levels ~245760 states ~340136 transitions
pins2lts-mc-linux64( 3/ 8), 2.037: [Blue] ~675 levels ~491520 states ~660848 transitions
pins2lts-mc-linux64( 3/ 8), 2.922: [Blue] ~861 levels ~983040 states ~1305656 transitions
pins2lts-mc-linux64( 3/ 8), 4.148: [Blue] ~2768 levels ~1966080 states ~3045624 transitions
pins2lts-mc-linux64( 3/ 8), 6.851: [Blue] ~8088 levels ~3932160 states ~8446904 transitions
pins2lts-mc-linux64( 3/ 8), 12.405: [Blue] ~22391 levels ~7864320 states ~19601696 transitions
pins2lts-mc-linux64( 2/ 8), 23.614: [Blue] ~45923 levels ~15728640 states ~42301808 transitions
pins2lts-mc-linux64( 2/ 8), 46.408: [Blue] ~102964 levels ~31457280 states ~87683016 transitions
pins2lts-mc-linux64( 2/ 8), 98.088: [Blue] ~271222 levels ~62914560 states ~186412376 transitions
pins2lts-mc-linux64( 3/ 8), 209.703: [Blue] ~491172 levels ~125829120 states ~402553800 transitions
pins2lts-mc-linux64( 4/ 8), 307.465: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 307.515:
pins2lts-mc-linux64( 0/ 8), 307.515: Explored 147444633 states 581373989 transitions, fanout: 3.943
pins2lts-mc-linux64( 0/ 8), 307.515: Total exploration time 307.470 sec (307.430 sec minimum, 307.455 sec on average)
pins2lts-mc-linux64( 0/ 8), 307.515: States per second: 479542, Transitions per second: 1890832
pins2lts-mc-linux64( 0/ 8), 307.515:
pins2lts-mc-linux64( 0/ 8), 307.515: State space has 134217331 states, 64505109 are accepting
pins2lts-mc-linux64( 0/ 8), 307.515: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 307.515: blue states: 147444633 (109.86%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 307.515: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 307.515: all-red states: 64712932 (48.22%), bogus 2362 (0.00%)
pins2lts-mc-linux64( 0/ 8), 307.515:
pins2lts-mc-linux64( 0/ 8), 307.515: Total memory used for local state coloring: 82.7MB
pins2lts-mc-linux64( 0/ 8), 307.515:
pins2lts-mc-linux64( 0/ 8), 307.515: Queue width: 8B, total height: 5418066, memory: 41.34MB
pins2lts-mc-linux64( 0/ 8), 307.515: Tree memory: 1141.4MB, 8.9 B/state, compr.: 3.5%
pins2lts-mc-linux64( 0/ 8), 307.515: Tree fill ratio (roots/leafs): 99.0%/45.0%
pins2lts-mc-linux64( 0/ 8), 307.515: Stored 66 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 307.515: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 307.515: Est. total memory use: 1182.7MB (~1065.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15893221915033318316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(<>([]((<>((LTLAPp0==true))&&(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15893221915033318316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(<>([]((<>((LTLAPp0==true))&&(LTLAPp1==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 11:45:08] [INFO ] Flatten gal took : 4 ms
[2022-06-11 11:45:08] [INFO ] Time to serialize gal into /tmp/LTLFireability4347496174535273628.gal : 1 ms
[2022-06-11 11:45:08] [INFO ] Time to serialize properties into /tmp/LTLFireability4285661718156480783.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4347496174535273628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4285661718156480783.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...288
Read 4 LTL properties
Checking formula 0 : !((X(F(X(F(G((F("((s1<1)||(l235<1))"))&&("((p12<1)||(l0<1))"))))))))
Formula 0 simplified : !XFXFG("((p12<1)||(l0<1))" & F"((s1<1)||(l235<1))")
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t52, t53, t55, t56, t57, t58, t59, t60, t61, t63, t65, In...250
Computing Next relation with stutter on 2.42093e+09 deadlock states
Detected timeout of ITS tools.
[2022-06-11 12:07:28] [INFO ] Flatten gal took : 3 ms
[2022-06-11 12:07:28] [INFO ] Input system was already deterministic with 66 transitions.
[2022-06-11 12:07:28] [INFO ] Transformed 63 places.
[2022-06-11 12:07:28] [INFO ] Transformed 66 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-11 12:07:28] [INFO ] Time to serialize gal into /tmp/LTLFireability13512027745007986306.gal : 0 ms
[2022-06-11 12:07:28] [INFO ] Time to serialize properties into /tmp/LTLFireability13801391166223314010.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13512027745007986306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13801391166223314010.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(X(F(G((F("((s1<1)||(l235<1))"))&&("((p12<1)||(l0<1))"))))))))
Formula 0 simplified : !XFXFG("((p12<1)||(l0<1))" & F"((s1<1)||(l235<1))")
Reverse transition relation is NOT exact ! Due to transitions t42, t46, t47, t48, t49, t50, t51, t52, t53, t55, t56, t57, t58, t59, t60, t61, t63, t65, In...250
Computing Next relation with stutter on 2.42093e+09 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="SieveSingleMsgMbox-PT-d0m36"
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-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d0m36, 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 r312-tall-165472282800868"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m36.tgz
mv SieveSingleMsgMbox-PT-d0m36 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 ;