Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975200420.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975200420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.3K Feb 26 10:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 10:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679178679097

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m18
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 22:31:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 22:31:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:31:21] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-18 22:31:21] [INFO ] Transformed 1295 places.
[2023-03-18 22:31:21] [INFO ] Transformed 749 transitions.
[2023-03-18 22:31:21] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 14 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 305 place count 194 transition count 380
Iterating global reduction 1 with 48 rules applied. Total rules applied 353 place count 194 transition count 380
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 359 place count 194 transition count 374
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 391 place count 162 transition count 342
Iterating global reduction 2 with 32 rules applied. Total rules applied 423 place count 162 transition count 342
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 431 place count 162 transition count 334
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 448 place count 145 transition count 315
Iterating global reduction 3 with 17 rules applied. Total rules applied 465 place count 145 transition count 315
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 496 place count 145 transition count 284
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 500 place count 141 transition count 278
Iterating global reduction 4 with 4 rules applied. Total rules applied 504 place count 141 transition count 278
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 508 place count 137 transition count 274
Iterating global reduction 4 with 4 rules applied. Total rules applied 512 place count 137 transition count 274
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 514 place count 135 transition count 271
Iterating global reduction 4 with 2 rules applied. Total rules applied 516 place count 135 transition count 271
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 518 place count 133 transition count 269
Iterating global reduction 4 with 2 rules applied. Total rules applied 520 place count 133 transition count 269
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 522 place count 131 transition count 267
Iterating global reduction 4 with 2 rules applied. Total rules applied 524 place count 131 transition count 267
Applied a total of 524 rules in 84 ms. Remains 131 /259 variables (removed 128) and now considering 267/749 (removed 482) transitions.
// Phase 1: matrix 267 rows 131 cols
[2023-03-18 22:31:21] [INFO ] Computed 5 place invariants in 20 ms
[2023-03-18 22:31:21] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-18 22:31:21] [INFO ] Invariant cache hit.
[2023-03-18 22:31:21] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-18 22:31:22] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2023-03-18 22:31:22] [INFO ] Invariant cache hit.
[2023-03-18 22:31:22] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/259 places, 267/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1043 ms. Remains : 131/259 places, 267/749 transitions.
Support contains 20 out of 131 places after structural reductions.
[2023-03-18 22:31:22] [INFO ] Flatten gal took : 75 ms
[2023-03-18 22:31:22] [INFO ] Flatten gal took : 30 ms
[2023-03-18 22:31:22] [INFO ] Input system was already deterministic with 267 transitions.
Support contains 18 out of 131 places (down from 20) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 38 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 469948 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 7=1, 8=1, 10=1, 12=1, 14=1, 15=1, 16=1, 18=1, 20=1}
Probabilistic random walk after 469948 steps, saw 215240 distinct states, run finished after 3003 ms. (steps per millisecond=156 ) properties seen :14
Running SMT prover for 7 properties.
[2023-03-18 22:31:26] [INFO ] Invariant cache hit.
[2023-03-18 22:31:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:31:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:31:26] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 22:31:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-18 22:31:26] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 16 ms returned sat
[2023-03-18 22:31:27] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 22:31:27] [INFO ] State equation strengthened by 176 read => feed constraints.
[2023-03-18 22:31:27] [INFO ] After 307ms SMT Verify possible using 176 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 22:31:28] [INFO ] After 993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 669 ms.
[2023-03-18 22:31:28] [INFO ] After 2050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 1 properties in 110 ms.
Support contains 6 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 267/267 transitions.
Graph (complete) has 471 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 130 transition count 265
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 119 transition count 182
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 119 transition count 182
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 35 place count 119 transition count 172
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 43 place count 111 transition count 164
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 111 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 56 place count 111 transition count 159
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 106 transition count 154
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 106 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 106 transition count 151
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 105 transition count 150
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 105 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 104 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 104 transition count 149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 103 transition count 148
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 103 transition count 148
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 80 place count 103 transition count 143
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 81 place count 102 transition count 142
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 102 transition count 142
Applied a total of 82 rules in 49 ms. Remains 102 /131 variables (removed 29) and now considering 142/267 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 102/131 places, 142/267 transitions.
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 455 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 423513 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423513 steps, saw 184679 distinct states, run finished after 3002 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 142 rows 102 cols
[2023-03-18 22:31:32] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 22:31:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:31:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:31:32] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 22:31:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:31:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:31:32] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 22:31:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-18 22:31:33] [INFO ] After 108ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 22:31:33] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-18 22:31:33] [INFO ] After 574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 53 ms.
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 142/142 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 102/102 places, 142/142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 142/142 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2023-03-18 22:31:33] [INFO ] Invariant cache hit.
[2023-03-18 22:31:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-18 22:31:33] [INFO ] Invariant cache hit.
[2023-03-18 22:31:34] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-18 22:31:36] [INFO ] Implicit Places using invariants and state equation in 2673 ms returned []
Implicit Place search using SMT with State Equation took 2781 ms to find 0 implicit places.
[2023-03-18 22:31:36] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 22:31:36] [INFO ] Invariant cache hit.
[2023-03-18 22:31:36] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2925 ms. Remains : 102/102 places, 142/142 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 102 transition count 136
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 97 transition count 136
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 11 place count 97 transition count 121
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 41 place count 82 transition count 121
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 57 place count 74 transition count 113
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 74 transition count 113
Applied a total of 59 rules in 18 ms. Remains 74 /102 variables (removed 28) and now considering 113/142 (removed 29) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 113 rows 74 cols
[2023-03-18 22:31:36] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 22:31:36] [INFO ] [Real]Absence check using 2 positive place invariants in 26 ms returned sat
[2023-03-18 22:31:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 28 ms returned sat
[2023-03-18 22:31:36] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 22:31:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:31:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:31:37] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 22:31:37] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2023-03-18 22:31:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-18 22:31:37] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-18 22:31:37] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 45 stable transitions
Graph (complete) has 520 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(F((G(p2)||p1))&&X(p3))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 118 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 118 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 32 place count 118 transition count 156
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 108 transition count 146
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 108 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 108 transition count 140
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 64 place count 102 transition count 134
Iterating global reduction 2 with 6 rules applied. Total rules applied 70 place count 102 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 102 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 101 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 101 transition count 130
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 100 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 100 transition count 129
Applied a total of 77 rules in 10 ms. Remains 100 /131 variables (removed 31) and now considering 129/267 (removed 138) transitions.
// Phase 1: matrix 129 rows 100 cols
[2023-03-18 22:31:37] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:31:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-18 22:31:37] [INFO ] Invariant cache hit.
[2023-03-18 22:31:37] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-18 22:31:38] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-18 22:31:38] [INFO ] Invariant cache hit.
[2023-03-18 22:31:38] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/131 places, 129/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 100/131 places, 129/267 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p2)), true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s94 1)), p0:(AND (OR (LT s1 1) (LT s94 1)) (OR (LT s1 1) (LT s95 1))), p3:(OR (LT s1 1) (LT s45 1)), p2:(OR (LT s1 1) (LT s94 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 50000 reset in 376 ms.
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Computed a total of 22 stabilizing places and 30 stable transitions
Graph (complete) has 330 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 22 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p3))))
Knowledge based reduction with 11 factoid took 295 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-01 finished in 1732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((X(F(p0)) U p1))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 117 transition count 154
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 106 transition count 142
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 106 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 106 transition count 136
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 99 transition count 129
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 99 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 97 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 91 transition count 117
Applied a total of 96 rules in 30 ms. Remains 91 /131 variables (removed 40) and now considering 117/267 (removed 150) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-18 22:31:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:31:39] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 22:31:39] [INFO ] Invariant cache hit.
[2023-03-18 22:31:39] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:31:39] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-18 22:31:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:31:39] [INFO ] Invariant cache hit.
[2023-03-18 22:31:39] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/131 places, 117/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 470 ms. Remains : 91/131 places, 117/267 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-03 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 117 transition count 154
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 106 transition count 142
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 106 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 106 transition count 136
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 99 transition count 129
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 99 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 97 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 91 transition count 117
Applied a total of 96 rules in 14 ms. Remains 91 /131 variables (removed 40) and now considering 117/267 (removed 150) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-18 22:31:39] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:31:40] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-18 22:31:40] [INFO ] Invariant cache hit.
[2023-03-18 22:31:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:31:40] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-18 22:31:40] [INFO ] Invariant cache hit.
[2023-03-18 22:31:40] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/131 places, 117/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 91/131 places, 117/267 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s85 1)), p1:(AND (GEQ s1 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-04 finished in 472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 116 transition count 150
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 116 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 35 place count 116 transition count 145
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 47 place count 104 transition count 132
Iterating global reduction 1 with 12 rules applied. Total rules applied 59 place count 104 transition count 132
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 66 place count 104 transition count 125
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 96 transition count 117
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 96 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 96 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 93 transition count 110
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 93 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 90 transition count 107
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 90 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 88 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 88 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 88 transition count 103
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 86 transition count 100
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 111 place count 84 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 84 transition count 98
Applied a total of 112 rules in 26 ms. Remains 84 /131 variables (removed 47) and now considering 98/267 (removed 169) transitions.
// Phase 1: matrix 98 rows 84 cols
[2023-03-18 22:31:40] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:31:40] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-18 22:31:40] [INFO ] Invariant cache hit.
[2023-03-18 22:31:40] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-18 22:31:40] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-18 22:31:40] [INFO ] Invariant cache hit.
[2023-03-18 22:31:40] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/131 places, 98/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 84/131 places, 98/267 transitions.
Stuttering acceptance computed with spot in 79 ms :[p0, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s79 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 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-05 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 116 transition count 140
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 116 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 116 transition count 138
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 45 place count 103 transition count 124
Iterating global reduction 1 with 13 rules applied. Total rules applied 58 place count 103 transition count 124
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 66 place count 103 transition count 116
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 94 transition count 107
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 94 transition count 107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 94 transition count 102
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 93 place count 90 transition count 98
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 90 transition count 98
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 86 transition count 94
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 86 transition count 94
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 83 transition count 91
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 83 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 83 transition count 89
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 116 place count 80 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 79 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 122 place count 78 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 78 transition count 83
Applied a total of 123 rules in 21 ms. Remains 78 /131 variables (removed 53) and now considering 83/267 (removed 184) transitions.
// Phase 1: matrix 83 rows 78 cols
[2023-03-18 22:31:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:31:40] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-18 22:31:40] [INFO ] Invariant cache hit.
[2023-03-18 22:31:40] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:31:41] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-18 22:31:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:31:41] [INFO ] Invariant cache hit.
[2023-03-18 22:31:41] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/131 places, 83/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 78/131 places, 83/267 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22368 reset in 171 ms.
Product exploration explored 100000 steps with 22459 reset in 187 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 244 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 457 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3723 steps, run visited all 1 properties in 10 ms. (steps per millisecond=372 )
Probabilistic random walk after 3723 steps, saw 1653 distinct states, run finished after 11 ms. (steps per millisecond=338 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 83/83 transitions.
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-18 22:31:42] [INFO ] Invariant cache hit.
[2023-03-18 22:31:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-18 22:31:42] [INFO ] Invariant cache hit.
[2023-03-18 22:31:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:31:42] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-18 22:31:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:31:42] [INFO ] Invariant cache hit.
[2023-03-18 22:31:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 78/78 places, 83/83 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 244 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3723 steps, run visited all 1 properties in 9 ms. (steps per millisecond=413 )
Probabilistic random walk after 3723 steps, saw 1653 distinct states, run finished after 9 ms. (steps per millisecond=413 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22549 reset in 94 ms.
Product exploration explored 100000 steps with 22366 reset in 122 ms.
Built C files in :
/tmp/ltsmin3059819704477113055
[2023-03-18 22:31:42] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2023-03-18 22:31:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:31:43] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2023-03-18 22:31:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:31:43] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2023-03-18 22:31:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:31:43] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3059819704477113055
Running compilation step : cd /tmp/ltsmin3059819704477113055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 304 ms.
Running link step : cd /tmp/ltsmin3059819704477113055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin3059819704477113055;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9066886796490657882.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 78 /78 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-18 22:31:58] [INFO ] Invariant cache hit.
[2023-03-18 22:31:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-18 22:31:58] [INFO ] Invariant cache hit.
[2023-03-18 22:31:58] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:31:58] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-18 22:31:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:31:58] [INFO ] Invariant cache hit.
[2023-03-18 22:31:58] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 78/78 places, 83/83 transitions.
Built C files in :
/tmp/ltsmin2567947566026212139
[2023-03-18 22:31:58] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2023-03-18 22:31:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:31:58] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2023-03-18 22:31:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:31:58] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2023-03-18 22:31:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:31:58] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2567947566026212139
Running compilation step : cd /tmp/ltsmin2567947566026212139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 171 ms.
Running link step : cd /tmp/ltsmin2567947566026212139;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin2567947566026212139;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3778908347133223387.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 22:32:13] [INFO ] Flatten gal took : 5 ms
[2023-03-18 22:32:13] [INFO ] Flatten gal took : 5 ms
[2023-03-18 22:32:13] [INFO ] Time to serialize gal into /tmp/LTL6643636654178592216.gal : 2 ms
[2023-03-18 22:32:13] [INFO ] Time to serialize properties into /tmp/LTL10833397835120604564.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6643636654178592216.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4046408172264315527.hoa' '-atoms' '/tmp/LTL10833397835120604564.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10833397835120604564.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4046408172264315527.hoa
Reverse transition relation is NOT exact ! Due to transitions t99, t227, t228, t229, t230, t231, t232, t233, t236, t239, t242, t245, t246, t251, t263, t264...267
Computing Next relation with stutter on 2.20061e+09 deadlock states
Detected timeout of ITS tools.
[2023-03-18 22:32:28] [INFO ] Flatten gal took : 9 ms
[2023-03-18 22:32:28] [INFO ] Flatten gal took : 8 ms
[2023-03-18 22:32:28] [INFO ] Time to serialize gal into /tmp/LTL3439268137986305336.gal : 3 ms
[2023-03-18 22:32:28] [INFO ] Time to serialize properties into /tmp/LTL4397525180701984085.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3439268137986305336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4397525180701984085.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l950<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l950<1))"
Reverse transition relation is NOT exact ! Due to transitions t99, t227, t228, t229, t230, t231, t232, t233, t236, t239, t242, t245, t246, t251, t263, t264...267
Computing Next relation with stutter on 2.20061e+09 deadlock states
Detected timeout of ITS tools.
[2023-03-18 22:32:43] [INFO ] Flatten gal took : 6 ms
[2023-03-18 22:32:43] [INFO ] Applying decomposition
[2023-03-18 22:32:43] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7754998375904664299.txt' '-o' '/tmp/graph7754998375904664299.bin' '-w' '/tmp/graph7754998375904664299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7754998375904664299.bin' '-l' '-1' '-v' '-w' '/tmp/graph7754998375904664299.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:32:43] [INFO ] Decomposing Gal with order
[2023-03-18 22:32:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:32:43] [INFO ] Removed a total of 78 redundant transitions.
[2023-03-18 22:32:43] [INFO ] Flatten gal took : 29 ms
[2023-03-18 22:32:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 4 ms.
[2023-03-18 22:32:43] [INFO ] Time to serialize gal into /tmp/LTL1236188594027597919.gal : 2 ms
[2023-03-18 22:32:43] [INFO ] Time to serialize properties into /tmp/LTL8949193670448523293.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1236188594027597919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8949193670448523293.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.u0.s1<1)||(u14.l950<1))"))))
Formula 0 simplified : GF!"((i0.u0.s1<1)||(u14.l950<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8813693093736341540
[2023-03-18 22:32:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8813693093736341540
Running compilation step : cd /tmp/ltsmin8813693093736341540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 198 ms.
Running link step : cd /tmp/ltsmin8813693093736341540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8813693093736341540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-06 finished in 93260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 116 transition count 142
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 116 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 116 transition count 138
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 46 place count 104 transition count 125
Iterating global reduction 1 with 12 rules applied. Total rules applied 58 place count 104 transition count 125
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 66 place count 104 transition count 117
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 96 transition count 109
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 96 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 96 transition count 105
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 90 place count 92 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 92 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 97 place count 89 transition count 98
Iterating global reduction 3 with 3 rules applied. Total rules applied 100 place count 89 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 87 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 87 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 87 transition count 94
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 85 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 85 transition count 92
Applied a total of 110 rules in 18 ms. Remains 85 /131 variables (removed 46) and now considering 92/267 (removed 175) transitions.
// Phase 1: matrix 92 rows 85 cols
[2023-03-18 22:33:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:33:14] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-18 22:33:14] [INFO ] Invariant cache hit.
[2023-03-18 22:33:14] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-18 22:33:14] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-18 22:33:14] [INFO ] Invariant cache hit.
[2023-03-18 22:33:14] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/131 places, 92/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 85/131 places, 92/267 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-07 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 151
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 117 transition count 146
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 45 place count 105 transition count 133
Iterating global reduction 1 with 12 rules applied. Total rules applied 57 place count 105 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 64 place count 105 transition count 126
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 97 transition count 118
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 97 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 84 place count 97 transition count 114
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 94 transition count 111
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 94 transition count 111
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 91 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 91 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 89 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 104 place count 87 transition count 101
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 87 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 86 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 85 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 85 transition count 99
Applied a total of 110 rules in 16 ms. Remains 85 /131 variables (removed 46) and now considering 99/267 (removed 168) transitions.
// Phase 1: matrix 99 rows 85 cols
[2023-03-18 22:33:14] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 22:33:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 22:33:14] [INFO ] Invariant cache hit.
[2023-03-18 22:33:14] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-18 22:33:14] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-18 22:33:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:33:14] [INFO ] Invariant cache hit.
[2023-03-18 22:33:14] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/131 places, 99/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 85/131 places, 99/267 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s34 1)), p1:(AND (GEQ s1 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-09 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(p1)&&G(!p2))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 118 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 118 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 118 transition count 158
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 107 transition count 146
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 107 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 107 transition count 140
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 100 transition count 133
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 100 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 100 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 98 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 98 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 96 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 95 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 94 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 93 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 92 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 92 transition count 121
Applied a total of 91 rules in 14 ms. Remains 92 /131 variables (removed 39) and now considering 121/267 (removed 146) transitions.
// Phase 1: matrix 121 rows 92 cols
[2023-03-18 22:33:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:33:15] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-18 22:33:15] [INFO ] Invariant cache hit.
[2023-03-18 22:33:15] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-18 22:33:15] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-18 22:33:15] [INFO ] Invariant cache hit.
[2023-03-18 22:33:15] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/131 places, 121/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 92/131 places, 121/267 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p0), (NOT p1), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s71 1)), p0:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-10 finished in 613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0||F(p1)) U !p2)))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 118 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 118 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 118 transition count 158
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 107 transition count 146
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 107 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 58 place count 107 transition count 140
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 100 transition count 133
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 100 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 100 transition count 130
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 98 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 98 transition count 128
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 96 transition count 126
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 95 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 94 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 94 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 93 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 93 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 92 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 92 transition count 121
Applied a total of 91 rules in 23 ms. Remains 92 /131 variables (removed 39) and now considering 121/267 (removed 146) transitions.
// Phase 1: matrix 121 rows 92 cols
[2023-03-18 22:33:15] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:33:15] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-18 22:33:15] [INFO ] Invariant cache hit.
[2023-03-18 22:33:15] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-18 22:33:15] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-18 22:33:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:33:15] [INFO ] Invariant cache hit.
[2023-03-18 22:33:16] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/131 places, 121/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 92/131 places, 121/267 transitions.
Stuttering acceptance computed with spot in 123 ms :[p2, (NOT p1), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s85 1)), p0:(AND (GEQ s1 1) (GEQ s70 1)), p1:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22520 reset in 102 ms.
Product exploration explored 100000 steps with 22407 reset in 104 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 306 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 282 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[p2, (NOT p1), p2]
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 453 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2162956 steps, run timeout after 3001 ms. (steps per millisecond=720 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 2162956 steps, saw 935433 distinct states, run finished after 3001 ms. (steps per millisecond=720 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-18 22:33:19] [INFO ] Invariant cache hit.
[2023-03-18 22:33:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:33:19] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:33:20] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:33:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:33:20] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:33:20] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:33:20] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-18 22:33:20] [INFO ] After 21ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:33:20] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 22:33:20] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 121/121 transitions.
Graph (complete) has 272 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 89 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 89 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 88 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 87 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 87 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 86 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 18 place count 85 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 84 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 23 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 24 place count 83 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 25 place count 83 transition count 96
Applied a total of 25 rules in 19 ms. Remains 83 /92 variables (removed 9) and now considering 96/121 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 83/92 places, 96/121 transitions.
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 456 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119910 steps, run visited all 1 properties in 1483 ms. (steps per millisecond=755 )
Probabilistic random walk after 1119910 steps, saw 497317 distinct states, run finished after 1483 ms. (steps per millisecond=755 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p1), (F p2)]
Knowledge based reduction with 7 factoid took 506 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 165 ms :[p2, (NOT p1), p2]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-18 22:33:22] [INFO ] Invariant cache hit.
[2023-03-18 22:33:22] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-18 22:33:22] [INFO ] Invariant cache hit.
[2023-03-18 22:33:22] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-18 22:33:22] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-18 22:33:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:33:22] [INFO ] Invariant cache hit.
[2023-03-18 22:33:22] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 92/92 places, 121/121 transitions.
Computed a total of 13 stabilizing places and 18 stable transitions
Graph (complete) has 306 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[p2, (NOT p1), p2]
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 480 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1787409 steps, run timeout after 3001 ms. (steps per millisecond=595 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1787409 steps, saw 779175 distinct states, run finished after 3001 ms. (steps per millisecond=595 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-18 22:33:26] [INFO ] Invariant cache hit.
[2023-03-18 22:33:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:33:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:33:26] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:33:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:33:26] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:33:26] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:33:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-18 22:33:26] [INFO ] After 21ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 22:33:26] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-18 22:33:26] [INFO ] After 151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 121/121 transitions.
Graph (complete) has 272 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 89 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 89 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 88 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 88 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 88 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 87 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 87 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 86 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 86 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 18 place count 85 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 85 transition count 100
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 84 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 84 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 23 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 24 place count 83 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 25 place count 83 transition count 96
Applied a total of 25 rules in 15 ms. Remains 83 /92 variables (removed 9) and now considering 96/121 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 83/92 places, 96/121 transitions.
Incomplete random walk after 10000 steps, including 2243 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119910 steps, run visited all 1 properties in 1329 ms. (steps per millisecond=842 )
Probabilistic random walk after 1119910 steps, saw 497317 distinct states, run finished after 1330 ms. (steps per millisecond=842 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p2 (NOT p1))), (F p1), (F p2)]
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 170 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 158 ms :[p2, (NOT p1), p2]
Product exploration explored 100000 steps with 22426 reset in 152 ms.
Product exploration explored 100000 steps with 22353 reset in 141 ms.
Built C files in :
/tmp/ltsmin13563411965692703299
[2023-03-18 22:33:29] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2023-03-18 22:33:29] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:33:29] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2023-03-18 22:33:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:33:29] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2023-03-18 22:33:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:33:29] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13563411965692703299
Running compilation step : cd /tmp/ltsmin13563411965692703299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 311 ms.
Running link step : cd /tmp/ltsmin13563411965692703299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin13563411965692703299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8886935391632762850.hoa' '--buchi-type=spotba'
LTSmin run took 3680 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-12 finished in 18071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1 U p2))&&(F(!p2)||p3)&&p0)))'
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 267/267 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 35 place count 117 transition count 154
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 46 place count 106 transition count 142
Iterating global reduction 1 with 11 rules applied. Total rules applied 57 place count 106 transition count 142
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 106 transition count 136
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 99 transition count 129
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 99 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 99 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 97 transition count 124
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 97 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 95 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 94 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 93 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 92 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 91 transition count 117
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 91 transition count 117
Applied a total of 96 rules in 5 ms. Remains 91 /131 variables (removed 40) and now considering 117/267 (removed 150) transitions.
// Phase 1: matrix 117 rows 91 cols
[2023-03-18 22:33:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:33:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 22:33:33] [INFO ] Invariant cache hit.
[2023-03-18 22:33:33] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-18 22:33:33] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-18 22:33:33] [INFO ] Invariant cache hit.
[2023-03-18 22:33:33] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/131 places, 117/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 91/131 places, 117/267 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p2), p2]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1)), p2:(AND (GEQ s1 1) (GEQ s85 1)), p1:(AND (GEQ s1 1) (GEQ s86 1)), p3:(OR (LT s1 1) (LT s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, 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-d1m18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLFireability-13 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-18 22:33:34] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1288950108438907926
[2023-03-18 22:33:34] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2023-03-18 22:33:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:33:34] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2023-03-18 22:33:34] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:33:34] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2023-03-18 22:33:34] [INFO ] Applying decomposition
[2023-03-18 22:33:34] [INFO ] Flatten gal took : 11 ms
[2023-03-18 22:33:34] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:33:34] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1288950108438907926
Running compilation step : cd /tmp/ltsmin1288950108438907926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11892213630210295290.txt' '-o' '/tmp/graph11892213630210295290.bin' '-w' '/tmp/graph11892213630210295290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11892213630210295290.bin' '-l' '-1' '-v' '-w' '/tmp/graph11892213630210295290.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:33:34] [INFO ] Decomposing Gal with order
[2023-03-18 22:33:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:33:34] [INFO ] Removed a total of 153 redundant transitions.
[2023-03-18 22:33:34] [INFO ] Flatten gal took : 47 ms
[2023-03-18 22:33:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 6 ms.
[2023-03-18 22:33:34] [INFO ] Time to serialize gal into /tmp/LTLFireability245932008856390400.gal : 4 ms
[2023-03-18 22:33:34] [INFO ] Time to serialize properties into /tmp/LTLFireability5367171055459371234.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability245932008856390400.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5367171055459371234.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((u0.s1<1)||(u0.l950<1))"))))
Formula 0 simplified : GF!"((u0.s1<1)||(u0.l950<1))"
Compilation finished in 597 ms.
Running link step : cd /tmp/ltsmin1288950108438907926;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin1288950108438907926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 22:54:18] [INFO ] Flatten gal took : 27 ms
[2023-03-18 22:54:18] [INFO ] Time to serialize gal into /tmp/LTLFireability15107246470844854009.gal : 2 ms
[2023-03-18 22:54:18] [INFO ] Time to serialize properties into /tmp/LTLFireability12346650898082764986.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15107246470844854009.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12346650898082764986.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l950<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l950<1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.069: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.069: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.129: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.129: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.175: Initializing POR dependencies: labels 268, guards 267
pins2lts-mc-linux64( 7/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.198: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.224: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.243: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 1/ 8), 0.243: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.243: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.287: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.347: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.568: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.593: There are 269 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.593: State length is 132, there are 271 groups
pins2lts-mc-linux64( 0/ 8), 0.593: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.593: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.593: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.593: Visible groups: 0 / 271, labels: 1 / 269
pins2lts-mc-linux64( 0/ 8), 0.593: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.593: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.632: [Blue] ~45 levels ~960 states ~2160 transitions
pins2lts-mc-linux64( 3/ 8), 0.683: [Blue] ~71 levels ~1920 states ~4560 transitions
pins2lts-mc-linux64( 1/ 8), 0.779: [Blue] ~109 levels ~3840 states ~11320 transitions
pins2lts-mc-linux64( 3/ 8), 0.974: [Blue] ~175 levels ~7680 states ~18992 transitions
pins2lts-mc-linux64( 3/ 8), 1.256: [Blue] ~291 levels ~15360 states ~37128 transitions
pins2lts-mc-linux64( 7/ 8), 1.882: [Blue] ~161 levels ~30720 states ~69456 transitions
pins2lts-mc-linux64( 1/ 8), 3.287: [Blue] ~432 levels ~61440 states ~134296 transitions
pins2lts-mc-linux64( 0/ 8), 5.547: [Blue] ~289 levels ~122880 states ~268480 transitions
pins2lts-mc-linux64( 0/ 8), 10.118: [Blue] ~289 levels ~245760 states ~540696 transitions
pins2lts-mc-linux64( 0/ 8), 19.280: [Blue] ~332 levels ~491520 states ~1094208 transitions
pins2lts-mc-linux64( 0/ 8), 35.224: [Blue] ~376 levels ~983040 states ~2212080 transitions
pins2lts-mc-linux64( 0/ 8), 56.509: [Blue] ~420 levels ~1966080 states ~4461472 transitions
pins2lts-mc-linux64( 0/ 8), 87.933: [Blue] ~464 levels ~3932160 states ~8968392 transitions
pins2lts-mc-linux64( 7/ 8), 154.593: [Blue] ~709 levels ~7864320 states ~17689912 transitions
pins2lts-mc-linux64( 7/ 8), 268.135: [Blue] ~849 levels ~15728640 states ~35534072 transitions
pins2lts-mc-linux64( 4/ 8), 450.567: [Blue] ~4379 levels ~31457280 states ~70212960 transitions
pins2lts-mc-linux64( 7/ 8), 816.450: [Blue] ~6595 levels ~62914560 states ~143384672 transitions
pins2lts-mc-linux64( 7/ 8), 1541.987: [Blue] ~14095 levels ~125829120 states ~285964800 transitions
pins2lts-mc-linux64( 3/ 8), 1659.272: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1659.331:
pins2lts-mc-linux64( 0/ 8), 1659.331: Explored 127897536 states 300628171 transitions, fanout: 2.351
pins2lts-mc-linux64( 0/ 8), 1659.331: Total exploration time 1658.730 sec (1658.680 sec minimum, 1658.704 sec on average)
pins2lts-mc-linux64( 0/ 8), 1659.331: States per second: 77106, Transitions per second: 181240
pins2lts-mc-linux64( 0/ 8), 1659.331:
pins2lts-mc-linux64( 0/ 8), 1659.332: State space has 134216753 states, 9180 are accepting
pins2lts-mc-linux64( 0/ 8), 1659.332: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1659.332: blue states: 127897536 (95.29%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1659.332: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1659.332: all-red states: 13126 (0.01%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1659.332:
pins2lts-mc-linux64( 0/ 8), 1659.332: Total memory used for local state coloring: 22.2MB
pins2lts-mc-linux64( 0/ 8), 1659.332:
pins2lts-mc-linux64( 0/ 8), 1659.332: Queue width: 8B, total height: 1451783, memory: 11.08MB
pins2lts-mc-linux64( 0/ 8), 1659.332: Tree memory: 1061.5MB, 8.3 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 1659.332: Tree fill ratio (roots/leafs): 99.0%/14.0%
pins2lts-mc-linux64( 0/ 8), 1659.332: Stored 268 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1659.332: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1659.332: Est. total memory use: 1072.5MB (~1035.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1288950108438907926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1288950108438907926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 23:15:04] [INFO ] Flatten gal took : 435 ms
[2023-03-18 23:15:05] [INFO ] Input system was already deterministic with 267 transitions.
[2023-03-18 23:15:05] [INFO ] Transformed 131 places.
[2023-03-18 23:15:05] [INFO ] Transformed 267 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 23:15:05] [INFO ] Time to serialize gal into /tmp/LTLFireability16218475951860272303.gal : 6 ms
[2023-03-18 23:15:05] [INFO ] Time to serialize properties into /tmp/LTLFireability3354781120898664018.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16218475951860272303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3354781120898664018.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((s1<1)||(l950<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l950<1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11749888 kB
After kill :
MemTotal: 16393340 kB
MemFree: 15791504 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d1m18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m18, 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 r421-tajo-167905975200420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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