Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679101500053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is RingSingleMessageInMbox-PT-d1m040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679101500053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 23:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 23:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 23:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716843667016

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 21:01:08] [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]
[2024-05-27 21:01:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:01:08] [INFO ] Load time of PNML (sax parser for PT used): 425 ms
[2024-05-27 21:01:09] [INFO ] Transformed 6690 places.
[2024-05-27 21:01:09] [INFO ] Transformed 11934 transitions.
[2024-05-27 21:01:09] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 612 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4305 places in 49 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1085 places :
Symmetric choice reduction at 1 with 1085 rule applications. Total rules 1204 place count 1283 transition count 7611
Iterating global reduction 1 with 1085 rules applied. Total rules applied 2289 place count 1283 transition count 7611
Ensure Unique test removed 276 transitions
Reduce isomorphic transitions removed 276 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 2565 place count 1283 transition count 7335
Discarding 918 places :
Symmetric choice reduction at 2 with 918 rule applications. Total rules 3483 place count 365 transition count 6417
Iterating global reduction 2 with 918 rules applied. Total rules applied 4401 place count 365 transition count 6417
Ensure Unique test removed 5134 transitions
Reduce isomorphic transitions removed 5134 transitions.
Iterating post reduction 2 with 5134 rules applied. Total rules applied 9535 place count 365 transition count 1283
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 9589 place count 311 transition count 1229
Iterating global reduction 3 with 54 rules applied. Total rules applied 9643 place count 311 transition count 1229
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 182 transitions.
Iterating post reduction 3 with 182 rules applied. Total rules applied 9825 place count 311 transition count 1047
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 9833 place count 303 transition count 1039
Iterating global reduction 4 with 8 rules applied. Total rules applied 9841 place count 303 transition count 1039
Applied a total of 9841 rules in 389 ms. Remains 303 /2385 variables (removed 2082) and now considering 1039/11934 (removed 10895) transitions.
// Phase 1: matrix 1039 rows 303 cols
[2024-05-27 21:01:09] [INFO ] Computed 3 invariants in 33 ms
[2024-05-27 21:01:10] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-27 21:01:10] [INFO ] Invariant cache hit.
[2024-05-27 21:01:10] [INFO ] State equation strengthened by 767 read => feed constraints.
[2024-05-27 21:01:11] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
[2024-05-27 21:01:11] [INFO ] Invariant cache hit.
[2024-05-27 21:01:12] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/2385 places, 1039/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2891 ms. Remains : 303/2385 places, 1039/11934 transitions.
Support contains 29 out of 303 places after structural reductions.
[2024-05-27 21:01:12] [INFO ] Flatten gal took : 91 ms
[2024-05-27 21:01:12] [INFO ] Flatten gal took : 59 ms
[2024-05-27 21:01:12] [INFO ] Input system was already deterministic with 1039 transitions.
Support contains 28 out of 303 places (down from 29) after GAL structural reductions.
Finished random walk after 4065 steps, including 724 resets, run visited all 29 properties in 191 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 78 stabilizing places and 489 stable transitions
Graph (complete) has 1661 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p1)||p0) U X((!p2||F(p3)))))'
Support contains 5 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 281 transition count 572
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 281 transition count 572
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 58 place count 281 transition count 558
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 75 place count 264 transition count 541
Iterating global reduction 1 with 17 rules applied. Total rules applied 92 place count 264 transition count 541
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 95 place count 264 transition count 538
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 155 place count 204 transition count 478
Iterating global reduction 2 with 60 rules applied. Total rules applied 215 place count 204 transition count 478
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 2 with 104 rules applied. Total rules applied 319 place count 204 transition count 374
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 320 place count 203 transition count 361
Iterating global reduction 3 with 1 rules applied. Total rules applied 321 place count 203 transition count 361
Applied a total of 321 rules in 30 ms. Remains 203 /303 variables (removed 100) and now considering 361/1039 (removed 678) transitions.
// Phase 1: matrix 361 rows 203 cols
[2024-05-27 21:01:13] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 21:01:13] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 21:01:13] [INFO ] Invariant cache hit.
[2024-05-27 21:01:13] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-27 21:01:14] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2024-05-27 21:01:14] [INFO ] Invariant cache hit.
[2024-05-27 21:01:14] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/303 places, 361/1039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 963 ms. Remains : 203/303 places, 361/1039 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 367 ms :[(AND p2 (NOT p3)), (AND (NOT p3) p2), (AND (NOT p3) (NOT p1) p2), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (NOT (AND (GEQ s1 1) (GEQ s170 1))) (AND (GEQ s1 1) (GEQ s171 1))), p1:(AND (GEQ s1 1) (GEQ s168 1)), p2:(AND (GEQ s1 1) (GEQ s169 1)), p3:(AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 496 ms.
Product exploration explored 100000 steps with 50000 reset in 427 ms.
Computed a total of 12 stabilizing places and 55 stable transitions
Graph (complete) has 800 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 12 stabilizing places and 55 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 22 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-00 finished in 2335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U (p1 U G(p2)))||G(p1))))'
Support contains 3 out of 303 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 : 303/303 places, 1039/1039 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 280 transition count 513
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 280 transition count 513
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 280 transition count 508
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 70 place count 261 transition count 489
Iterating global reduction 1 with 19 rules applied. Total rules applied 89 place count 261 transition count 489
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 92 place count 261 transition count 486
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 160 place count 193 transition count 418
Iterating global reduction 2 with 68 rules applied. Total rules applied 228 place count 193 transition count 418
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 316 place count 193 transition count 330
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 317 place count 192 transition count 316
Iterating global reduction 3 with 1 rules applied. Total rules applied 318 place count 192 transition count 316
Applied a total of 318 rules in 73 ms. Remains 192 /303 variables (removed 111) and now considering 316/1039 (removed 723) transitions.
// Phase 1: matrix 316 rows 192 cols
[2024-05-27 21:01:15] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 21:01:15] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-27 21:01:15] [INFO ] Invariant cache hit.
[2024-05-27 21:01:15] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-05-27 21:01:16] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-27 21:01:16] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-27 21:01:16] [INFO ] Invariant cache hit.
[2024-05-27 21:01:16] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 192/303 places, 316/1039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 883 ms. Remains : 192/303 places, 316/1039 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p2) (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s158 1)), p1:(AND (GEQ s1 1) (GEQ s174 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-01 finished in 936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((!p0&&X((p0||G(p1))))||X(G((p0||G(p1))))) U G(p1))))'
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 279 transition count 512
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 279 transition count 512
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 60 place count 279 transition count 500
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 79 place count 260 transition count 481
Iterating global reduction 1 with 19 rules applied. Total rules applied 98 place count 260 transition count 481
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 101 place count 260 transition count 478
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 169 place count 192 transition count 410
Iterating global reduction 2 with 68 rules applied. Total rules applied 237 place count 192 transition count 410
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 321 place count 192 transition count 326
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 323 place count 190 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 190 transition count 300
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 326 place count 189 transition count 299
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 189 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 328 place count 189 transition count 298
Applied a total of 328 rules in 27 ms. Remains 189 /303 variables (removed 114) and now considering 298/1039 (removed 741) transitions.
// Phase 1: matrix 298 rows 189 cols
[2024-05-27 21:01:16] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 21:01:16] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 21:01:16] [INFO ] Invariant cache hit.
[2024-05-27 21:01:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:01:17] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2024-05-27 21:01:17] [INFO ] Invariant cache hit.
[2024-05-27 21:01:17] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/303 places, 298/1039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 817 ms. Remains : 189/303 places, 298/1039 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s155 1)), p0:(AND (GEQ s1 1) (GEQ s157 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 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-03 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X((p1||F(p0)))))))'
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 279 transition count 452
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 279 transition count 452
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 56 place count 279 transition count 444
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 76 place count 259 transition count 424
Iterating global reduction 1 with 20 rules applied. Total rules applied 96 place count 259 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 97 place count 259 transition count 423
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 173 place count 183 transition count 347
Iterating global reduction 2 with 76 rules applied. Total rules applied 249 place count 183 transition count 347
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 317 place count 183 transition count 279
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 318 place count 182 transition count 266
Iterating global reduction 3 with 1 rules applied. Total rules applied 319 place count 182 transition count 266
Applied a total of 319 rules in 47 ms. Remains 182 /303 variables (removed 121) and now considering 266/1039 (removed 773) transitions.
// Phase 1: matrix 266 rows 182 cols
[2024-05-27 21:01:17] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 21:01:17] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 21:01:17] [INFO ] Invariant cache hit.
[2024-05-27 21:01:17] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-27 21:01:18] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2024-05-27 21:01:18] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-27 21:01:18] [INFO ] Invariant cache hit.
[2024-05-27 21:01:18] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 182/303 places, 266/1039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 182/303 places, 266/1039 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s76 1)), p0:(OR (LT s1 1) (LT s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18234 reset in 231 ms.
Product exploration explored 100000 steps with 18069 reset in 257 ms.
Computed a total of 8 stabilizing places and 33 stable transitions
Graph (complete) has 667 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1824 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 315 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:01:19] [INFO ] Invariant cache hit.
[2024-05-27 21:01:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:01:19] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:01:19] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 182 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 : 182/182 places, 266/266 transitions.
Applied a total of 0 rules in 15 ms. Remains 182 /182 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-27 21:01:19] [INFO ] Invariant cache hit.
[2024-05-27 21:01:19] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-27 21:01:19] [INFO ] Invariant cache hit.
[2024-05-27 21:01:19] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-27 21:01:19] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2024-05-27 21:01:19] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-27 21:01:19] [INFO ] Invariant cache hit.
[2024-05-27 21:01:20] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 670 ms. Remains : 182/182 places, 266/266 transitions.
Computed a total of 8 stabilizing places and 33 stable transitions
Graph (complete) has 667 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 936 steps, including 165 resets, run visited all 1 properties in 9 ms. (steps per millisecond=104 )
Parikh walk visited 0 properties in 0 ms.
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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18298 reset in 181 ms.
Product exploration explored 100000 steps with 18384 reset in 188 ms.
Built C files in :
/tmp/ltsmin14507060364706640352
[2024-05-27 21:01:21] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-27 21:01:21] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:01:21] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-27 21:01:21] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:01:21] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-27 21:01:21] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:01:21] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14507060364706640352
Running compilation step : cd /tmp/ltsmin14507060364706640352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 655 ms.
Running link step : cd /tmp/ltsmin14507060364706640352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14507060364706640352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12392406524037107752.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 266/266 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 181 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 181 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 180 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 180 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 179 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 179 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 178 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 178 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 178 transition count 248
Applied a total of 10 rules in 29 ms. Remains 178 /182 variables (removed 4) and now considering 248/266 (removed 18) transitions.
// Phase 1: matrix 248 rows 178 cols
[2024-05-27 21:01:36] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 21:01:36] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 21:01:36] [INFO ] Invariant cache hit.
[2024-05-27 21:01:36] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-27 21:01:36] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-27 21:01:36] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 21:01:36] [INFO ] Invariant cache hit.
[2024-05-27 21:01:36] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 178/182 places, 248/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 637 ms. Remains : 178/182 places, 248/266 transitions.
Built C files in :
/tmp/ltsmin4210260979120744615
[2024-05-27 21:01:36] [INFO ] Computing symmetric may disable matrix : 248 transitions.
[2024-05-27 21:01:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:01:36] [INFO ] Computing symmetric may enable matrix : 248 transitions.
[2024-05-27 21:01:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:01:36] [INFO ] Computing Do-Not-Accords matrix : 248 transitions.
[2024-05-27 21:01:36] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:01:36] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4210260979120744615
Running compilation step : cd /tmp/ltsmin4210260979120744615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 521 ms.
Running link step : cd /tmp/ltsmin4210260979120744615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4210260979120744615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16342002604537632106.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:01:52] [INFO ] Flatten gal took : 13 ms
[2024-05-27 21:01:52] [INFO ] Flatten gal took : 12 ms
[2024-05-27 21:01:52] [INFO ] Time to serialize gal into /tmp/LTL5365066072881218156.gal : 3 ms
[2024-05-27 21:01:52] [INFO ] Time to serialize properties into /tmp/LTL13297833388470171166.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5365066072881218156.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4456641768624309750.hoa' '-atoms' '/tmp/LTL13297833388470171166.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13297833388470171166.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4456641768624309750.hoa
Detected timeout of ITS tools.
[2024-05-27 21:02:07] [INFO ] Flatten gal took : 11 ms
[2024-05-27 21:02:07] [INFO ] Flatten gal took : 11 ms
[2024-05-27 21:02:07] [INFO ] Time to serialize gal into /tmp/LTL1527995294780805800.gal : 2 ms
[2024-05-27 21:02:07] [INFO ] Time to serialize properties into /tmp/LTL3030067930475029765.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1527995294780805800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3030067930475029765.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((s1<1)||(l2896<1))"))||(X(("((p208>=1)&&(l0>=1))")||(F("((s1<1)||(l2896<1))"))))))))
Formula 0 simplified : G(FG!"((s1<1)||(l2896<1))" & F!"((p208>=1)&&(l0>=1))")
Detected timeout of ITS tools.
[2024-05-27 21:02:22] [INFO ] Flatten gal took : 10 ms
[2024-05-27 21:02:22] [INFO ] Applying decomposition
[2024-05-27 21:02:22] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9630828824925819516.txt' '-o' '/tmp/graph9630828824925819516.bin' '-w' '/tmp/graph9630828824925819516.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9630828824925819516.bin' '-l' '-1' '-v' '-w' '/tmp/graph9630828824925819516.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:02:22] [INFO ] Decomposing Gal with order
[2024-05-27 21:02:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:02:22] [INFO ] Removed a total of 297 redundant transitions.
[2024-05-27 21:02:22] [INFO ] Flatten gal took : 53 ms
[2024-05-27 21:02:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 187 labels/synchronizations in 12 ms.
[2024-05-27 21:02:22] [INFO ] Time to serialize gal into /tmp/LTL16656282354484257194.gal : 5 ms
[2024-05-27 21:02:22] [INFO ] Time to serialize properties into /tmp/LTL5387865753670231598.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16656282354484257194.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5387865753670231598.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((F("((i0.u0.s1<1)||(i0.u0.l2896<1))"))||(X(("((i0.u0.p208>=1)&&(i1.u1.l0>=1))")||(F("((i0.u0.s1<1)||(i0.u0.l2896<1))"))))))))
Formula 0 simplified : G(FG!"((i0.u0.s1<1)||(i0.u0.l2896<1))" & F!"((i0.u0.p208>=1)&&(i1.u1.l0>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15448606070498381079
[2024-05-27 21:02:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15448606070498381079
Running compilation step : cd /tmp/ltsmin15448606070498381079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 405 ms.
Running link step : cd /tmp/ltsmin15448606070498381079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15448606070498381079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-04 finished in 94995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(G(X(X((!(p0 U p1)||X(!p0)))))))))'
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 279 transition count 510
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 279 transition count 510
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 59 place count 279 transition count 499
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 78 place count 260 transition count 480
Iterating global reduction 1 with 19 rules applied. Total rules applied 97 place count 260 transition count 480
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 260 transition count 478
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 167 place count 192 transition count 410
Iterating global reduction 2 with 68 rules applied. Total rules applied 235 place count 192 transition count 410
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 327 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 328 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 329 place count 191 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 330 place count 190 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 190 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 335 place count 186 transition count 300
Iterating global reduction 3 with 4 rules applied. Total rules applied 339 place count 186 transition count 300
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 359 place count 186 transition count 280
Applied a total of 359 rules in 24 ms. Remains 186 /303 variables (removed 117) and now considering 280/1039 (removed 759) transitions.
// Phase 1: matrix 280 rows 186 cols
[2024-05-27 21:02:52] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 21:02:52] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-27 21:02:52] [INFO ] Invariant cache hit.
[2024-05-27 21:02:52] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 21:02:53] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2024-05-27 21:02:53] [INFO ] Invariant cache hit.
[2024-05-27 21:02:53] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/303 places, 280/1039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 827 ms. Remains : 186/303 places, 280/1039 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT 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: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s154 1)), p1:(AND (GEQ s1 1) (GEQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 18515 reset in 216 ms.
Product exploration explored 100000 steps with 18352 reset in 216 ms.
Computed a total of 19 stabilizing places and 70 stable transitions
Graph (complete) has 686 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 113 ms. Reduced automaton from 4 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 1789 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 321 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:02:54] [INFO ] Invariant cache hit.
[2024-05-27 21:02:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:02:54] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:02:54] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 12 factoid took 247 ms. Reduced automaton from 4 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 175 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 280/280 transitions.
Applied a total of 0 rules in 4 ms. Remains 186 /186 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-05-27 21:02:54] [INFO ] Invariant cache hit.
[2024-05-27 21:02:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 21:02:55] [INFO ] Invariant cache hit.
[2024-05-27 21:02:55] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 21:02:55] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-27 21:02:55] [INFO ] Invariant cache hit.
[2024-05-27 21:02:55] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 760 ms. Remains : 186/186 places, 280/280 transitions.
Computed a total of 19 stabilizing places and 70 stable transitions
Graph (complete) has 686 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 19 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 78 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 107 steps, including 21 resets, run visited all 3 properties in 2 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 7 factoid took 220 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 158 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 18423 reset in 210 ms.
Product exploration explored 100000 steps with 18361 reset in 215 ms.
Built C files in :
/tmp/ltsmin10159774140572270976
[2024-05-27 21:02:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10159774140572270976
Running compilation step : cd /tmp/ltsmin10159774140572270976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 417 ms.
Running link step : cd /tmp/ltsmin10159774140572270976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10159774140572270976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9292913729613330081.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 280/280 transitions.
Applied a total of 0 rules in 5 ms. Remains 186 /186 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-05-27 21:03:12] [INFO ] Invariant cache hit.
[2024-05-27 21:03:12] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-27 21:03:12] [INFO ] Invariant cache hit.
[2024-05-27 21:03:12] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 21:03:12] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-05-27 21:03:12] [INFO ] Invariant cache hit.
[2024-05-27 21:03:13] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 732 ms. Remains : 186/186 places, 280/280 transitions.
Built C files in :
/tmp/ltsmin16976135563303591592
[2024-05-27 21:03:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16976135563303591592
Running compilation step : cd /tmp/ltsmin16976135563303591592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 403 ms.
Running link step : cd /tmp/ltsmin16976135563303591592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin16976135563303591592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14319423348306563328.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:03:28] [INFO ] Flatten gal took : 10 ms
[2024-05-27 21:03:28] [INFO ] Flatten gal took : 9 ms
[2024-05-27 21:03:28] [INFO ] Time to serialize gal into /tmp/LTL17499928551130650417.gal : 2 ms
[2024-05-27 21:03:28] [INFO ] Time to serialize properties into /tmp/LTL11432810030740828666.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17499928551130650417.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13860025396122730876.hoa' '-atoms' '/tmp/LTL11432810030740828666.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11432810030740828666.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13860025396122730876.hoa
Detected timeout of ITS tools.
[2024-05-27 21:03:43] [INFO ] Flatten gal took : 10 ms
[2024-05-27 21:03:43] [INFO ] Flatten gal took : 9 ms
[2024-05-27 21:03:43] [INFO ] Time to serialize gal into /tmp/LTL4096871834188491707.gal : 2 ms
[2024-05-27 21:03:43] [INFO ] Time to serialize properties into /tmp/LTL1984491567725481937.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4096871834188491707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1984491567725481937.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(F(X(G(X(X((!(("((s1>=1)&&(l3931>=1))")U("((s1>=1)&&(l3921>=1))")))||(X("((s1<1)||(l3931<1))"))))))))))
Formula 0 simplified : GF(("((s1>=1)&&(l3931>=1))" U "((s1>=1)&&(l3921>=1))") & X!"((s1<1)||(l3931<1))")
Detected timeout of ITS tools.
[2024-05-27 21:03:58] [INFO ] Flatten gal took : 12 ms
[2024-05-27 21:03:58] [INFO ] Applying decomposition
[2024-05-27 21:03:58] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12619826765794485001.txt' '-o' '/tmp/graph12619826765794485001.bin' '-w' '/tmp/graph12619826765794485001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12619826765794485001.bin' '-l' '-1' '-v' '-w' '/tmp/graph12619826765794485001.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:03:58] [INFO ] Decomposing Gal with order
[2024-05-27 21:03:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:03:58] [INFO ] Removed a total of 295 redundant transitions.
[2024-05-27 21:03:58] [INFO ] Flatten gal took : 25 ms
[2024-05-27 21:03:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 8 ms.
[2024-05-27 21:03:58] [INFO ] Time to serialize gal into /tmp/LTL4114505970198914683.gal : 3 ms
[2024-05-27 21:03:58] [INFO ] Time to serialize properties into /tmp/LTL15208671880661438359.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4114505970198914683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15208671880661438359.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(F(X(G(X(X((!(("((i1.u0.s1>=1)&&(i1.u0.l3931>=1))")U("((i1.u0.s1>=1)&&(i1.u0.l3921>=1))")))||(X("((i1.u0.s1<1)||(i1.u0.l3931<1))")...164
Formula 0 simplified : GF(("((i1.u0.s1>=1)&&(i1.u0.l3931>=1))" U "((i1.u0.s1>=1)&&(i1.u0.l3921>=1))") & X!"((i1.u0.s1<1)||(i1.u0.l3931<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10141375852237954592
[2024-05-27 21:04:13] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10141375852237954592
Running compilation step : cd /tmp/ltsmin10141375852237954592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 423 ms.
Running link step : cd /tmp/ltsmin10141375852237954592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10141375852237954592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(<>(X([](X(X((!((LTLAPp0==true) U (LTLAPp1==true))||X(!(LTLAPp0==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-05 finished in 96167 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(!p1 U (p2||G(!p1)))))))'
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 280 transition count 540
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 280 transition count 540
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 58 place count 280 transition count 528
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 76 place count 262 transition count 510
Iterating global reduction 1 with 18 rules applied. Total rules applied 94 place count 262 transition count 510
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 262 transition count 508
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 160 place count 198 transition count 444
Iterating global reduction 2 with 64 rules applied. Total rules applied 224 place count 198 transition count 444
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 304 place count 198 transition count 364
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 305 place count 197 transition count 351
Iterating global reduction 3 with 1 rules applied. Total rules applied 306 place count 197 transition count 351
Applied a total of 306 rules in 15 ms. Remains 197 /303 variables (removed 106) and now considering 351/1039 (removed 688) transitions.
// Phase 1: matrix 351 rows 197 cols
[2024-05-27 21:04:28] [INFO ] Computed 3 invariants in 7 ms
[2024-05-27 21:04:28] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-27 21:04:28] [INFO ] Invariant cache hit.
[2024-05-27 21:04:28] [INFO ] State equation strengthened by 167 read => feed constraints.
[2024-05-27 21:04:29] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2024-05-27 21:04:29] [INFO ] Invariant cache hit.
[2024-05-27 21:04:29] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/303 places, 351/1039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 871 ms. Remains : 197/303 places, 351/1039 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s1 1) (GEQ s163 1))) (NOT (AND (GEQ s1 1) (GEQ s164 1)))), p0:(OR (LT s1 1) (LT s165 1)), p1:(AND (GEQ s1 1) (GEQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Computed a total of 12 stabilizing places and 62 stable transitions
Graph (complete) has 779 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-06 finished in 1756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 278 transition count 480
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 278 transition count 480
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 60 place count 278 transition count 470
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 80 place count 258 transition count 450
Iterating global reduction 1 with 20 rules applied. Total rules applied 100 place count 258 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 258 transition count 448
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 174 place count 186 transition count 376
Iterating global reduction 2 with 72 rules applied. Total rules applied 246 place count 186 transition count 376
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 326 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 328 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 331 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 332 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 336 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 340 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 352 place count 179 transition count 253
Applied a total of 352 rules in 22 ms. Remains 179 /303 variables (removed 124) and now considering 253/1039 (removed 786) transitions.
// Phase 1: matrix 253 rows 179 cols
[2024-05-27 21:04:30] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 21:04:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-27 21:04:30] [INFO ] Invariant cache hit.
[2024-05-27 21:04:30] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-27 21:04:30] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-05-27 21:04:30] [INFO ] Invariant cache hit.
[2024-05-27 21:04:31] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/303 places, 253/1039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 179/303 places, 253/1039 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 193 ms.
Product exploration explored 100000 steps with 33333 reset in 193 ms.
Computed a total of 12 stabilizing places and 43 stable transitions
Graph (complete) has 648 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 43 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-08 finished in 1144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 278 transition count 482
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 278 transition count 482
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 61 place count 278 transition count 471
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 81 place count 258 transition count 451
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 258 transition count 451
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 104 place count 258 transition count 448
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 176 place count 186 transition count 376
Iterating global reduction 2 with 72 rules applied. Total rules applied 248 place count 186 transition count 376
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 328 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 338 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 342 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 354 place count 179 transition count 253
Applied a total of 354 rules in 39 ms. Remains 179 /303 variables (removed 124) and now considering 253/1039 (removed 786) transitions.
// Phase 1: matrix 253 rows 179 cols
[2024-05-27 21:04:31] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 21:04:31] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-27 21:04:31] [INFO ] Invariant cache hit.
[2024-05-27 21:04:31] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-27 21:04:32] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-27 21:04:32] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 21:04:32] [INFO ] Invariant cache hit.
[2024-05-27 21:04:32] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/303 places, 253/1039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 621 ms. Remains : 179/303 places, 253/1039 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s147 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 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-11 finished in 662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G(p0)))&&(p1||(p2&&X(!p0))))))'
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 280 transition count 482
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 280 transition count 482
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 280 transition count 474
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 74 place count 260 transition count 454
Iterating global reduction 1 with 20 rules applied. Total rules applied 94 place count 260 transition count 454
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 260 transition count 452
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 168 place count 188 transition count 380
Iterating global reduction 2 with 72 rules applied. Total rules applied 240 place count 188 transition count 380
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 320 place count 188 transition count 300
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 322 place count 186 transition count 274
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 186 transition count 274
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 325 place count 185 transition count 273
Iterating global reduction 3 with 1 rules applied. Total rules applied 326 place count 185 transition count 273
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 330 place count 181 transition count 269
Iterating global reduction 3 with 4 rules applied. Total rules applied 334 place count 181 transition count 269
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 346 place count 181 transition count 257
Applied a total of 346 rules in 25 ms. Remains 181 /303 variables (removed 122) and now considering 257/1039 (removed 782) transitions.
// Phase 1: matrix 257 rows 181 cols
[2024-05-27 21:04:32] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 21:04:32] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 21:04:32] [INFO ] Invariant cache hit.
[2024-05-27 21:04:32] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-27 21:04:32] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-05-27 21:04:32] [INFO ] Invariant cache hit.
[2024-05-27 21:04:32] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/303 places, 257/1039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 614 ms. Remains : 181/303 places, 257/1039 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND p0 (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(OR p1 p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 0}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s149 1)), p2:(OR (LT s1 1) (LT s93 1)), p0:(OR (LT s1 1) (LT s95 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 60 steps with 9 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-13 finished in 826 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0)&&F(G(!p1)))) U G(!p2)))'
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 279 transition count 481
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 279 transition count 481
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 57 place count 279 transition count 472
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 259 transition count 452
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 259 transition count 452
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 259 transition count 450
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 171 place count 187 transition count 378
Iterating global reduction 2 with 72 rules applied. Total rules applied 243 place count 187 transition count 378
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 323 place count 187 transition count 298
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 324 place count 186 transition count 285
Iterating global reduction 3 with 1 rules applied. Total rules applied 325 place count 186 transition count 285
Applied a total of 325 rules in 37 ms. Remains 186 /303 variables (removed 117) and now considering 285/1039 (removed 754) transitions.
// Phase 1: matrix 285 rows 186 cols
[2024-05-27 21:04:33] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 21:04:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 21:04:33] [INFO ] Invariant cache hit.
[2024-05-27 21:04:33] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-27 21:04:33] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-27 21:04:33] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 21:04:33] [INFO ] Invariant cache hit.
[2024-05-27 21:04:33] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/303 places, 285/1039 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 696 ms. Remains : 186/303 places, 285/1039 transitions.
Stuttering acceptance computed with spot in 254 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s84 1)), p0:(AND (GEQ s1 1) (GEQ s103 1)), p1:(AND (GEQ s1 1) (GEQ s154 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 18278 reset in 205 ms.
Product exploration explored 100000 steps with 18323 reset in 217 ms.
Computed a total of 7 stabilizing places and 33 stable transitions
Graph (complete) has 693 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 153 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 1836 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 235 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 194 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-27 21:04:34] [INFO ] Invariant cache hit.
[2024-05-27 21:04:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:04:34] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-27 21:04:35] [INFO ] After 119ms 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p2 p1))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p0)), (F p2)]
Knowledge based reduction with 17 factoid took 359 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 168 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 285/285 transitions.
Applied a total of 0 rules in 13 ms. Remains 186 /186 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-27 21:04:35] [INFO ] Invariant cache hit.
[2024-05-27 21:04:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-27 21:04:35] [INFO ] Invariant cache hit.
[2024-05-27 21:04:35] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-27 21:04:36] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-27 21:04:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 21:04:36] [INFO ] Invariant cache hit.
[2024-05-27 21:04:36] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 667 ms. Remains : 186/186 places, 285/285 transitions.
Computed a total of 7 stabilizing places and 33 stable transitions
Graph (complete) has 693 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 149 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Incomplete random walk after 10000 steps, including 1845 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 264 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-27 21:04:36] [INFO ] Invariant cache hit.
[2024-05-27 21:04:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:04:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:04:36] [INFO ] After 109ms 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 (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p2 p1))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p0)), (F p2)]
Knowledge based reduction with 17 factoid took 375 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 155 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 160 ms :[p2, p0, p1, (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 18469 reset in 215 ms.
Product exploration explored 100000 steps with 18375 reset in 219 ms.
Built C files in :
/tmp/ltsmin1719241544763201155
[2024-05-27 21:04:38] [INFO ] Computing symmetric may disable matrix : 285 transitions.
[2024-05-27 21:04:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:04:38] [INFO ] Computing symmetric may enable matrix : 285 transitions.
[2024-05-27 21:04:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:04:38] [INFO ] Computing Do-Not-Accords matrix : 285 transitions.
[2024-05-27 21:04:38] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:04:38] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1719241544763201155
Running compilation step : cd /tmp/ltsmin1719241544763201155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 686 ms.
Running link step : cd /tmp/ltsmin1719241544763201155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1719241544763201155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10372771724555906.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 285/285 transitions.
Applied a total of 0 rules in 14 ms. Remains 186 /186 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-27 21:04:53] [INFO ] Invariant cache hit.
[2024-05-27 21:04:53] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-27 21:04:53] [INFO ] Invariant cache hit.
[2024-05-27 21:04:53] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-27 21:04:53] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2024-05-27 21:04:53] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 21:04:53] [INFO ] Invariant cache hit.
[2024-05-27 21:04:54] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 186/186 places, 285/285 transitions.
Built C files in :
/tmp/ltsmin15914362121311882319
[2024-05-27 21:04:54] [INFO ] Computing symmetric may disable matrix : 285 transitions.
[2024-05-27 21:04:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:04:54] [INFO ] Computing symmetric may enable matrix : 285 transitions.
[2024-05-27 21:04:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:04:54] [INFO ] Computing Do-Not-Accords matrix : 285 transitions.
[2024-05-27 21:04:54] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:04:54] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15914362121311882319
Running compilation step : cd /tmp/ltsmin15914362121311882319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 586 ms.
Running link step : cd /tmp/ltsmin15914362121311882319;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15914362121311882319;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11682740366235896557.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:05:09] [INFO ] Flatten gal took : 13 ms
[2024-05-27 21:05:09] [INFO ] Flatten gal took : 15 ms
[2024-05-27 21:05:09] [INFO ] Time to serialize gal into /tmp/LTL6132911561416270618.gal : 2 ms
[2024-05-27 21:05:09] [INFO ] Time to serialize properties into /tmp/LTL9176678600961071037.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6132911561416270618.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11868627160387176953.hoa' '-atoms' '/tmp/LTL9176678600961071037.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9176678600961071037.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11868627160387176953.hoa
Detected timeout of ITS tools.
[2024-05-27 21:05:24] [INFO ] Flatten gal took : 9 ms
[2024-05-27 21:05:24] [INFO ] Flatten gal took : 7 ms
[2024-05-27 21:05:24] [INFO ] Time to serialize gal into /tmp/LTL1908293151478653663.gal : 2 ms
[2024-05-27 21:05:24] [INFO ] Time to serialize properties into /tmp/LTL229990993437119147.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1908293151478653663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL229990993437119147.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((G((F(!("((s1>=1)&&(l3414>=1))")))&&(F(G(!("((s1>=1)&&(l3922>=1))"))))))U(G(!("((s1>=1)&&(l192>=1))")))))
Formula 0 simplified : F(G"((s1>=1)&&(l3414>=1))" | GF"((s1>=1)&&(l3922>=1))") R F"((s1>=1)&&(l192>=1))"
Detected timeout of ITS tools.
[2024-05-27 21:05:39] [INFO ] Flatten gal took : 11 ms
[2024-05-27 21:05:39] [INFO ] Applying decomposition
[2024-05-27 21:05:39] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17102473387478515299.txt' '-o' '/tmp/graph17102473387478515299.bin' '-w' '/tmp/graph17102473387478515299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17102473387478515299.bin' '-l' '-1' '-v' '-w' '/tmp/graph17102473387478515299.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:05:39] [INFO ] Decomposing Gal with order
[2024-05-27 21:05:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:05:39] [INFO ] Removed a total of 289 redundant transitions.
[2024-05-27 21:05:39] [INFO ] Flatten gal took : 27 ms
[2024-05-27 21:05:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 185 labels/synchronizations in 11 ms.
[2024-05-27 21:05:39] [INFO ] Time to serialize gal into /tmp/LTL16011194006274032145.gal : 3 ms
[2024-05-27 21:05:39] [INFO ] Time to serialize properties into /tmp/LTL2639783915592970434.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16011194006274032145.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2639783915592970434.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G((F(!("((i4.i0.u0.s1>=1)&&(u23.l3414>=1))")))&&(F(G(!("((i4.i0.u0.s1>=1)&&(u23.l3922>=1))"))))))U(G(!("((i4.i0.u0.s1>=1)&&(u23.l1...168
Formula 0 simplified : F(G"((i4.i0.u0.s1>=1)&&(u23.l3414>=1))" | GF"((i4.i0.u0.s1>=1)&&(u23.l3922>=1))") R F"((i4.i0.u0.s1>=1)&&(u23.l192>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2518782155568775207
[2024-05-27 21:05:54] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2518782155568775207
Running compilation step : cd /tmp/ltsmin2518782155568775207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin2518782155568775207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2518782155568775207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((<>(!(LTLAPp0==true))&&<>([](!(LTLAPp1==true))))) U [](!(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-14 finished in 96520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 278 transition count 482
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 278 transition count 482
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 61 place count 278 transition count 471
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 81 place count 258 transition count 451
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 258 transition count 451
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 104 place count 258 transition count 448
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 176 place count 186 transition count 376
Iterating global reduction 2 with 72 rules applied. Total rules applied 248 place count 186 transition count 376
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 328 place count 186 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 330 place count 184 transition count 270
Iterating global reduction 3 with 2 rules applied. Total rules applied 332 place count 184 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 333 place count 183 transition count 269
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 183 transition count 269
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 338 place count 179 transition count 265
Iterating global reduction 3 with 4 rules applied. Total rules applied 342 place count 179 transition count 265
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 354 place count 179 transition count 253
Applied a total of 354 rules in 17 ms. Remains 179 /303 variables (removed 124) and now considering 253/1039 (removed 786) transitions.
// Phase 1: matrix 253 rows 179 cols
[2024-05-27 21:06:09] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 21:06:09] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-27 21:06:09] [INFO ] Invariant cache hit.
[2024-05-27 21:06:09] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-27 21:06:10] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-05-27 21:06:10] [INFO ] Invariant cache hit.
[2024-05-27 21:06:10] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/303 places, 253/1039 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 604 ms. Remains : 179/303 places, 253/1039 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-15 finished in 684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X((p1||F(p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(G(X(X((!(p0 U p1)||X(!p0)))))))))'
Found a Lengthening insensitive property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-05
Stuttering acceptance computed with spot in 146 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 303/303 places, 1039/1039 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 279 transition count 510
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 279 transition count 510
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 59 place count 279 transition count 499
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 78 place count 260 transition count 480
Iterating global reduction 1 with 19 rules applied. Total rules applied 97 place count 260 transition count 480
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 260 transition count 478
Discarding 68 places :
Symmetric choice reduction at 2 with 68 rule applications. Total rules 167 place count 192 transition count 410
Iterating global reduction 2 with 68 rules applied. Total rules applied 235 place count 192 transition count 410
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 327 place count 192 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 328 place count 191 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 329 place count 191 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 330 place count 190 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 331 place count 190 transition count 304
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 335 place count 186 transition count 300
Iterating global reduction 3 with 4 rules applied. Total rules applied 339 place count 186 transition count 300
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 359 place count 186 transition count 280
Applied a total of 359 rules in 33 ms. Remains 186 /303 variables (removed 117) and now considering 280/1039 (removed 759) transitions.
// Phase 1: matrix 280 rows 186 cols
[2024-05-27 21:06:10] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 21:06:10] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-27 21:06:10] [INFO ] Invariant cache hit.
[2024-05-27 21:06:10] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 21:06:11] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2024-05-27 21:06:11] [INFO ] Invariant cache hit.
[2024-05-27 21:06:11] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 186/303 places, 280/1039 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 752 ms. Remains : 186/303 places, 280/1039 transitions.
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT 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: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s154 1)), p1:(AND (GEQ s1 1) (GEQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 18368 reset in 207 ms.
Product exploration explored 100000 steps with 18442 reset in 211 ms.
Computed a total of 19 stabilizing places and 70 stable transitions
Graph (complete) has 686 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 126 ms. Reduced automaton from 4 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 1850 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:06:12] [INFO ] Invariant cache hit.
[2024-05-27 21:06:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:06:12] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-27 21:06:12] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 12 factoid took 261 ms. Reduced automaton from 4 states, 14 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 150 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 280/280 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-05-27 21:06:12] [INFO ] Invariant cache hit.
[2024-05-27 21:06:12] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-27 21:06:12] [INFO ] Invariant cache hit.
[2024-05-27 21:06:12] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 21:06:13] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2024-05-27 21:06:13] [INFO ] Invariant cache hit.
[2024-05-27 21:06:13] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 732 ms. Remains : 186/186 places, 280/280 transitions.
Computed a total of 19 stabilizing places and 70 stable transitions
Graph (complete) has 686 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 19 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Finished random walk after 373 steps, including 63 resets, run visited all 3 properties in 5 ms. (steps per millisecond=74 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 4 states, 12 edges and 2 AP (stutter sensitive) to 4 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 170 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 157 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 18338 reset in 201 ms.
Product exploration explored 100000 steps with 18422 reset in 204 ms.
Built C files in :
/tmp/ltsmin4810968789903731012
[2024-05-27 21:06:14] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4810968789903731012
Running compilation step : cd /tmp/ltsmin4810968789903731012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 415 ms.
Running link step : cd /tmp/ltsmin4810968789903731012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4810968789903731012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16758016141254697263.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 280/280 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-05-27 21:06:30] [INFO ] Invariant cache hit.
[2024-05-27 21:06:30] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 21:06:30] [INFO ] Invariant cache hit.
[2024-05-27 21:06:30] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-05-27 21:06:30] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-27 21:06:30] [INFO ] Invariant cache hit.
[2024-05-27 21:06:30] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 736 ms. Remains : 186/186 places, 280/280 transitions.
Built C files in :
/tmp/ltsmin2567342682346896530
[2024-05-27 21:06:30] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2567342682346896530
Running compilation step : cd /tmp/ltsmin2567342682346896530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 415 ms.
Running link step : cd /tmp/ltsmin2567342682346896530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2567342682346896530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14747358508380010748.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:06:45] [INFO ] Flatten gal took : 8 ms
[2024-05-27 21:06:45] [INFO ] Flatten gal took : 7 ms
[2024-05-27 21:06:45] [INFO ] Time to serialize gal into /tmp/LTL561000740289865923.gal : 2 ms
[2024-05-27 21:06:45] [INFO ] Time to serialize properties into /tmp/LTL1897243851063620141.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL561000740289865923.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1780133169196942832.hoa' '-atoms' '/tmp/LTL1897243851063620141.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL1897243851063620141.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1780133169196942832.hoa
Detected timeout of ITS tools.
[2024-05-27 21:07:01] [INFO ] Flatten gal took : 6 ms
[2024-05-27 21:07:01] [INFO ] Flatten gal took : 6 ms
[2024-05-27 21:07:01] [INFO ] Time to serialize gal into /tmp/LTL4572941131990162883.gal : 2 ms
[2024-05-27 21:07:01] [INFO ] Time to serialize properties into /tmp/LTL6747616954701103215.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4572941131990162883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6747616954701103215.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(F(X(G(X(X((!(("((s1>=1)&&(l3931>=1))")U("((s1>=1)&&(l3921>=1))")))||(X("((s1<1)||(l3931<1))"))))))))))
Formula 0 simplified : GF(("((s1>=1)&&(l3931>=1))" U "((s1>=1)&&(l3921>=1))") & X!"((s1<1)||(l3931<1))")
Detected timeout of ITS tools.
[2024-05-27 21:07:16] [INFO ] Flatten gal took : 8 ms
[2024-05-27 21:07:16] [INFO ] Applying decomposition
[2024-05-27 21:07:16] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16579294629474720168.txt' '-o' '/tmp/graph16579294629474720168.bin' '-w' '/tmp/graph16579294629474720168.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16579294629474720168.bin' '-l' '-1' '-v' '-w' '/tmp/graph16579294629474720168.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:07:16] [INFO ] Decomposing Gal with order
[2024-05-27 21:07:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:07:16] [INFO ] Removed a total of 290 redundant transitions.
[2024-05-27 21:07:16] [INFO ] Flatten gal took : 20 ms
[2024-05-27 21:07:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 10 ms.
[2024-05-27 21:07:16] [INFO ] Time to serialize gal into /tmp/LTL16447722720153398110.gal : 3 ms
[2024-05-27 21:07:16] [INFO ] Time to serialize properties into /tmp/LTL16919086321159963769.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16447722720153398110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16919086321159963769.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(F(X(G(X(X((!(("((i0.i0.u0.s1>=1)&&(u21.l3931>=1))")U("((i0.i0.u0.s1>=1)&&(u21.l3921>=1))")))||(X("((i0.i0.u0.s1<1)||(u21.l3931<1)...167
Formula 0 simplified : GF(("((i0.i0.u0.s1>=1)&&(u21.l3931>=1))" U "((i0.i0.u0.s1>=1)&&(u21.l3921>=1))") & X!"((i0.i0.u0.s1<1)||(u21.l3931<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5004080002330475979
[2024-05-27 21:07:31] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5004080002330475979
Running compilation step : cd /tmp/ltsmin5004080002330475979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 432 ms.
Running link step : cd /tmp/ltsmin5004080002330475979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5004080002330475979;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(<>(X([](X(X((!((LTLAPp0==true) U (LTLAPp1==true))||X(!(LTLAPp0==true)))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLFireability-05 finished in 95916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0)&&F(G(!p1)))) U G(!p2)))'
[2024-05-27 21:07:46] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16217400135484628292
[2024-05-27 21:07:46] [INFO ] Computing symmetric may disable matrix : 1039 transitions.
[2024-05-27 21:07:46] [INFO ] Applying decomposition
[2024-05-27 21:07:46] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:07:46] [INFO ] Flatten gal took : 22 ms
[2024-05-27 21:07:46] [INFO ] Computing symmetric may enable matrix : 1039 transitions.
[2024-05-27 21:07:46] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14078622473297659564.txt' '-o' '/tmp/graph14078622473297659564.bin' '-w' '/tmp/graph14078622473297659564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14078622473297659564.bin' '-l' '-1' '-v' '-w' '/tmp/graph14078622473297659564.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:07:46] [INFO ] Decomposing Gal with order
[2024-05-27 21:07:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:07:46] [INFO ] Removed a total of 888 redundant transitions.
[2024-05-27 21:07:46] [INFO ] Flatten gal took : 64 ms
[2024-05-27 21:07:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 706 labels/synchronizations in 30 ms.
[2024-05-27 21:07:46] [INFO ] Computing Do-Not-Accords matrix : 1039 transitions.
[2024-05-27 21:07:46] [INFO ] Time to serialize gal into /tmp/LTLFireability13406528257482947695.gal : 6 ms
[2024-05-27 21:07:46] [INFO ] Time to serialize properties into /tmp/LTLFireability17646868231057619062.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13406528257482947695.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17646868231057619062.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
[2024-05-27 21:07:46] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !((F(G((F("((u0.s1<1)||(u22.l2896<1))"))||(X(("((i2.u5.p208>=1)&&(i1.i1.u11.l0>=1))")||(F("((u0.s1<1)||(u22.l2896<1))"))))))))
[2024-05-27 21:07:46] [INFO ] Built C files in 305ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16217400135484628292
Running compilation step : cd /tmp/ltsmin16217400135484628292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Formula 0 simplified : G(FG!"((u0.s1<1)||(u22.l2896<1))" & F!"((i2.u5.p208>=1)&&(i1.i1.u11.l0>=1))")
Compilation finished in 3411 ms.
Running link step : cd /tmp/ltsmin16217400135484628292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin16217400135484628292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.262: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.262: LTL layer: formula: <>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))
pins2lts-mc-linux64( 6/ 8), 0.262: "<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.263: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.270: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.275: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.298: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.299: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.310: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.326: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.339: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.438: There are 1047 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.438: State length is 304, there are 1045 groups
pins2lts-mc-linux64( 0/ 8), 0.438: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.438: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.438: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.438: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.473: [Blue] ~31 levels ~960 states ~2224 transitions
pins2lts-mc-linux64( 1/ 8), 0.495: [Blue] ~31 levels ~1920 states ~3824 transitions
pins2lts-mc-linux64( 0/ 8), 0.568: [Blue] ~70 levels ~3840 states ~9232 transitions
pins2lts-mc-linux64( 3/ 8), 0.675: [Blue] ~43 levels ~7680 states ~16512 transitions
pins2lts-mc-linux64( 3/ 8), 0.843: [Blue] ~43 levels ~15360 states ~31760 transitions
pins2lts-mc-linux64( 4/ 8), 1.268: [Blue] ~289 levels ~30720 states ~66312 transitions
pins2lts-mc-linux64( 4/ 8), 2.003: [Blue] ~455 levels ~61440 states ~145472 transitions
pins2lts-mc-linux64( 4/ 8), 3.446: [Blue] ~789 levels ~122880 states ~303008 transitions
pins2lts-mc-linux64( 6/ 8), 6.131: [Blue] ~196 levels ~245760 states ~521944 transitions
pins2lts-mc-linux64( 6/ 8), 11.074: [Blue] ~196 levels ~491520 states ~1032200 transitions
pins2lts-mc-linux64( 5/ 8), 20.423: [Blue] ~196 levels ~983040 states ~2055112 transitions
pins2lts-mc-linux64( 5/ 8), 38.722: [Blue] ~196 levels ~1966080 states ~4111552 transitions
pins2lts-mc-linux64( 5/ 8), 75.901: [Blue] ~196 levels ~3932160 states ~8229112 transitions
pins2lts-mc-linux64( 5/ 8), 149.901: [Blue] ~196 levels ~7864320 states ~16648072 transitions
pins2lts-mc-linux64( 5/ 8), 300.068: [Blue] ~196 levels ~15728640 states ~33430296 transitions
pins2lts-mc-linux64( 5/ 8), 596.462: [Blue] ~196 levels ~31457280 states ~66881488 transitions
pins2lts-mc-linux64( 4/ 8), 947.695: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 948.223:
pins2lts-mc-linux64( 0/ 8), 948.223: Explored 48478661 states 110140483 transitions, fanout: 2.272
pins2lts-mc-linux64( 0/ 8), 948.223: Total exploration time 947.780 sec (947.270 sec minimum, 947.485 sec on average)
pins2lts-mc-linux64( 0/ 8), 948.223: States per second: 51150, Transitions per second: 116209
pins2lts-mc-linux64( 0/ 8), 948.223:
pins2lts-mc-linux64( 0/ 8), 948.223: State space has 53287431 states, 2519 are accepting
pins2lts-mc-linux64( 0/ 8), 948.223: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 948.223: blue states: 48478661 (90.98%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 948.223: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 948.223: all-red states: 2519 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 948.223:
pins2lts-mc-linux64( 0/ 8), 948.223: Total memory used for local state coloring: 11.7MB
pins2lts-mc-linux64( 0/ 8), 948.223:
pins2lts-mc-linux64( 0/ 8), 948.223: Queue width: 8B, total height: 764336, memory: 5.83MB
pins2lts-mc-linux64( 0/ 8), 948.223: Tree memory: 662.6MB, 13.0 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 948.223: Tree fill ratio (roots/leafs): 39.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 948.223: Stored 1062 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 948.223: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 948.223: Est. total memory use: 668.4MB (~1029.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16217400135484628292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16217400135484628292;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((<>((LTLAPp0==true))||X(((LTLAPp1==true)||<>((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.
[2024-05-27 21:30:07] [INFO ] Flatten gal took : 227 ms
[2024-05-27 21:30:07] [INFO ] Time to serialize gal into /tmp/LTLFireability8560572275750612756.gal : 35 ms
[2024-05-27 21:30:07] [INFO ] Time to serialize properties into /tmp/LTLFireability2813709939255369826.ltl : 15 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8560572275750612756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2813709939255369826.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((F(G((F("((s1<1)||(l2896<1))"))||(X(("((p208>=1)&&(l0>=1))")||(F("((s1<1)||(l2896<1))"))))))))
Formula 0 simplified : G(FG!"((s1<1)||(l2896<1))" & F!"((p208>=1)&&(l0>=1))")
Detected timeout of ITS tools.
[2024-05-27 21:52:37] [INFO ] Flatten gal took : 179 ms
[2024-05-27 21:52:39] [INFO ] Input system was already deterministic with 1039 transitions.
[2024-05-27 21:52:39] [INFO ] Transformed 303 places.
[2024-05-27 21:52:39] [INFO ] Transformed 1039 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
[2024-05-27 21:52:39] [INFO ] Time to serialize gal into /tmp/LTLFireability353696568169489431.gal : 5 ms
[2024-05-27 21:52:39] [INFO ] Time to serialize properties into /tmp/LTLFireability11315751347875074617.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability353696568169489431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11315751347875074617.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((F("((s1<1)||(l2896<1))"))||(X(("((p208>=1)&&(l0>=1))")||(F("((s1<1)||(l2896<1))"))))))))
Formula 0 simplified : G(FG!"((s1<1)||(l2896<1))" & F!"((p208>=1)&&(l0>=1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12385488 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15883764 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d1m040"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is RingSingleMessageInMbox-PT-d1m040, 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 r351-tall-171679101500053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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