Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 8.5K Jun 7 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 7 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Jun 7 17:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 7 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 450K Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654958019728

Running Version 202205111006
[2022-06-11 14:33:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 14:33:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 14:33:41] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2022-06-11 14:33:41] [INFO ] Transformed 1295 places.
[2022-06-11 14:33:41] [INFO ] Transformed 749 transitions.
[2022-06-11 14:33:41] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1036 places in 10 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 301 place count 198 transition count 412
Iterating global reduction 1 with 44 rules applied. Total rules applied 345 place count 198 transition count 412
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 352 place count 198 transition count 405
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 377 place count 173 transition count 380
Iterating global reduction 2 with 25 rules applied. Total rules applied 402 place count 173 transition count 380
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 408 place count 173 transition count 374
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 427 place count 154 transition count 354
Iterating global reduction 3 with 19 rules applied. Total rules applied 446 place count 154 transition count 354
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 507 place count 154 transition count 293
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 511 place count 150 transition count 285
Iterating global reduction 4 with 4 rules applied. Total rules applied 515 place count 150 transition count 285
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 518 place count 147 transition count 282
Iterating global reduction 4 with 3 rules applied. Total rules applied 521 place count 147 transition count 282
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 522 place count 146 transition count 281
Iterating global reduction 4 with 1 rules applied. Total rules applied 523 place count 146 transition count 281
Applied a total of 523 rules in 69 ms. Remains 146 /259 variables (removed 113) and now considering 281/749 (removed 468) transitions.
// Phase 1: matrix 281 rows 146 cols
[2022-06-11 14:33:41] [INFO ] Computed 5 place invariants in 25 ms
[2022-06-11 14:33:41] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 281 rows 146 cols
[2022-06-11 14:33:41] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-11 14:33:41] [INFO ] State equation strengthened by 179 read => feed constraints.
[2022-06-11 14:33:41] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
// Phase 1: matrix 281 rows 146 cols
[2022-06-11 14:33:42] [INFO ] Computed 5 place invariants in 20 ms
[2022-06-11 14:33:42] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/259 places, 281/749 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/259 places, 281/749 transitions.
Support contains 34 out of 146 places after structural reductions.
[2022-06-11 14:33:42] [INFO ] Flatten gal took : 49 ms
[2022-06-11 14:33:42] [INFO ] Flatten gal took : 21 ms
[2022-06-11 14:33:42] [INFO ] Input system was already deterministic with 281 transitions.
Incomplete random walk after 10000 steps, including 2220 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 32) seen :3
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 60 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 104 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 119 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 105 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 281 rows 146 cols
[2022-06-11 14:33:43] [INFO ] Computed 5 place invariants in 6 ms
[2022-06-11 14:33:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:33:43] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2022-06-11 14:33:44] [INFO ] After 805ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:27
[2022-06-11 14:33:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:33:44] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 14:33:45] [INFO ] After 742ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :27
[2022-06-11 14:33:45] [INFO ] State equation strengthened by 179 read => feed constraints.
[2022-06-11 14:33:46] [INFO ] After 1559ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :2 sat :27
[2022-06-11 14:33:46] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 4 ms to minimize.
[2022-06-11 14:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-06-11 14:33:48] [INFO ] After 3511ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :26
Attempting to minimize the solution found.
Minimization took 1723 ms.
[2022-06-11 14:33:50] [INFO ] After 6201ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :26
Fused 29 Parikh solutions to 25 different solutions.
Parikh walk visited 2 properties in 846 ms.
Support contains 23 out of 146 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 146/146 places, 281/281 transitions.
Graph (complete) has 507 edges and 146 vertex of which 145 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 145 transition count 279
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 139 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 139 transition count 261
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 134 transition count 255
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 134 transition count 255
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 131 transition count 252
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 131 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 131 transition count 250
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 129 transition count 248
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 129 transition count 248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 128 transition count 247
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 128 transition count 247
Applied a total of 39 rules in 53 ms. Remains 128 /146 variables (removed 18) and now considering 247/281 (removed 34) transitions.
Finished structural reductions, in 1 iterations. Remains : 128/146 places, 247/281 transitions.
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 250 ms. (steps per millisecond=40 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 340397 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{0=1, 2=1, 5=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1}
Probabilistic random walk after 340397 steps, saw 158623 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :20
Running SMT prover for 4 properties.
// Phase 1: matrix 247 rows 128 cols
[2022-06-11 14:33:54] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 14:33:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:33:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 9 ms returned sat
[2022-06-11 14:33:55] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-11 14:33:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:33:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 14:33:55] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-11 14:33:55] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-11 14:33:55] [INFO ] After 163ms SMT Verify possible using 157 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-11 14:33:55] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 218 ms.
[2022-06-11 14:33:55] [INFO ] After 803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 87 ms.
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 128/128 places, 247/247 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 117 transition count 169
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 117 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 117 transition count 168
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 107 transition count 158
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 107 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 107 transition count 152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 102 transition count 147
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 102 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 102 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 100 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 100 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 98 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 98 transition count 141
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 96 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 96 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 78 place count 96 transition count 133
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 80 place count 94 transition count 131
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 94 transition count 131
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 93 transition count 130
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 93 transition count 130
Applied a total of 84 rules in 32 ms. Remains 93 /128 variables (removed 35) and now considering 130/247 (removed 117) transitions.
Finished structural reductions, in 1 iterations. Remains : 93/128 places, 130/247 transitions.
Incomplete random walk after 10000 steps, including 2237 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1626989 steps, run timeout after 3001 ms. (steps per millisecond=542 ) properties seen :{0=1, 2=1, 3=1}
Probabilistic random walk after 1626989 steps, saw 701826 distinct states, run finished after 3001 ms. (steps per millisecond=542 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 130 rows 93 cols
[2022-06-11 14:33:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:33:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 14:33:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 14:33:59] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 14:33:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:33:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 14:33:59] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 14:33:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-11 14:33:59] [INFO ] After 16ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 14:33:59] [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 15 ms.
[2022-06-11 14:33:59] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 93/93 places, 130/130 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 90 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 90 transition count 106
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 87 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 87 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 87 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 85 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 85 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 85 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 84 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 83 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 83 transition count 96
Applied a total of 23 rules in 14 ms. Remains 83 /93 variables (removed 10) and now considering 96/130 (removed 34) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/93 places, 96/130 transitions.
Incomplete random walk after 10000 steps, including 2227 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1119908 steps, run visited all 1 properties in 1226 ms. (steps per millisecond=913 )
Probabilistic random walk after 1119908 steps, saw 497321 distinct states, run finished after 1226 ms. (steps per millisecond=913 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 40 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G((X(p0) U (G(p0)&&p1))))))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 129 transition count 172
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 129 transition count 172
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 112 transition count 153
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 112 transition count 153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 77 place count 112 transition count 144
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 103 transition count 134
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 103 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 99 place count 103 transition count 130
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 99 transition count 126
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 99 transition count 126
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 96 transition count 123
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 95 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 94 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 93 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 91 transition count 117
Applied a total of 123 rules in 27 ms. Remains 91 /146 variables (removed 55) and now considering 117/281 (removed 164) transitions.
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 14:34:01] [INFO ] Computed 5 place invariants in 16 ms
[2022-06-11 14:34:01] [INFO ] Implicit Places using invariants in 201 ms returned []
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 14:34:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:34:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 14:34:01] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2022-06-11 14:34:01] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 14:34:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:34:01] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/146 places, 117/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/146 places, 117/281 transitions.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), false]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 3}], [{ cond=p0, acceptance={1} source=3 dest: 1}, { cond=p0, acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-00 finished in 960 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)&&p1))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 128 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 128 transition count 163
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 110 transition count 143
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 110 transition count 143
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 82 place count 110 transition count 133
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 91 place count 101 transition count 123
Iterating global reduction 1 with 9 rules applied. Total rules applied 100 place count 101 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 104 place count 101 transition count 119
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 97 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 97 transition count 115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 94 transition count 112
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 92 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 124 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 90 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 89 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 88 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 133 place count 87 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 87 transition count 102
Applied a total of 134 rules in 21 ms. Remains 87 /146 variables (removed 59) and now considering 102/281 (removed 179) transitions.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:34:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:34:02] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:34:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:34:02] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:34:02] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:34:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:34:02] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/146 places, 102/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/146 places, 102/281 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s82 1)), p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 37376 reset in 306 ms.
Product exploration explored 100000 steps with 37312 reset in 174 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 444 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 505 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1163135 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :{2=1}
Probabilistic random walk after 1163135 steps, saw 484171 distinct states, run finished after 3001 ms. (steps per millisecond=387 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:34:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:34:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:34:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 14:34:07] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:34:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:34:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 14:34:07] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:34:07] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:34:07] [INFO ] After 33ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:34:07] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-06-11 14:34:07] [INFO ] After 186ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 247 edges and 87 vertex of which 86 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 86 transition count 100
Applied a total of 3 rules in 4 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/87 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 525 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 464 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 864136 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{}
Probabilistic random walk after 864136 steps, saw 359979 distinct states, run finished after 3002 ms. (steps per millisecond=287 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:34:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:34:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:34:10] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 14:34:10] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:34:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:34:10] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 14:34:10] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:34:10] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 14:34:10] [INFO ] After 32ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:34:10] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-11 14:34:10] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:34:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:34:10] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:34:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:34:10] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 14:34:11] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2022-06-11 14:34:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:34:11] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:34:11] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 100/100 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 86 transition count 94
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 81 transition count 94
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 81 transition count 81
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 68 transition count 81
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 61 transition count 74
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 61 transition count 74
Applied a total of 52 rules in 22 ms. Remains 61 /86 variables (removed 25) and now considering 74/100 (removed 26) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 74 rows 61 cols
[2022-06-11 14:34:11] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:34:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:34:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:34:11] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:34:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2022-06-11 14:34:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 18 ms returned sat
[2022-06-11 14:34:11] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:34:11] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-06-11 14:34:11] [INFO ] After 698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:34:11] [INFO ] Flatten gal took : 7 ms
[2022-06-11 14:34:12] [INFO ] Flatten gal took : 5 ms
[2022-06-11 14:34:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4660390227802234761.gal : 33 ms
[2022-06-11 14:34:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11090413065275325931.prop : 10 ms
Invoking ITS tools like this :cd /tmp/redAtoms9259392255102030627;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4660390227802234761.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11090413065275325931.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11090413065275325931.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :194 after 260
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :260 after 395
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :395 after 1777
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1777 after 10979
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10979 after 84651
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :84651 after 841273
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :841273 after 1.16357e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.16357e+07 after 1.31529e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.31529e+08 after 1.51654e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.51654e+09 after 1.53177e+10
Detected timeout of ITS tools.
[2022-06-11 14:34:27] [INFO ] Flatten gal took : 8 ms
[2022-06-11 14:34:27] [INFO ] Applying decomposition
[2022-06-11 14:34:27] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9675129334231080314.txt' '-o' '/tmp/graph9675129334231080314.bin' '-w' '/tmp/graph9675129334231080314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9675129334231080314.bin' '-l' '-1' '-v' '-w' '/tmp/graph9675129334231080314.weights' '-q' '0' '-e' '0.001'
[2022-06-11 14:34:27] [INFO ] Decomposing Gal with order
[2022-06-11 14:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 14:34:27] [INFO ] Removed a total of 58 redundant transitions.
[2022-06-11 14:34:27] [INFO ] Flatten gal took : 73 ms
[2022-06-11 14:34:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 4 ms.
[2022-06-11 14:34:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17026562525392251542.gal : 19 ms
[2022-06-11 14:34:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11823609165826852185.prop : 5 ms
Invoking ITS tools like this :cd /tmp/redAtoms9259392255102030627;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17026562525392251542.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11823609165826852185.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality11823609165826852185.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 242
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :242 after 1169
Reachability property apf0 is true.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1169 after 4248
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15414082146724544822
[2022-06-11 14:34:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15414082146724544822
Running compilation step : cd /tmp/ltsmin15414082146724544822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 216 ms.
Running link step : cd /tmp/ltsmin15414082146724544822;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15414082146724544822;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
LTSmin run took 11958 ms.
Found Violation
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:34:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:34:55] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:34:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:34:55] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:34:55] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:34:55] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-11 14:34:55] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 102/102 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 728176 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{2=1}
Probabilistic random walk after 728176 steps, saw 306148 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:34:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:34:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:34:59] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 14:34:59] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:34:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 14:34:59] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 14:34:59] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:34:59] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:34:59] [INFO ] After 31ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:34:59] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-11 14:34:59] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 247 edges and 87 vertex of which 86 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 86 transition count 100
Applied a total of 3 rules in 5 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/87 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 468 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 757956 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :{}
Probabilistic random walk after 757956 steps, saw 318327 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:35:02] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:35:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:35:02] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 14:35:02] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:35:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:35:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 14:35:03] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:35:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 14:35:03] [INFO ] After 32ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:35:03] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-11 14:35:03] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:35:03] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:35:03] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:35:03] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:35:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 14:35:03] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2022-06-11 14:35:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:35:03] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 14:35:03] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 100/100 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 86 transition count 94
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 81 transition count 94
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 81 transition count 81
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 68 transition count 81
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 61 transition count 74
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 61 transition count 74
Applied a total of 52 rules in 11 ms. Remains 61 /86 variables (removed 25) and now considering 74/100 (removed 26) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 74 rows 61 cols
[2022-06-11 14:35:03] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:35:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:35:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:35:03] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:35:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:35:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:35:03] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:35:03] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-11 14:35:03] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:35:03] [INFO ] Flatten gal took : 12 ms
[2022-06-11 14:35:03] [INFO ] Flatten gal took : 4 ms
[2022-06-11 14:35:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1479043362992459255.gal : 35 ms
[2022-06-11 14:35:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6877152093164756861.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13393758394149299516;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1479043362992459255.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6877152093164756861.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6877152093164756861.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :194 after 260
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :260 after 395
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :395 after 1777
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1777 after 10979
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10979 after 84651
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :84651 after 841273
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :841273 after 1.16357e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.16357e+07 after 1.31529e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.31529e+08 after 1.51654e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.51654e+09 after 1.53177e+10
Detected timeout of ITS tools.
[2022-06-11 14:35:18] [INFO ] Flatten gal took : 30 ms
[2022-06-11 14:35:18] [INFO ] Applying decomposition
[2022-06-11 14:35:18] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12139602202297378786.txt' '-o' '/tmp/graph12139602202297378786.bin' '-w' '/tmp/graph12139602202297378786.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12139602202297378786.bin' '-l' '-1' '-v' '-w' '/tmp/graph12139602202297378786.weights' '-q' '0' '-e' '0.001'
[2022-06-11 14:35:18] [INFO ] Decomposing Gal with order
[2022-06-11 14:35:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 14:35:18] [INFO ] Removed a total of 41 redundant transitions.
[2022-06-11 14:35:18] [INFO ] Flatten gal took : 28 ms
[2022-06-11 14:35:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 1 ms.
[2022-06-11 14:35:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3616173707342085392.gal : 2 ms
[2022-06-11 14:35:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality333327230467847940.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms13393758394149299516;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3616173707342085392.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality333327230467847940.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/ReachabilityCardinality333327230467847940.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3 after 11
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :11 after 30
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :30 after 125
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :125 after 338
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :338 after 1173
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1173 after 3165
Reachability property apf0 is true.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3165 after 7578
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7578 after 12464
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :12464 after 22166
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :22166 after 43853
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :43853 after 95846
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9511628662359357518
[2022-06-11 14:35:34] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9511628662359357518
Running compilation step : cd /tmp/ltsmin9511628662359357518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin9511628662359357518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin9511628662359357518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
LTSmin run took 7873 ms.
Found Violation
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 37321 reset in 128 ms.
Product exploration explored 100000 steps with 37285 reset in 134 ms.
Built C files in :
/tmp/ltsmin18250794273253746167
[2022-06-11 14:35:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18250794273253746167
Running compilation step : cd /tmp/ltsmin18250794273253746167;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin18250794273253746167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18250794273253746167;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8077910671368587344.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:35:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:35:58] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:35:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:35:58] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:35:58] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:35:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:35:58] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin5527062350497547778
[2022-06-11 14:35:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5527062350497547778
Running compilation step : cd /tmp/ltsmin5527062350497547778;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 170 ms.
Running link step : cd /tmp/ltsmin5527062350497547778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin5527062350497547778;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2508308407397841752.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 14:36:13] [INFO ] Flatten gal took : 8 ms
[2022-06-11 14:36:13] [INFO ] Flatten gal took : 6 ms
[2022-06-11 14:36:13] [INFO ] Time to serialize gal into /tmp/LTL6036763322093917650.gal : 1 ms
[2022-06-11 14:36:13] [INFO ] Time to serialize properties into /tmp/LTL8465830208130065954.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6036763322093917650.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8465830208130065954.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6036763...266
Read 1 LTL properties
Checking formula 0 : !((G(F((X("((s1<1)||(l969<1))"))&&("((s1<1)||(l1188<1))")))))
Formula 0 simplified : !GF("((s1<1)||(l1188<1))" & X"((s1<1)||(l969<1))")
Detected timeout of ITS tools.
[2022-06-11 14:36:28] [INFO ] Flatten gal took : 8 ms
[2022-06-11 14:36:28] [INFO ] Applying decomposition
[2022-06-11 14:36:28] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12971987342582284429.txt' '-o' '/tmp/graph12971987342582284429.bin' '-w' '/tmp/graph12971987342582284429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12971987342582284429.bin' '-l' '-1' '-v' '-w' '/tmp/graph12971987342582284429.weights' '-q' '0' '-e' '0.001'
[2022-06-11 14:36:28] [INFO ] Decomposing Gal with order
[2022-06-11 14:36:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 14:36:28] [INFO ] Removed a total of 87 redundant transitions.
[2022-06-11 14:36:28] [INFO ] Flatten gal took : 19 ms
[2022-06-11 14:36:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 3 ms.
[2022-06-11 14:36:28] [INFO ] Time to serialize gal into /tmp/LTL6781654981148473390.gal : 2 ms
[2022-06-11 14:36:28] [INFO ] Time to serialize properties into /tmp/LTL17601233756385680860.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6781654981148473390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17601233756385680860.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6781654...246
Read 1 LTL properties
Checking formula 0 : !((G(F((X("((i6.u0.s1<1)||(i6.u15.l969<1))"))&&("((i6.u0.s1<1)||(u16.l1188<1))")))))
Formula 0 simplified : !GF("((i6.u0.s1<1)||(u16.l1188<1))" & X"((i6.u0.s1<1)||(i6.u15.l969<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15021109687899373729
[2022-06-11 14:36:43] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15021109687899373729
Running compilation step : cd /tmp/ltsmin15021109687899373729;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 168 ms.
Running link step : cd /tmp/ltsmin15021109687899373729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15021109687899373729;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 finished in 176398 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0) U p1)&&X(G(p2))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 129 transition count 172
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 129 transition count 172
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 112 transition count 153
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 112 transition count 153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 77 place count 112 transition count 144
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 103 transition count 134
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 103 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 99 place count 103 transition count 130
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 99 transition count 126
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 99 transition count 126
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 96 transition count 123
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 95 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 94 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 93 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 93 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 91 transition count 117
Applied a total of 123 rules in 9 ms. Remains 91 /146 variables (removed 55) and now considering 117/281 (removed 164) transitions.
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 14:36:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:36:58] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 14:36:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:36:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 14:36:58] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 91 cols
[2022-06-11 14:36:59] [INFO ] Computed 5 place invariants in 13 ms
[2022-06-11 14:36:59] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/146 places, 117/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/146 places, 117/281 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (OR (NOT p2) p0), (OR (NOT p2) p1), (NOT p2), (OR (NOT p2) (AND p0 p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s35 1) (GEQ s1 1) (GEQ s86 1)), p0:(AND (GEQ s1 1) (GEQ s85 1)), p1:(AND (GEQ s1 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-03 finished in 505 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U X(G(p0)))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 128 transition count 157
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 128 transition count 157
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 110 transition count 137
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 110 transition count 137
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 84 place count 110 transition count 125
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 94 place count 100 transition count 114
Iterating global reduction 1 with 10 rules applied. Total rules applied 104 place count 100 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 109 place count 100 transition count 109
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 95 transition count 104
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 95 transition count 104
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 91 transition count 100
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 91 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 130 place count 88 transition count 97
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 88 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 135 place count 88 transition count 95
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 138 place count 85 transition count 92
Iterating global reduction 3 with 3 rules applied. Total rules applied 141 place count 85 transition count 92
Applied a total of 141 rules in 5 ms. Remains 85 /146 variables (removed 61) and now considering 92/281 (removed 189) transitions.
// Phase 1: matrix 92 rows 85 cols
[2022-06-11 14:36:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:36:59] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 92 rows 85 cols
[2022-06-11 14:36:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:36:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-11 14:36:59] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
// Phase 1: matrix 92 rows 85 cols
[2022-06-11 14:36:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:36:59] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/146 places, 92/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/146 places, 92/281 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s1 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-04 finished in 391 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 128 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 128 transition count 163
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 110 transition count 143
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 110 transition count 143
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 82 place count 110 transition count 133
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 92 place count 100 transition count 122
Iterating global reduction 1 with 10 rules applied. Total rules applied 102 place count 100 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 107 place count 100 transition count 117
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 95 transition count 112
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 95 transition count 112
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 91 transition count 108
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 91 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 89 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 89 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 89 transition count 104
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 87 transition count 102
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 86 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 85 transition count 99
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 85 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 84 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 84 transition count 98
Applied a total of 141 rules in 8 ms. Remains 84 /146 variables (removed 62) and now considering 98/281 (removed 183) transitions.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 14:36:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:36:59] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 14:36:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:36:59] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 14:36:59] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 98 rows 84 cols
[2022-06-11 14:36:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:36:59] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/146 places, 98/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/146 places, 98/281 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 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 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, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-05 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p1)||F(p2)||X(p3)||p0))))'
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 130 transition count 181
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 130 transition count 181
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 114 transition count 163
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 114 transition count 163
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 72 place count 114 transition count 155
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 107 transition count 148
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 107 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 89 place count 107 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 105 transition count 143
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 105 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 104 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 104 transition count 142
Applied a total of 95 rules in 5 ms. Remains 104 /146 variables (removed 42) and now considering 142/281 (removed 139) transitions.
// Phase 1: matrix 142 rows 104 cols
[2022-06-11 14:37:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:00] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 142 rows 104 cols
[2022-06-11 14:37:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:00] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-11 14:37:00] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 104 cols
[2022-06-11 14:37:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:00] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/146 places, 142/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/146 places, 142/281 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s97 1)) (AND (GEQ s1 1) (GEQ s99 1))), p2:(AND (GEQ s1 1) (GEQ s57 1)), p1:(AND (GEQ s1 1) (GEQ s98 1)), p3:(AND (GEQ s1 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-06 finished in 783 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((X((X(p3)&&p2))&&p1)))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 128 transition count 157
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 128 transition count 157
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 110 transition count 137
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 110 transition count 137
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 84 place count 110 transition count 125
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 93 place count 101 transition count 115
Iterating global reduction 1 with 9 rules applied. Total rules applied 102 place count 101 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 101 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 97 transition count 107
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 97 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 94 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 94 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 92 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 92 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 92 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 90 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 90 transition count 99
Applied a total of 129 rules in 24 ms. Remains 90 /146 variables (removed 56) and now considering 99/281 (removed 182) transitions.
// Phase 1: matrix 99 rows 90 cols
[2022-06-11 14:37:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:00] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 99 rows 90 cols
[2022-06-11 14:37:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-11 14:37:00] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2022-06-11 14:37:01] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 99 rows 90 cols
[2022-06-11 14:37:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:01] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/146 places, 99/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/146 places, 99/281 transitions.
Stuttering acceptance computed with spot in 58 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s52 1)), p1:(AND (GEQ s1 1) (GEQ s83 1)), p2:(AND (GEQ s1 1) (GEQ s83 1)), p3:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-08 finished in 398 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(X(G(p1)))||p0))&&F(p2))))'
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 129 transition count 172
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 129 transition count 172
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 50 place count 113 transition count 154
Iterating global reduction 0 with 16 rules applied. Total rules applied 66 place count 113 transition count 154
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 74 place count 113 transition count 146
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 82 place count 105 transition count 137
Iterating global reduction 1 with 8 rules applied. Total rules applied 90 place count 105 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 105 transition count 133
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 101 transition count 129
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 101 transition count 129
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 98 transition count 126
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 98 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 97 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 97 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 96 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 96 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 95 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 95 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 94 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 93 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 93 transition count 120
Applied a total of 118 rules in 27 ms. Remains 93 /146 variables (removed 53) and now considering 120/281 (removed 161) transitions.
// Phase 1: matrix 120 rows 93 cols
[2022-06-11 14:37:01] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:01] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 120 rows 93 cols
[2022-06-11 14:37:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-11 14:37:01] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
// Phase 1: matrix 120 rows 93 cols
[2022-06-11 14:37:01] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:37:01] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/146 places, 120/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 93/146 places, 120/281 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s88 1)), p0:(OR (AND (GEQ s1 1) (GEQ s87 1)) (LT s22 1) (LT s60 1)), p1:(OR (LT s1 1) (LT 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 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-09 finished in 638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 127 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 127 transition count 154
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 56 place count 109 transition count 134
Iterating global reduction 0 with 18 rules applied. Total rules applied 74 place count 109 transition count 134
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 84 place count 109 transition count 124
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 94 place count 99 transition count 113
Iterating global reduction 1 with 10 rules applied. Total rules applied 104 place count 99 transition count 113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 109 place count 99 transition count 108
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 94 transition count 103
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 94 transition count 103
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 90 transition count 99
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 90 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 88 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 88 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 88 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 134 place count 86 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 85 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 84 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 83 transition count 90
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 83 transition count 90
Applied a total of 142 rules in 8 ms. Remains 83 /146 variables (removed 63) and now considering 90/281 (removed 191) transitions.
// Phase 1: matrix 90 rows 83 cols
[2022-06-11 14:37:01] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:02] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 90 rows 83 cols
[2022-06-11 14:37:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2022-06-11 14:37:02] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 83 cols
[2022-06-11 14:37:02] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:02] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/146 places, 90/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/146 places, 90/281 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s19 1) (GEQ s57 1)), p1:(AND (GEQ s19 1) (GEQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-11 finished in 748 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(X(p2)&&p1))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 129 transition count 164
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 129 transition count 164
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 50 place count 113 transition count 147
Iterating global reduction 0 with 16 rules applied. Total rules applied 66 place count 113 transition count 147
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 73 place count 113 transition count 140
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 83 place count 103 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 93 place count 103 transition count 128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 98 place count 103 transition count 123
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 98 transition count 118
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 98 transition count 118
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 94 transition count 114
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 94 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 92 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 92 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 92 transition count 110
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 90 transition count 108
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 90 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 89 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 89 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 88 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 88 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 87 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 87 transition count 104
Applied a total of 132 rules in 6 ms. Remains 87 /146 variables (removed 59) and now considering 104/281 (removed 177) transitions.
// Phase 1: matrix 104 rows 87 cols
[2022-06-11 14:37:02] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:02] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 104 rows 87 cols
[2022-06-11 14:37:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:02] [INFO ] State equation strengthened by 47 read => feed constraints.
[2022-06-11 14:37:02] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 87 cols
[2022-06-11 14:37:02] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:02] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/146 places, 104/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/146 places, 104/281 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s50 1)) (AND (GEQ s1 1) (GEQ s82 1))), p1:(AND (GEQ s1 1) (GEQ s81 1)), p2:(AND (GEQ s1 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-12 finished in 452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(G(p0) U !((F(p1) U !p0)&&G(p2))))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 129 transition count 172
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 129 transition count 172
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 112 transition count 153
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 112 transition count 153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 77 place count 112 transition count 144
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 86 place count 103 transition count 134
Iterating global reduction 1 with 9 rules applied. Total rules applied 95 place count 103 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 100 place count 103 transition count 129
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 98 transition count 124
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 98 transition count 124
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 94 transition count 120
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 94 transition count 120
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 92 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 92 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 92 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 90 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 90 transition count 113
Applied a total of 129 rules in 31 ms. Remains 90 /146 variables (removed 56) and now considering 113/281 (removed 168) transitions.
// Phase 1: matrix 113 rows 90 cols
[2022-06-11 14:37:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:03] [INFO ] Implicit Places using invariants in 438 ms returned []
// Phase 1: matrix 113 rows 90 cols
[2022-06-11 14:37:03] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:03] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-11 14:37:03] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2022-06-11 14:37:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 113 rows 90 cols
[2022-06-11 14:37:03] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:37:03] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/146 places, 113/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/146 places, 113/281 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s43 1)), p0:(AND (GEQ s1 1) (GEQ s85 1)), p1:(AND (GEQ s1 1) (GEQ s84 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 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-13 finished in 1048 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 127 transition count 154
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 127 transition count 154
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 108 transition count 133
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 108 transition count 133
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 87 place count 108 transition count 122
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 98 place count 97 transition count 110
Iterating global reduction 1 with 11 rules applied. Total rules applied 109 place count 97 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 115 place count 97 transition count 104
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 121 place count 91 transition count 98
Iterating global reduction 2 with 6 rules applied. Total rules applied 127 place count 91 transition count 98
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 132 place count 86 transition count 93
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 86 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 84 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 84 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 84 transition count 90
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 82 transition count 88
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 81 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 80 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 79 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 79 transition count 84
Applied a total of 152 rules in 8 ms. Remains 79 /146 variables (removed 67) and now considering 84/281 (removed 197) transitions.
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 14:37:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:04] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 14:37:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:04] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-11 14:37:04] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 84 rows 79 cols
[2022-06-11 14:37:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:04] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/146 places, 84/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 79/146 places, 84/281 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-14 finished in 357 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)&&p1))))'
Found a CL insensitive property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-01
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 146/146 places, 281/281 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 128 transition count 163
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 128 transition count 163
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 110 transition count 143
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 110 transition count 143
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 82 place count 110 transition count 133
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 91 place count 101 transition count 123
Iterating global reduction 1 with 9 rules applied. Total rules applied 100 place count 101 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 104 place count 101 transition count 119
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 97 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 97 transition count 115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 94 transition count 112
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 94 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 92 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 92 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 124 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 90 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 90 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 89 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 89 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 88 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 88 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 133 place count 87 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 87 transition count 102
Applied a total of 134 rules in 26 ms. Remains 87 /146 variables (removed 59) and now considering 102/281 (removed 179) transitions.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:37:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:04] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:37:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:04] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:37:04] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:37:04] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:04] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 87/146 places, 102/281 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/146 places, 102/281 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s82 1)), p0:(OR (LT s1 1) (LT s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 37426 reset in 131 ms.
Product exploration explored 100000 steps with 37348 reset in 133 ms.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 222 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 453 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 469 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 604469 steps, run timeout after 3001 ms. (steps per millisecond=201 ) properties seen :{2=1}
Probabilistic random walk after 604469 steps, saw 252799 distinct states, run finished after 3001 ms. (steps per millisecond=201 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:37:08] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:37:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:37:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 14:37:08] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:37:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 14:37:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 14:37:08] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:08] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:37:08] [INFO ] After 31ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:08] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-06-11 14:37:08] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 247 edges and 87 vertex of which 86 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 86 transition count 100
Applied a total of 3 rules in 2 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/87 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 854407 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 854407 steps, saw 356380 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:37:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:37:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:37:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 14:37:12] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:37:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:37:12] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 14:37:12] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:12] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 14:37:12] [INFO ] After 34ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:12] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-11 14:37:12] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:37:12] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 14:37:12] [INFO ] Implicit Places using invariants in 297 ms returned []
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:37:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:37:12] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 14:37:12] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2022-06-11 14:37:12] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:37:12] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:37:12] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 100/100 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 86 transition count 94
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 81 transition count 94
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 81 transition count 81
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 68 transition count 81
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 61 transition count 74
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 61 transition count 74
Applied a total of 52 rules in 4 ms. Remains 61 /86 variables (removed 25) and now considering 74/100 (removed 26) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 74 rows 61 cols
[2022-06-11 14:37:12] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:37:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:37:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:37:12] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:37:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-11 14:37:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 14:37:12] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:12] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-11 14:37:13] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:13] [INFO ] Flatten gal took : 7 ms
[2022-06-11 14:37:13] [INFO ] Flatten gal took : 5 ms
[2022-06-11 14:37:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3867987138778497400.gal : 1 ms
[2022-06-11 14:37:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality703827274962701427.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15572295167398815499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3867987138778497400.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality703827274962701427.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...318
Loading property file /tmp/ReachabilityCardinality703827274962701427.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :194 after 260
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :260 after 395
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :395 after 1777
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1777 after 10979
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10979 after 84651
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :84651 after 841273
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :841273 after 1.16357e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.16357e+07 after 1.31529e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.31529e+08 after 1.51654e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.51654e+09 after 1.53177e+10
Detected timeout of ITS tools.
[2022-06-11 14:37:28] [INFO ] Flatten gal took : 4 ms
[2022-06-11 14:37:28] [INFO ] Applying decomposition
[2022-06-11 14:37:28] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6099187672373245689.txt' '-o' '/tmp/graph6099187672373245689.bin' '-w' '/tmp/graph6099187672373245689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6099187672373245689.bin' '-l' '-1' '-v' '-w' '/tmp/graph6099187672373245689.weights' '-q' '0' '-e' '0.001'
[2022-06-11 14:37:28] [INFO ] Decomposing Gal with order
[2022-06-11 14:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 14:37:28] [INFO ] Removed a total of 49 redundant transitions.
[2022-06-11 14:37:28] [INFO ] Flatten gal took : 8 ms
[2022-06-11 14:37:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 2 ms.
[2022-06-11 14:37:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10321873279884479980.gal : 1 ms
[2022-06-11 14:37:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15757149246854178519.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms15572295167398815499;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10321873279884479980.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15757149246854178519.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality15757149246854178519.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 15
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :15 after 33
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :33 after 76
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :76 after 173
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :173 after 1119
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1119 after 5156
Reachability property apf0 is true.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5156 after 23886
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :23886 after 59795
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :59795 after 162091
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6307500751732159382
[2022-06-11 14:37:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6307500751732159382
Running compilation step : cd /tmp/ltsmin6307500751732159382;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 135 ms.
Running link step : cd /tmp/ltsmin6307500751732159382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin6307500751732159382;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
LTSmin run took 3267 ms.
Found Violation
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:37:46] [INFO ] Computed 5 place invariants in 2 ms
[2022-06-11 14:37:47] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:37:47] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:47] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:37:47] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:37:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:37:47] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 102/102 transitions.
Computed a total of 13 stabilizing places and 14 stable transitions
Computed a total of 13 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 497 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1019053 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{2=1}
Probabilistic random walk after 1019053 steps, saw 424339 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:37:50] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:37:50] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 14:37:50] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 14:37:50] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:37:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-06-11 14:37:51] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 14:37:51] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:51] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:37:51] [INFO ] After 33ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:51] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-06-11 14:37:51] [INFO ] After 149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 102/102 transitions.
Graph (complete) has 247 edges and 87 vertex of which 86 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 86 transition count 100
Applied a total of 3 rules in 3 ms. Remains 86 /87 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/87 places, 100/102 transitions.
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 820265 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :{}
Probabilistic random walk after 820265 steps, saw 343033 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:37:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:37:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:37:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 14:37:54] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:37:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 14:37:54] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 14:37:54] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 14:37:54] [INFO ] After 31ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:54] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-11 14:37:54] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 100/100 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:37:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:37:54] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:37:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:37:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-11 14:37:54] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2022-06-11 14:37:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 100 rows 86 cols
[2022-06-11 14:37:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 14:37:54] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 100/100 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 86 transition count 94
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 81 transition count 94
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 11 place count 81 transition count 81
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 37 place count 68 transition count 81
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 51 place count 61 transition count 74
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 61 transition count 74
Applied a total of 52 rules in 4 ms. Remains 61 /86 variables (removed 25) and now considering 74/100 (removed 26) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 74 rows 61 cols
[2022-06-11 14:37:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 14:37:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:37:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 14:37:54] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 14:37:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 14:37:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 14:37:55] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:55] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-11 14:37:55] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-11 14:37:55] [INFO ] Flatten gal took : 8 ms
[2022-06-11 14:37:55] [INFO ] Flatten gal took : 5 ms
[2022-06-11 14:37:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3497087922730832843.gal : 1 ms
[2022-06-11 14:37:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11996941163906781687.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10872359363475641874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3497087922730832843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11996941163906781687.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11996941163906781687.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 41
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :41 after 194
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :194 after 260
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :260 after 395
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :395 after 1777
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1777 after 10979
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :10979 after 84651
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :84651 after 841273
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :841273 after 1.16357e+07
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.16357e+07 after 1.31529e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.31529e+08 after 1.51654e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.51654e+09 after 1.53177e+10
Detected timeout of ITS tools.
[2022-06-11 14:38:10] [INFO ] Flatten gal took : 4 ms
[2022-06-11 14:38:10] [INFO ] Applying decomposition
[2022-06-11 14:38:10] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7889105356366117257.txt' '-o' '/tmp/graph7889105356366117257.bin' '-w' '/tmp/graph7889105356366117257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7889105356366117257.bin' '-l' '-1' '-v' '-w' '/tmp/graph7889105356366117257.weights' '-q' '0' '-e' '0.001'
[2022-06-11 14:38:10] [INFO ] Decomposing Gal with order
[2022-06-11 14:38:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 14:38:10] [INFO ] Removed a total of 42 redundant transitions.
[2022-06-11 14:38:10] [INFO ] Flatten gal took : 8 ms
[2022-06-11 14:38:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 2 ms.
[2022-06-11 14:38:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13043446405336334857.gal : 2 ms
[2022-06-11 14:38:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15878935259554857080.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10872359363475641874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13043446405336334857.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15878935259554857080.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality15878935259554857080.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 9
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :9 after 14
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14 after 97
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :97 after 173
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :173 after 564
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :564 after 1431
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1431 after 3744
Reachability property apf0 is true.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3744 after 9086
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9086 after 16102
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :16102 after 31296
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :31296 after 70069
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :70069 after 171564
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :171564 after 450677
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14932859617813523338
[2022-06-11 14:38:25] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14932859617813523338
Running compilation step : cd /tmp/ltsmin14932859617813523338;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin14932859617813523338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin14932859617813523338;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf1==true'
LTSmin run took 10274 ms.
Found Violation
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 247 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 37418 reset in 124 ms.
Product exploration explored 100000 steps with 37250 reset in 175 ms.
Built C files in :
/tmp/ltsmin414322500137668765
[2022-06-11 14:38:36] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin414322500137668765
Running compilation step : cd /tmp/ltsmin414322500137668765;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin414322500137668765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin414322500137668765;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4675043284993363727.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:38:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-11 14:38:51] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:38:51] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:38:51] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-11 14:38:51] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 102 rows 87 cols
[2022-06-11 14:38:51] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-11 14:38:52] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin17288879276934643535
[2022-06-11 14:38:52] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17288879276934643535
Running compilation step : cd /tmp/ltsmin17288879276934643535;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 195 ms.
Running link step : cd /tmp/ltsmin17288879276934643535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17288879276934643535;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17354788273620285325.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-11 14:39:07] [INFO ] Flatten gal took : 6 ms
[2022-06-11 14:39:07] [INFO ] Flatten gal took : 4 ms
[2022-06-11 14:39:07] [INFO ] Time to serialize gal into /tmp/LTL1767447074380730330.gal : 1 ms
[2022-06-11 14:39:07] [INFO ] Time to serialize properties into /tmp/LTL8503623605467463491.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1767447074380730330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8503623605467463491.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1767447...266
Read 1 LTL properties
Checking formula 0 : !((G(F((X("((s1<1)||(l969<1))"))&&("((s1<1)||(l1188<1))")))))
Formula 0 simplified : !GF("((s1<1)||(l1188<1))" & X"((s1<1)||(l969<1))")
Detected timeout of ITS tools.
[2022-06-11 14:39:22] [INFO ] Flatten gal took : 5 ms
[2022-06-11 14:39:22] [INFO ] Applying decomposition
[2022-06-11 14:39:22] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2473627723729755041.txt' '-o' '/tmp/graph2473627723729755041.bin' '-w' '/tmp/graph2473627723729755041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2473627723729755041.bin' '-l' '-1' '-v' '-w' '/tmp/graph2473627723729755041.weights' '-q' '0' '-e' '0.001'
[2022-06-11 14:39:22] [INFO ] Decomposing Gal with order
[2022-06-11 14:39:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 14:39:22] [INFO ] Removed a total of 100 redundant transitions.
[2022-06-11 14:39:22] [INFO ] Flatten gal took : 8 ms
[2022-06-11 14:39:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 87 labels/synchronizations in 2 ms.
[2022-06-11 14:39:22] [INFO ] Time to serialize gal into /tmp/LTL17044615776890751730.gal : 6 ms
[2022-06-11 14:39:22] [INFO ] Time to serialize properties into /tmp/LTL9205961500823518226.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17044615776890751730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9205961500823518226.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1704461...246
Read 1 LTL properties
Checking formula 0 : !((G(F((X("((i6.u0.s1<1)||(i6.u17.l969<1))"))&&("((i6.u0.s1<1)||(i7.u19.l1188<1))")))))
Formula 0 simplified : !GF("((i6.u0.s1<1)||(i7.u19.l1188<1))" & X"((i6.u0.s1<1)||(i6.u17.l969<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9579092843921710173
[2022-06-11 14:39:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9579092843921710173
Running compilation step : cd /tmp/ltsmin9579092843921710173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 316 ms.
Running link step : cd /tmp/ltsmin9579092843921710173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin9579092843921710173;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d1m96-LTLFireability-01 finished in 168000 ms.
[2022-06-11 14:39:52] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10419109556840342630
[2022-06-11 14:39:52] [INFO ] Applying decomposition
[2022-06-11 14:39:52] [INFO ] Computing symmetric may disable matrix : 281 transitions.
[2022-06-11 14:39:52] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 14:39:52] [INFO ] Flatten gal took : 9 ms
[2022-06-11 14:39:52] [INFO ] Computing symmetric may enable matrix : 281 transitions.
[2022-06-11 14:39:52] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16406491703570482016.txt' '-o' '/tmp/graph16406491703570482016.bin' '-w' '/tmp/graph16406491703570482016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16406491703570482016.bin' '-l' '-1' '-v' '-w' '/tmp/graph16406491703570482016.weights' '-q' '0' '-e' '0.001'
[2022-06-11 14:39:52] [INFO ] Decomposing Gal with order
[2022-06-11 14:39:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 14:39:52] [INFO ] Computing Do-Not-Accords matrix : 281 transitions.
[2022-06-11 14:39:52] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 14:39:52] [INFO ] Removed a total of 188 redundant transitions.
[2022-06-11 14:39:52] [INFO ] Flatten gal took : 17 ms
[2022-06-11 14:39:52] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10419109556840342630
Running compilation step : cd /tmp/ltsmin10419109556840342630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 14:39:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 159 labels/synchronizations in 16 ms.
[2022-06-11 14:39:52] [INFO ] Time to serialize gal into /tmp/LTLFireability10961909794730565375.gal : 16 ms
[2022-06-11 14:39:52] [INFO ] Time to serialize properties into /tmp/LTLFireability2899504080779777596.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10961909794730565375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2899504080779777596.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((G(F((X("((u0.s1<1)||(i4.i1.u26.l969<1))"))&&("((u0.s1<1)||(u0.l1188<1))")))))
Formula 0 simplified : !GF("((u0.s1<1)||(u0.l1188<1))" & X"((u0.s1<1)||(i4.i1.u26.l969<1))")
Compilation finished in 555 ms.
Running link step : cd /tmp/ltsmin10419109556840342630;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10419109556840342630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: LTL layer: formula: [](<>((X((LTLAPp0==true))&&(LTLAPp1==true))))
pins2lts-mc-linux64( 3/ 8), 0.004: "[](<>((X((LTLAPp0==true))&&(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.076: DFS-FIFO for weak LTL, using special progress label 284
pins2lts-mc-linux64( 0/ 8), 0.076: There are 285 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.076: State length is 147, there are 288 groups
pins2lts-mc-linux64( 0/ 8), 0.076: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.076: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.076: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.076: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.087: ~2 levels ~960 states ~1744 transitions
pins2lts-mc-linux64( 2/ 8), 0.099: ~2 levels ~1920 states ~3552 transitions
pins2lts-mc-linux64( 2/ 8), 0.131: ~2 levels ~3840 states ~7040 transitions
pins2lts-mc-linux64( 2/ 8), 0.221: ~2 levels ~7680 states ~14928 transitions
pins2lts-mc-linux64( 2/ 8), 0.364: ~2 levels ~15360 states ~32032 transitions
pins2lts-mc-linux64( 2/ 8), 1.379: ~2 levels ~30720 states ~64400 transitions
pins2lts-mc-linux64( 2/ 8), 1.936: ~2 levels ~61440 states ~130064 transitions
pins2lts-mc-linux64( 2/ 8), 3.957: ~2 levels ~122880 states ~271376 transitions
pins2lts-mc-linux64( 0/ 8), 6.987: ~8 levels ~245760 states ~525464 transitions
pins2lts-mc-linux64( 0/ 8), 14.259: ~8 levels ~491520 states ~1053936 transitions
pins2lts-mc-linux64( 7/ 8), 24.923: ~9 levels ~983040 states ~2337808 transitions
pins2lts-mc-linux64( 7/ 8), 35.297: ~9 levels ~1966080 states ~4715952 transitions
pins2lts-mc-linux64( 7/ 8), 49.497: ~9 levels ~3932160 states ~9410704 transitions
pins2lts-mc-linux64( 7/ 8), 73.255: ~9 levels ~7864320 states ~18331168 transitions
pins2lts-mc-linux64( 7/ 8), 116.889: ~10 levels ~15728640 states ~38110952 transitions
pins2lts-mc-linux64( 7/ 8), 189.491: ~11 levels ~31457280 states ~79527144 transitions
pins2lts-mc-linux64( 7/ 8), 334.005: ~11 levels ~62914560 states ~155889560 transitions
pins2lts-mc-linux64( 7/ 8), 627.074: ~12 levels ~125829120 states ~306313424 transitions
pins2lts-mc-linux64( 6/ 8), 681.554: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 681.649:
pins2lts-mc-linux64( 0/ 8), 681.649: mean standard work distribution: 1.5% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 681.649:
pins2lts-mc-linux64( 0/ 8), 681.649: Explored 130624341 states 329988200 transitions, fanout: 2.526
pins2lts-mc-linux64( 0/ 8), 681.649: Total exploration time 681.560 sec (681.480 sec minimum, 681.516 sec on average)
pins2lts-mc-linux64( 0/ 8), 681.649: States per second: 191655, Transitions per second: 484166
pins2lts-mc-linux64( 0/ 8), 681.649:
pins2lts-mc-linux64( 0/ 8), 681.649: Progress states detected: 62904975
pins2lts-mc-linux64( 0/ 8), 681.649: Redundant explorations: -2.6769
pins2lts-mc-linux64( 0/ 8), 681.649:
pins2lts-mc-linux64( 0/ 8), 681.649: Queue width: 8B, total height: 7648569, memory: 58.35MB
pins2lts-mc-linux64( 0/ 8), 681.649: Tree memory: 1033.2MB, 8.1 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 681.649: Tree fill ratio (roots/leafs): 99.0%/3.0%
pins2lts-mc-linux64( 0/ 8), 681.649: Stored 283 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 681.649: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 681.649: Est. total memory use: 1091.6MB (~1082.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10419109556840342630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10419109556840342630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((X((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-11 15:01:57] [INFO ] Flatten gal took : 168 ms
[2022-06-11 15:01:58] [INFO ] Time to serialize gal into /tmp/LTLFireability12796160475856716584.gal : 38 ms
[2022-06-11 15:01:58] [INFO ] Time to serialize properties into /tmp/LTLFireability6769553959617156906.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12796160475856716584.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6769553959617156906.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((G(F((X("((s1<1)||(l969<1))"))&&("((s1<1)||(l1188<1))")))))
Formula 0 simplified : !GF("((s1<1)||(l1188<1))" & X"((s1<1)||(l969<1))")
Detected timeout of ITS tools.
[2022-06-11 15:24:11] [INFO ] Flatten gal took : 206 ms
[2022-06-11 15:24:11] [INFO ] Input system was already deterministic with 281 transitions.
[2022-06-11 15:24:11] [INFO ] Transformed 146 places.
[2022-06-11 15:24:11] [INFO ] Transformed 281 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-11 15:24:12] [INFO ] Time to serialize gal into /tmp/LTLFireability2543298747177680948.gal : 30 ms
[2022-06-11 15:24:12] [INFO ] Time to serialize properties into /tmp/LTLFireability13983451156196546613.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2543298747177680948.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13983451156196546613.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F((X("((s1<1)||(l969<1))"))&&("((s1<1)||(l1188<1))")))))
Formula 0 simplified : !GF("((s1<1)||(l1188<1))" & X"((s1<1)||(l969<1))")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m96, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472282900932"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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