fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r421-tajo-167905975200380
Last Updated
May 14, 2023

About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d0m36

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4877.159 3600000.00 6138493.00 1188.70 FFFTFFFFFFF?FF?F normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679177588815

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m36
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 22:13:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 22:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:13:11] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-18 22:13:11] [INFO ] Transformed 262 places.
[2023-03-18 22:13:11] [INFO ] Transformed 73 transitions.
[2023-03-18 22:13:11] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 65 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 65 transition count 68
Applied a total of 12 rules in 23 ms. Remains 65 /72 variables (removed 7) and now considering 68/73 (removed 5) transitions.
// Phase 1: matrix 68 rows 65 cols
[2023-03-18 22:13:11] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-18 22:13:11] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-18 22:13:11] [INFO ] Invariant cache hit.
[2023-03-18 22:13:11] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-18 22:13:11] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-18 22:13:11] [INFO ] Invariant cache hit.
[2023-03-18 22:13:11] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/72 places, 68/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 65/72 places, 68/73 transitions.
Support contains 25 out of 65 places after structural reductions.
[2023-03-18 22:13:11] [INFO ] Flatten gal took : 30 ms
[2023-03-18 22:13:11] [INFO ] Flatten gal took : 11 ms
[2023-03-18 22:13:12] [INFO ] Input system was already deterministic with 68 transitions.
Incomplete random walk after 10000 steps, including 2204 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 24) seen :10
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 486 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1013 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1533 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1049 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 1037 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 1050 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 498 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-18 22:13:13] [INFO ] Invariant cache hit.
[2023-03-18 22:13:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:13:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:13:13] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2023-03-18 22:13:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:13:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 22:13:13] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2023-03-18 22:13:13] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-18 22:13:13] [INFO ] After 56ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :2 sat :12
[2023-03-18 22:13:14] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-18 22:13:14] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 90 ms.
Support contains 14 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 68/68 transitions.
Graph (complete) has 176 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 63 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 63 transition count 65
Applied a total of 5 rules in 11 ms. Remains 63 /65 variables (removed 2) and now considering 65/68 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 63/65 places, 65/68 transitions.
Incomplete random walk after 10000 steps, including 2172 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 481 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 487 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 1043 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 494 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 496 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1049 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 996 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 1048 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 506 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 488 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Finished probabilistic random walk after 598100 steps, run visited all 12 properties in 1931 ms. (steps per millisecond=309 )
Probabilistic random walk after 598100 steps, saw 309249 distinct states, run finished after 1931 ms. (steps per millisecond=309 ) properties seen :12
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 200 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 25 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 22:13:17] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-18 22:13:17] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-18 22:13:17] [INFO ] Invariant cache hit.
[2023-03-18 22:13:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:13:17] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-18 22:13:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:13:17] [INFO ] Invariant cache hit.
[2023-03-18 22:13:17] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||F(p1)))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Applied a total of 10 rules in 12 ms. Remains 60 /65 variables (removed 5) and now considering 63/68 (removed 5) transitions.
// Phase 1: matrix 63 rows 60 cols
[2023-03-18 22:13:17] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-18 22:13:18] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-18 22:13:18] [INFO ] Invariant cache hit.
[2023-03-18 22:13:18] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 22:13:18] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-18 22:13:18] [INFO ] Invariant cache hit.
[2023-03-18 22:13:18] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 63/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 60/65 places, 63/68 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s21 1)), p0:(AND (GEQ s1 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 338 ms.
Product exploration explored 100000 steps with 33333 reset in 174 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 187 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 finished in 1096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X((G(p0)||(F((X(X(p0)) U p2))&&p1)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 12 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 22:13:19] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:13:19] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-18 22:13:19] [INFO ] Invariant cache hit.
[2023-03-18 22:13:19] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:13:19] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-18 22:13:19] [INFO ] Invariant cache hit.
[2023-03-18 22:13:19] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s1 1) (GEQ s50 1)), p0:(AND (GEQ s1 1) (GEQ s45 1)), p1:(AND (GEQ s1 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 finished in 512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((!p0 U (p1||G(!p0))))&&(F(p3)||p2))))'
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Applied a total of 8 rules in 4 ms. Remains 61 /65 variables (removed 4) and now considering 64/68 (removed 4) transitions.
// Phase 1: matrix 64 rows 61 cols
[2023-03-18 22:13:19] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-18 22:13:19] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-18 22:13:19] [INFO ] Invariant cache hit.
[2023-03-18 22:13:19] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 22:13:19] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-18 22:13:19] [INFO ] Invariant cache hit.
[2023-03-18 22:13:19] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/65 places, 64/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 61/65 places, 64/68 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), (AND (NOT p1) p0), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LT s1 1) (LT s22 1)), p3:(OR (AND (GEQ s6 1) (GEQ s19 1)) (LT s1 1) (LT s21 1)), p1:(AND (NOT (AND (GEQ s1 1) (GEQ s22 1))) (NOT (AND (GEQ s6 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 37343 reset in 232 ms.
Product exploration explored 100000 steps with 37371 reset in 174 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 p3 p1 (NOT p0)), (X p3), (X (NOT (AND (NOT p1) p0))), true]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (NOT p3), true]
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 1052 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1250 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 1035 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 22:13:21] [INFO ] Invariant cache hit.
[2023-03-18 22:13:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:13:21] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:13:21] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 22:13:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:13:21] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:13:21] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 22:13:21] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 22:13:21] [INFO ] After 15ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-18 22:13:21] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-18 22:13:21] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 357 steps, including 28 resets, run visited all 2 properties in 4 ms. (steps per millisecond=89 )
Parikh walk visited 2 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p3 p1 (NOT p0)), (X p3), (X (NOT (AND (NOT p1) p0))), true, (G (NOT (OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND p1 (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (NOT p3)), (F (NOT (OR (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 finished in 1922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Applied a total of 6 rules in 7 ms. Remains 62 /65 variables (removed 3) and now considering 65/68 (removed 3) transitions.
// Phase 1: matrix 65 rows 62 cols
[2023-03-18 22:13:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:13:21] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 22:13:21] [INFO ] Invariant cache hit.
[2023-03-18 22:13:21] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 22:13:21] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-18 22:13:21] [INFO ] Invariant cache hit.
[2023-03-18 22:13:21] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 65/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 62/65 places, 65/68 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s59 1)), p0:(AND (GEQ s1 1) (GEQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 finished in 439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((!p0 U p1))))'
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 60 transition count 62
Applied a total of 11 rules in 13 ms. Remains 60 /65 variables (removed 5) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-18 22:13:21] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:13:22] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 22:13:22] [INFO ] Invariant cache hit.
[2023-03-18 22:13:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 22:13:22] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-18 22:13:22] [INFO ] Invariant cache hit.
[2023-03-18 22:13:22] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 62/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 60/65 places, 62/68 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s57 1)), p1:(AND (GEQ s1 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 finished in 472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 20 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 22:13:22] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:13:22] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-18 22:13:22] [INFO ] Invariant cache hit.
[2023-03-18 22:13:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:13:22] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-18 22:13:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:13:22] [INFO ] Invariant cache hit.
[2023-03-18 22:13:22] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 260 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22460 reset in 222 ms.
Product exploration explored 100000 steps with 22308 reset in 263 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-18 22:13:23] [INFO ] Invariant cache hit.
[2023-03-18 22:13:23] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 22:13:23] [INFO ] Invariant cache hit.
[2023-03-18 22:13:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:13:23] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-18 22:13:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:13:23] [INFO ] Invariant cache hit.
[2023-03-18 22:13:23] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22429 reset in 114 ms.
Product exploration explored 100000 steps with 22421 reset in 241 ms.
Built C files in :
/tmp/ltsmin8564249720897067413
[2023-03-18 22:13:24] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2023-03-18 22:13:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:13:24] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2023-03-18 22:13:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:13:24] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2023-03-18 22:13:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:13:24] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8564249720897067413
Running compilation step : cd /tmp/ltsmin8564249720897067413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 342 ms.
Running link step : cd /tmp/ltsmin8564249720897067413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin8564249720897067413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18044656832408461714.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 finished in 3071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 8 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
[2023-03-18 22:13:25] [INFO ] Invariant cache hit.
[2023-03-18 22:13:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 22:13:25] [INFO ] Invariant cache hit.
[2023-03-18 22:13:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:13:25] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-18 22:13:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:13:25] [INFO ] Invariant cache hit.
[2023-03-18 22:13:25] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22413 reset in 97 ms.
Product exploration explored 100000 steps with 22448 reset in 105 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2219 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 7 ms. (steps per millisecond=41 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 7 ms. (steps per millisecond=41 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-18 22:13:26] [INFO ] Invariant cache hit.
[2023-03-18 22:13:26] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-18 22:13:26] [INFO ] Invariant cache hit.
[2023-03-18 22:13:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:13:26] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-18 22:13:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:13:26] [INFO ] Invariant cache hit.
[2023-03-18 22:13:26] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2242 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 470 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 13 ms. (steps per millisecond=22 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 13 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22490 reset in 121 ms.
Product exploration explored 100000 steps with 22333 reset in 100 ms.
Built C files in :
/tmp/ltsmin16939694463998316641
[2023-03-18 22:13:27] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2023-03-18 22:13:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:13:27] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2023-03-18 22:13:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:13:27] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2023-03-18 22:13:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:13:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16939694463998316641
Running compilation step : cd /tmp/ltsmin16939694463998316641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 412 ms.
Running link step : cd /tmp/ltsmin16939694463998316641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin16939694463998316641;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15227880595679053559.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 8 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-18 22:13:42] [INFO ] Invariant cache hit.
[2023-03-18 22:13:42] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-18 22:13:42] [INFO ] Invariant cache hit.
[2023-03-18 22:13:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:13:42] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-18 22:13:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:13:42] [INFO ] Invariant cache hit.
[2023-03-18 22:13:42] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 59/59 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin14269891723069225609
[2023-03-18 22:13:42] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2023-03-18 22:13:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:13:42] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2023-03-18 22:13:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:13:42] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2023-03-18 22:13:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:13:42] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14269891723069225609
Running compilation step : cd /tmp/ltsmin14269891723069225609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 161 ms.
Running link step : cd /tmp/ltsmin14269891723069225609;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14269891723069225609;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3637889053672139514.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 22:13:57] [INFO ] Flatten gal took : 5 ms
[2023-03-18 22:13:57] [INFO ] Flatten gal took : 8 ms
[2023-03-18 22:13:57] [INFO ] Time to serialize gal into /tmp/LTL11823431873596832281.gal : 3 ms
[2023-03-18 22:13:57] [INFO ] Time to serialize properties into /tmp/LTL2852216339051770225.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11823431873596832281.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3370072931734522442.hoa' '-atoms' '/tmp/LTL2852216339051770225.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2852216339051770225.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3370072931734522442.hoa
Reverse transition relation is NOT exact ! Due to transitions t45, t49, t50, t51, t52, t53, t54, t56, t58, t59, t60, t61, t62, t65, t67, Intersection with...235
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2023-03-18 22:14:13] [INFO ] Flatten gal took : 6 ms
[2023-03-18 22:14:13] [INFO ] Flatten gal took : 5 ms
[2023-03-18 22:14:13] [INFO ] Time to serialize gal into /tmp/LTL16483413993418753625.gal : 2 ms
[2023-03-18 22:14:13] [INFO ] Time to serialize properties into /tmp/LTL8386222871316549337.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16483413993418753625.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8386222871316549337.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l86<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l86<1))"
Reverse transition relation is NOT exact ! Due to transitions t45, t49, t50, t51, t52, t53, t54, t56, t58, t59, t60, t61, t62, t65, t67, Intersection with...235
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2023-03-18 22:14:28] [INFO ] Flatten gal took : 11 ms
[2023-03-18 22:14:28] [INFO ] Applying decomposition
[2023-03-18 22:14:28] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15694553018593591069.txt' '-o' '/tmp/graph15694553018593591069.bin' '-w' '/tmp/graph15694553018593591069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15694553018593591069.bin' '-l' '-1' '-v' '-w' '/tmp/graph15694553018593591069.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:14:28] [INFO ] Decomposing Gal with order
[2023-03-18 22:14:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:14:28] [INFO ] Removed a total of 57 redundant transitions.
[2023-03-18 22:14:28] [INFO ] Flatten gal took : 72 ms
[2023-03-18 22:14:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 6 ms.
[2023-03-18 22:14:28] [INFO ] Time to serialize gal into /tmp/LTL2522144809915539117.gal : 2 ms
[2023-03-18 22:14:28] [INFO ] Time to serialize properties into /tmp/LTL17797161627728907866.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2522144809915539117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17797161627728907866.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i1.u0.s1<1)||(i3.u5.l86<1))"))))
Formula 0 simplified : GF!"((i1.u0.s1<1)||(i3.u5.l86<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1592099912104407333
[2023-03-18 22:14:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1592099912104407333
Running compilation step : cd /tmp/ltsmin1592099912104407333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 184 ms.
Running link step : cd /tmp/ltsmin1592099912104407333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1592099912104407333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 finished in 93024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p0)) U !p1)&&X(F(!p2)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Applied a total of 6 rules in 11 ms. Remains 62 /65 variables (removed 3) and now considering 65/68 (removed 3) transitions.
// Phase 1: matrix 65 rows 62 cols
[2023-03-18 22:14:58] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:14:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 22:14:58] [INFO ] Invariant cache hit.
[2023-03-18 22:14:58] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-18 22:14:58] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-18 22:14:58] [INFO ] Invariant cache hit.
[2023-03-18 22:14:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 65/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 62/65 places, 65/68 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR p1 p2), p2, (OR p1 (AND (NOT p0) p2)), (AND p2 (NOT p0)), (AND p2 (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s41 1)), p2:(AND (GEQ s1 1) (GEQ s38 1)), p0:(AND (GEQ s1 1) (GEQ s34 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-d0m36-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 finished in 507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 61 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 59 transition count 61
Applied a total of 13 rules in 3 ms. Remains 59 /65 variables (removed 6) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 22:14:59] [INFO ] Computed 5 place invariants in 18 ms
[2023-03-18 22:14:59] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 22:14:59] [INFO ] Invariant cache hit.
[2023-03-18 22:14:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:14:59] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-18 22:14:59] [INFO ] Invariant cache hit.
[2023-03-18 22:14:59] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/65 places, 61/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 59/65 places, 61/68 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 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 s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 finished in 249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(G(p2))||p1)))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 60 transition count 62
Applied a total of 11 rules in 6 ms. Remains 60 /65 variables (removed 5) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-18 22:14:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-18 22:14:59] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-18 22:14:59] [INFO ] Invariant cache hit.
[2023-03-18 22:14:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:14:59] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-18 22:14:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:14:59] [INFO ] Invariant cache hit.
[2023-03-18 22:14:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/65 places, 62/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 60/65 places, 62/68 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s8 1) (LT s40 1)), p0:(OR (LT s8 1) (LT s40 1)), p2:(AND (GEQ s13 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22325 reset in 108 ms.
Product exploration explored 100000 steps with 22257 reset in 88 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0)), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 424 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2226 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1011 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1035 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1042 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1070 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1030 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1347905 steps, run timeout after 3001 ms. (steps per millisecond=449 ) properties seen :{0=1, 1=1, 3=1, 4=1}
Probabilistic random walk after 1347905 steps, saw 665744 distinct states, run finished after 3002 ms. (steps per millisecond=449 ) properties seen :4
Running SMT prover for 2 properties.
[2023-03-18 22:15:03] [INFO ] Invariant cache hit.
[2023-03-18 22:15:03] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p0 p2))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0)), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p0)), (F (NOT (OR (AND (NOT p2) p1) (NOT p0)))), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 413 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-18 22:15:03] [INFO ] Invariant cache hit.
[2023-03-18 22:15:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-18 22:15:04] [INFO ] Invariant cache hit.
[2023-03-18 22:15:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:15:04] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-18 22:15:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:15:04] [INFO ] Invariant cache hit.
[2023-03-18 22:15:04] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2184 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1040 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 286 steps, run visited all 1 properties in 4 ms. (steps per millisecond=71 )
Probabilistic random walk after 286 steps, saw 152 distinct states, run finished after 4 ms. (steps per millisecond=71 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22492 reset in 125 ms.
Product exploration explored 100000 steps with 22397 reset in 104 ms.
Built C files in :
/tmp/ltsmin9273544215200251406
[2023-03-18 22:15:04] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2023-03-18 22:15:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:15:04] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2023-03-18 22:15:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:15:04] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2023-03-18 22:15:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:15:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9273544215200251406
Running compilation step : cd /tmp/ltsmin9273544215200251406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 147 ms.
Running link step : cd /tmp/ltsmin9273544215200251406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9273544215200251406;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15082525085883437978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 61
Applied a total of 2 rules in 10 ms. Remains 59 /60 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-18 22:15:19] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-18 22:15:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-18 22:15:20] [INFO ] Invariant cache hit.
[2023-03-18 22:15:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-18 22:15:20] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-18 22:15:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:15:20] [INFO ] Invariant cache hit.
[2023-03-18 22:15:20] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/60 places, 61/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 59/60 places, 61/62 transitions.
Built C files in :
/tmp/ltsmin7773424057240139816
[2023-03-18 22:15:20] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2023-03-18 22:15:20] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:15:20] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2023-03-18 22:15:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:15:20] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2023-03-18 22:15:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:15:20] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7773424057240139816
Running compilation step : cd /tmp/ltsmin7773424057240139816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 124 ms.
Running link step : cd /tmp/ltsmin7773424057240139816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7773424057240139816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3804609827722985241.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 22:15:35] [INFO ] Flatten gal took : 4 ms
[2023-03-18 22:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-18 22:15:35] [INFO ] Time to serialize gal into /tmp/LTL13139624937036221813.gal : 1 ms
[2023-03-18 22:15:35] [INFO ] Time to serialize properties into /tmp/LTL15087971294954402594.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13139624937036221813.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15462524860682505393.hoa' '-atoms' '/tmp/LTL15087971294954402594.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15087971294954402594.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15462524860682505393.hoa
Reverse transition relation is NOT exact ! Due to transitions t45, t49, t50, t51, t52, t53, t54, t56, t58, t59, t60, t61, t62, t65, t67, Intersection with...235
Computing Next relation with stutter on 2.35265e+09 deadlock states
Detected timeout of ITS tools.
[2023-03-18 22:15:50] [INFO ] Flatten gal took : 4 ms
[2023-03-18 22:15:50] [INFO ] Flatten gal took : 3 ms
[2023-03-18 22:15:50] [INFO ] Time to serialize gal into /tmp/LTL16833419654514131328.gal : 2 ms
[2023-03-18 22:15:50] [INFO ] Time to serialize properties into /tmp/LTL18016384224083884716.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16833419654514131328.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18016384224083884716.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((s9<1)||(l89<1))")&&(("((s9<1)||(l89<1))")||(X(G("((p16>=1)&&(l0>=1))"))))))))
Formula 0 simplified : GF!"((s9<1)||(l89<1))"
Detected timeout of ITS tools.
[2023-03-18 22:16:05] [INFO ] Flatten gal took : 3 ms
[2023-03-18 22:16:05] [INFO ] Applying decomposition
[2023-03-18 22:16:05] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4033442343649643454.txt' '-o' '/tmp/graph4033442343649643454.bin' '-w' '/tmp/graph4033442343649643454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4033442343649643454.bin' '-l' '-1' '-v' '-w' '/tmp/graph4033442343649643454.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:16:05] [INFO ] Decomposing Gal with order
[2023-03-18 22:16:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:16:05] [INFO ] Removed a total of 56 redundant transitions.
[2023-03-18 22:16:05] [INFO ] Flatten gal took : 13 ms
[2023-03-18 22:16:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 4 ms.
[2023-03-18 22:16:05] [INFO ] Time to serialize gal into /tmp/LTL12610647402744326631.gal : 2 ms
[2023-03-18 22:16:05] [INFO ] Time to serialize properties into /tmp/LTL13368164004348561200.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12610647402744326631.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13368164004348561200.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i3.u5.s9<1)||(i3.u4.l89<1))")&&(("((i3.u5.s9<1)||(i3.u4.l89<1))")||(X(G("((i7.u10.p16>=1)&&(i0.u0.l0>=1))"))))))))
Formula 0 simplified : GF!"((i3.u5.s9<1)||(i3.u4.l89<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9645696781559947359
[2023-03-18 22:16:20] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9645696781559947359
Running compilation step : cd /tmp/ltsmin9645696781559947359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 140 ms.
Running link step : cd /tmp/ltsmin9645696781559947359;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9645696781559947359;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)&&(X([]((LTLAPp2==true)))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 finished in 96372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U p2))))))'
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 60 transition count 62
Applied a total of 11 rules in 12 ms. Remains 60 /65 variables (removed 5) and now considering 62/68 (removed 6) transitions.
// Phase 1: matrix 62 rows 60 cols
[2023-03-18 22:16:35] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-18 22:16:35] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-18 22:16:35] [INFO ] Invariant cache hit.
[2023-03-18 22:16:35] [INFO ] State equation strengthened by 26 read => feed constraints.
[2023-03-18 22:16:35] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-18 22:16:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:16:35] [INFO ] Invariant cache hit.
[2023-03-18 22:16:35] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/65 places, 62/68 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 60/65 places, 62/68 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s48 1)), p2:(AND (GEQ s1 1) (GEQ s53 1)), p1:(AND (GEQ s1 1) (GEQ s49 1))], nbAcceptance=1, 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 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(G(p2))||p1)))))'
[2023-03-18 22:16:36] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13693293152132698512
[2023-03-18 22:16:36] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2023-03-18 22:16:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:16:36] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2023-03-18 22:16:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:16:36] [INFO ] Applying decomposition
[2023-03-18 22:16:36] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2023-03-18 22:16:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:16:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13693293152132698512
[2023-03-18 22:16:36] [INFO ] Flatten gal took : 3 ms
Running compilation step : cd /tmp/ltsmin13693293152132698512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16811488394511616875.txt' '-o' '/tmp/graph16811488394511616875.bin' '-w' '/tmp/graph16811488394511616875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16811488394511616875.bin' '-l' '-1' '-v' '-w' '/tmp/graph16811488394511616875.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:16:36] [INFO ] Decomposing Gal with order
[2023-03-18 22:16:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:16:36] [INFO ] Removed a total of 63 redundant transitions.
[2023-03-18 22:16:36] [INFO ] Flatten gal took : 34 ms
[2023-03-18 22:16:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 4 ms.
[2023-03-18 22:16:36] [INFO ] Time to serialize gal into /tmp/LTLFireability573395911639945749.gal : 2 ms
[2023-03-18 22:16:36] [INFO ] Time to serialize properties into /tmp/LTLFireability2106956867554960186.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability573395911639945749.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2106956867554960186.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 2 LTL properties
Checking formula 0 : !((F(G("((i4.u0.s1<1)||(i1.u7.l86<1))"))))
Formula 0 simplified : GF!"((i4.u0.s1<1)||(i1.u7.l86<1))"
Compilation finished in 188 ms.
Running link step : cd /tmp/ltsmin13693293152132698512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 19 ms.
Running LTSmin : cd /tmp/ltsmin13693293152132698512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t19, t45, t51, t52, t53, t54, t55, t56, t58, t63, t65, t67, i4.t61, i4.t60, i4.t59, i4.t50, i...270
Computing Next relation with stutter on 1.38635e+10 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Initializing POR dependencies: labels 72, guards 68
pins2lts-mc-linux64( 4/ 8), 0.009: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 0.009: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.037: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.045: There are 73 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.045: State length is 66, there are 72 groups
pins2lts-mc-linux64( 0/ 8), 0.045: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.045: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.045: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.045: Visible groups: 0 / 72, labels: 1 / 73
pins2lts-mc-linux64( 0/ 8), 0.045: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.045: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.091: [Blue] ~49 levels ~960 states ~2512 transitions
pins2lts-mc-linux64( 5/ 8), 0.113: [Blue] ~83 levels ~1920 states ~4544 transitions
pins2lts-mc-linux64( 5/ 8), 0.143: [Blue] ~148 levels ~3840 states ~9104 transitions
pins2lts-mc-linux64( 5/ 8), 0.209: [Blue] ~277 levels ~7680 states ~17920 transitions
pins2lts-mc-linux64( 5/ 8), 0.344: [Blue] ~508 levels ~15360 states ~35480 transitions
pins2lts-mc-linux64( 5/ 8), 0.566: [Blue] ~875 levels ~30720 states ~69864 transitions
pins2lts-mc-linux64( 5/ 8), 1.053: [Blue] ~1083 levels ~61440 states ~139056 transitions
pins2lts-mc-linux64( 5/ 8), 2.457: [Blue] ~1193 levels ~122880 states ~279280 transitions
pins2lts-mc-linux64( 4/ 8), 3.864: [Blue] ~1518 levels ~245760 states ~558880 transitions
pins2lts-mc-linux64( 5/ 8), 6.228: [Blue] ~2231 levels ~491520 states ~1136936 transitions
pins2lts-mc-linux64( 5/ 8), 10.972: [Blue] ~4962 levels ~983040 states ~2353392 transitions
pins2lts-mc-linux64( 5/ 8), 16.958: [Blue] ~10714 levels ~1966080 states ~4828224 transitions
pins2lts-mc-linux64( 7/ 8), 25.073: [Blue] ~21068 levels ~3932160 states ~10191992 transitions
pins2lts-mc-linux64( 1/ 8), 39.266: [Blue] ~14798 levels ~7864320 states ~19507944 transitions
pins2lts-mc-linux64( 1/ 8), 63.570: [Blue] ~37928 levels ~15728640 states ~40019912 transitions
pins2lts-mc-linux64( 1/ 8), 119.498: [Blue] ~124395 levels ~31457280 states ~83583088 transitions
pins2lts-mc-linux64( 1/ 8), 245.886: [Blue] ~333568 levels ~62914560 states ~178636464 transitions
pins2lts-mc-linux64( 1/ 8), 516.295: [Blue] ~497672 levels ~125829120 states ~377389936 transitions
pins2lts-mc-linux64( 1/ 8), 738.838: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 738.893:
pins2lts-mc-linux64( 0/ 8), 738.893: Explored 157661038 states 535497572 transitions, fanout: 3.397
pins2lts-mc-linux64( 0/ 8), 738.893: Total exploration time 738.840 sec (738.780 sec minimum, 738.802 sec on average)
pins2lts-mc-linux64( 0/ 8), 738.893: States per second: 213390, Transitions per second: 724782
pins2lts-mc-linux64( 0/ 8), 738.893:
pins2lts-mc-linux64( 0/ 8), 738.893: State space has 134217209 states, 2441 are accepting
pins2lts-mc-linux64( 0/ 8), 738.893: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 738.893: blue states: 157661038 (117.47%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 738.893: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 738.893: all-red states: 23341 (0.02%), bogus 8 (0.00%)
pins2lts-mc-linux64( 0/ 8), 738.893:
pins2lts-mc-linux64( 0/ 8), 738.893: Total memory used for local state coloring: 78.6MB
pins2lts-mc-linux64( 0/ 8), 738.893:
pins2lts-mc-linux64( 0/ 8), 738.893: Queue width: 8B, total height: 5148563, memory: 39.28MB
pins2lts-mc-linux64( 0/ 8), 738.893: Tree memory: 1043.5MB, 8.2 B/state, compr.: 3.1%
pins2lts-mc-linux64( 0/ 8), 738.893: Tree fill ratio (roots/leafs): 99.0%/7.0%
pins2lts-mc-linux64( 0/ 8), 738.893: Stored 68 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 738.893: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 738.893: Est. total memory use: 1082.7MB (~1063.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13693293152132698512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13693293152132698512;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 22:37:44] [INFO ] Flatten gal took : 10 ms
[2023-03-18 22:37:44] [INFO ] Time to serialize gal into /tmp/LTLFireability9925938208514408471.gal : 2 ms
[2023-03-18 22:37:44] [INFO ] Time to serialize properties into /tmp/LTLFireability13685241921178932464.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9925938208514408471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13685241921178932464.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F(G("((s1<1)||(l86<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l86<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t24, t34, t45, t49, t50, t51, t52, t53, t54, t55, t56, t58, t59, t60, t61, t62, t63, ...263
Computing Next relation with stutter on 1.38635e+10 deadlock states
Detected timeout of ITS tools.
[2023-03-18 22:58:52] [INFO ] Flatten gal took : 3 ms
[2023-03-18 22:58:52] [INFO ] Input system was already deterministic with 68 transitions.
[2023-03-18 22:58:52] [INFO ] Transformed 65 places.
[2023-03-18 22:58:52] [INFO ] Transformed 68 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 22:58:52] [INFO ] Time to serialize gal into /tmp/LTLFireability14317757433811015837.gal : 0 ms
[2023-03-18 22:58:52] [INFO ] Time to serialize properties into /tmp/LTLFireability12337361848533396403.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14317757433811015837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12337361848533396403.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((s1<1)||(l86<1))"))))
Formula 0 simplified : GF!"((s1<1)||(l86<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t24, t34, t45, t49, t50, t51, t52, t53, t54, t55, t56, t58, t59, t60, t61, t62, t63, ...263
Computing Next relation with stutter on 1.38635e+10 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 12161704 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16038876 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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