fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r131-smll-171624288500193
Last Updated
July 7, 2024

About the Execution of 2023-gold for DLCshifumi-PT-3a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
361.111 18423.00 33643.00 399.20 TTFFFFFFTFFTFFFF normal

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.r131-smll-171624288500193.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 DLCshifumi-PT-3a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288500193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 13 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 13 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 778K May 18 16:42 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 DLCshifumi-PT-3a-LTLFireability-00
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-01
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-02
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-03
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-04
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-05
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-06
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-07
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-08
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-09
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-10
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-11
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-12
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-13
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-14
FORMULA_NAME DLCshifumi-PT-3a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716405521357

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=DLCshifumi-PT-3a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 19:18:43] [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-22 19:18:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:18:44] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2024-05-22 19:18:44] [INFO ] Transformed 544 places.
[2024-05-22 19:18:44] [INFO ] Transformed 3097 transitions.
[2024-05-22 19:18:44] [INFO ] Found NUPN structural information;
[2024-05-22 19:18:44] [INFO ] Parsed PT model containing 544 places and 3097 transitions and 11545 arcs in 415 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 405 transitions
Reduce redundant transitions removed 405 transitions.
FORMULA DLCshifumi-PT-3a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-3a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 544/544 places, 2692/2692 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 469 transition count 2314
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 469 transition count 2314
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 184 place count 469 transition count 2280
Drop transitions removed 767 transitions
Redundant transition composition rules discarded 767 transitions
Iterating global reduction 1 with 767 rules applied. Total rules applied 951 place count 469 transition count 1513
Applied a total of 951 rules in 179 ms. Remains 469 /544 variables (removed 75) and now considering 1513/2692 (removed 1179) transitions.
[2024-05-22 19:18:44] [INFO ] Flow matrix only has 331 transitions (discarded 1182 similar events)
// Phase 1: matrix 331 rows 469 cols
[2024-05-22 19:18:44] [INFO ] Computed 282 invariants in 24 ms
[2024-05-22 19:18:46] [INFO ] Implicit Places using invariants in 1846 ms returned [229, 230, 231, 233, 234, 235, 236, 237, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 251, 252, 253, 254, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 299, 300, 301, 302, 304, 305, 306, 307, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 327, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 353, 355, 357, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 412, 413, 414, 415, 417, 418, 419, 420, 421, 422, 423, 424, 425, 427, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 445, 446, 447, 449, 450, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 466, 468]
Discarding 216 places :
Ensure Unique test removed 932 transitions
Reduce isomorphic transitions removed 932 transitions.
Implicit Place search using SMT only with invariants took 1910 ms to find 216 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 253/544 places, 581/2692 transitions.
Drop transitions removed 152 transitions
Redundant transition composition rules discarded 152 transitions
Iterating global reduction 0 with 152 rules applied. Total rules applied 152 place count 253 transition count 429
Applied a total of 152 rules in 12 ms. Remains 253 /253 variables (removed 0) and now considering 429/581 (removed 152) transitions.
[2024-05-22 19:18:46] [INFO ] Flow matrix only has 331 transitions (discarded 98 similar events)
// Phase 1: matrix 331 rows 253 cols
[2024-05-22 19:18:46] [INFO ] Computed 66 invariants in 5 ms
[2024-05-22 19:18:46] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 19:18:46] [INFO ] Flow matrix only has 331 transitions (discarded 98 similar events)
[2024-05-22 19:18:46] [INFO ] Invariant cache hit.
[2024-05-22 19:18:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:47] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 253/544 places, 429/2692 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2453 ms. Remains : 253/544 places, 429/2692 transitions.
Support contains 51 out of 253 places after structural reductions.
[2024-05-22 19:18:47] [INFO ] Flatten gal took : 74 ms
[2024-05-22 19:18:47] [INFO ] Flatten gal took : 29 ms
[2024-05-22 19:18:47] [INFO ] Input system was already deterministic with 429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 31) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 19:18:47] [INFO ] Flow matrix only has 331 transitions (discarded 98 similar events)
[2024-05-22 19:18:47] [INFO ] Invariant cache hit.
[2024-05-22 19:18:48] [INFO ] [Real]Absence check using 66 positive place invariants in 22 ms returned sat
[2024-05-22 19:18:48] [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 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 25 stabilizing places and 1 stable transitions
Graph (complete) has 494 edges and 253 vertex of which 229 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.5 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)||G(!p1)||(!p1&&F(!p2))))))'
Support contains 7 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 232 transition count 429
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 224 transition count 413
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 224 transition count 413
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 42 place count 224 transition count 408
Applied a total of 42 rules in 10 ms. Remains 224 /253 variables (removed 29) and now considering 408/429 (removed 21) transitions.
[2024-05-22 19:18:48] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
// Phase 1: matrix 318 rows 224 cols
[2024-05-22 19:18:48] [INFO ] Computed 45 invariants in 4 ms
[2024-05-22 19:18:48] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 19:18:48] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
[2024-05-22 19:18:48] [INFO ] Invariant cache hit.
[2024-05-22 19:18:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:48] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-22 19:18:48] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
[2024-05-22 19:18:48] [INFO ] Invariant cache hit.
[2024-05-22 19:18:49] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 224/253 places, 408/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 224/253 places, 408/429 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 452 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (EQ s203 0) (EQ s221 0)), p2:(AND (NOT (OR (EQ s60 1) (AND (EQ s115 1) (EQ s222 1)))) (EQ s203 1) (EQ s221 1)), p1:(AND (EQ s214 1) (EQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1068 ms.
Product exploration explored 100000 steps with 33333 reset in 964 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 452 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-3a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-3a-LTLFireability-01 finished in 3151 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(G(p0))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 230 transition count 429
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 222 transition count 413
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 222 transition count 413
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 222 transition count 409
Applied a total of 43 rules in 11 ms. Remains 222 /253 variables (removed 31) and now considering 409/429 (removed 20) transitions.
[2024-05-22 19:18:51] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
// Phase 1: matrix 319 rows 222 cols
[2024-05-22 19:18:51] [INFO ] Computed 43 invariants in 2 ms
[2024-05-22 19:18:51] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-22 19:18:51] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
[2024-05-22 19:18:51] [INFO ] Invariant cache hit.
[2024-05-22 19:18:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:51] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-22 19:18:51] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
[2024-05-22 19:18:51] [INFO ] Invariant cache hit.
[2024-05-22 19:18:52] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 222/253 places, 409/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 222/253 places, 409/429 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s42 1) (EQ s221 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-02 finished in 763 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)) U G(p1)))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Graph (trivial) has 422 edges and 253 vertex of which 225 / 253 are part of one of the 42 SCC in 4 ms
Free SCC test removed 183 places
Ensure Unique test removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Graph (complete) has 115 edges and 70 vertex of which 48 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output transitions
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 41 place count 9 transition count 11
Iterating global reduction 0 with 39 rules applied. Total rules applied 80 place count 9 transition count 11
Applied a total of 80 rules in 16 ms. Remains 9 /253 variables (removed 244) and now considering 11/429 (removed 418) transitions.
[2024-05-22 19:18:52] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
// Phase 1: matrix 7 rows 9 cols
[2024-05-22 19:18:52] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 19:18:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 19:18:52] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
[2024-05-22 19:18:52] [INFO ] Invariant cache hit.
[2024-05-22 19:18:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:52] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-22 19:18:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 19:18:52] [INFO ] Flow matrix only has 7 transitions (discarded 4 similar events)
[2024-05-22 19:18:52] [INFO ] Invariant cache hit.
[2024-05-22 19:18:52] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/253 places, 11/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 9/253 places, 11/429 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s8 1)), p0:(AND (EQ s2 1) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 3 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-03 finished in 235 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(p1))&&(p2||G(p3))&&p0)))'
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Graph (trivial) has 416 edges and 253 vertex of which 221 / 253 are part of one of the 41 SCC in 1 ms
Free SCC test removed 180 places
Ensure Unique test removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Graph (complete) has 122 edges and 73 vertex of which 52 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 52 transition count 55
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 50 transition count 54
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 45 place count 12 transition count 16
Iterating global reduction 2 with 38 rules applied. Total rules applied 83 place count 12 transition count 16
Applied a total of 83 rules in 13 ms. Remains 12 /253 variables (removed 241) and now considering 16/429 (removed 413) transitions.
[2024-05-22 19:18:52] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
// Phase 1: matrix 10 rows 12 cols
[2024-05-22 19:18:52] [INFO ] Computed 7 invariants in 1 ms
[2024-05-22 19:18:52] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 19:18:52] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2024-05-22 19:18:52] [INFO ] Invariant cache hit.
[2024-05-22 19:18:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:52] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-22 19:18:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 19:18:52] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2024-05-22 19:18:52] [INFO ] Invariant cache hit.
[2024-05-22 19:18:52] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/253 places, 16/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 12/253 places, 16/429 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p1), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p2) p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s5 0) (EQ s10 0)), p0:(AND (EQ s5 1) (EQ s10 1)), p2:(AND (EQ s4 1) (EQ s9 1)), p3:(AND (EQ s7 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-04 finished in 353 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)) U p1))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Graph (trivial) has 421 edges and 253 vertex of which 223 / 253 are part of one of the 42 SCC in 2 ms
Free SCC test removed 181 places
Ensure Unique test removed 376 transitions
Reduce isomorphic transitions removed 376 transitions.
Graph (complete) has 118 edges and 72 vertex of which 49 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 40 place count 11 transition count 15
Iterating global reduction 0 with 38 rules applied. Total rules applied 78 place count 11 transition count 15
Applied a total of 78 rules in 7 ms. Remains 11 /253 variables (removed 242) and now considering 15/429 (removed 414) transitions.
[2024-05-22 19:18:52] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
// Phase 1: matrix 10 rows 11 cols
[2024-05-22 19:18:52] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 19:18:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 19:18:52] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
[2024-05-22 19:18:52] [INFO ] Invariant cache hit.
[2024-05-22 19:18:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:53] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-22 19:18:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 19:18:53] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
[2024-05-22 19:18:53] [INFO ] Invariant cache hit.
[2024-05-22 19:18:53] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/253 places, 15/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 11/253 places, 15/429 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s5 1), p0:(OR (NEQ s2 1) (AND (EQ s8 1) (EQ s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-05 finished in 235 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)&&G((X(G(p2))||p1))))'
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 232 transition count 429
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 224 transition count 413
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 224 transition count 413
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 42 place count 224 transition count 408
Applied a total of 42 rules in 11 ms. Remains 224 /253 variables (removed 29) and now considering 408/429 (removed 21) transitions.
[2024-05-22 19:18:53] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
// Phase 1: matrix 318 rows 224 cols
[2024-05-22 19:18:53] [INFO ] Computed 45 invariants in 3 ms
[2024-05-22 19:18:53] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 19:18:53] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
[2024-05-22 19:18:53] [INFO ] Invariant cache hit.
[2024-05-22 19:18:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:53] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-05-22 19:18:53] [INFO ] Flow matrix only has 318 transitions (discarded 90 similar events)
[2024-05-22 19:18:53] [INFO ] Invariant cache hit.
[2024-05-22 19:18:53] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 224/253 places, 408/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 562 ms. Remains : 224/253 places, 408/429 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p2:(OR (EQ s202 0) (EQ s221 0)), p0:(OR (EQ s198 0) (EQ s222 0)), p1:(OR (EQ s218 0) (EQ s223 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 2 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-06 finished in 764 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 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 230 transition count 429
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 221 transition count 411
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 221 transition count 411
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 46 place count 221 transition count 406
Applied a total of 46 rules in 10 ms. Remains 221 /253 variables (removed 32) and now considering 406/429 (removed 23) transitions.
[2024-05-22 19:18:53] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
// Phase 1: matrix 317 rows 221 cols
[2024-05-22 19:18:53] [INFO ] Computed 43 invariants in 3 ms
[2024-05-22 19:18:54] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 19:18:54] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-05-22 19:18:54] [INFO ] Invariant cache hit.
[2024-05-22 19:18:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:54] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-22 19:18:54] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-05-22 19:18:54] [INFO ] Invariant cache hit.
[2024-05-22 19:18:54] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 221/253 places, 406/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 517 ms. Remains : 221/253 places, 406/429 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-08 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 (EQ s219 1) (EQ s220 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]]
Product exploration explored 100000 steps with 50000 reset in 792 ms.
Product exploration explored 100000 steps with 50000 reset in 731 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 448 edges and 221 vertex of which 220 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCshifumi-PT-3a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCshifumi-PT-3a-LTLFireability-08 finished in 2165 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 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Graph (trivial) has 415 edges and 253 vertex of which 219 / 253 are part of one of the 42 SCC in 1 ms
Free SCC test removed 177 places
Ensure Unique test removed 364 transitions
Reduce isomorphic transitions removed 364 transitions.
Graph (complete) has 130 edges and 76 vertex of which 54 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 54 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 53 transition count 64
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 44 place count 13 transition count 23
Iterating global reduction 2 with 40 rules applied. Total rules applied 84 place count 13 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 13 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 13 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 12 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 12 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 12 transition count 19
Applied a total of 90 rules in 17 ms. Remains 12 /253 variables (removed 241) and now considering 19/429 (removed 410) transitions.
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
// Phase 1: matrix 12 rows 12 cols
[2024-05-22 19:18:56] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 19:18:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
[2024-05-22 19:18:56] [INFO ] Invariant cache hit.
[2024-05-22 19:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:56] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-22 19:18:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
[2024-05-22 19:18:56] [INFO ] Invariant cache hit.
[2024-05-22 19:18:56] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/253 places, 19/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 12/253 places, 19/429 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s2 1) (EQ s10 1)) (AND (EQ s8 1) (EQ s11 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 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-09 finished in 164 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(p1))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Graph (trivial) has 419 edges and 253 vertex of which 221 / 253 are part of one of the 42 SCC in 2 ms
Free SCC test removed 179 places
Ensure Unique test removed 369 transitions
Reduce isomorphic transitions removed 369 transitions.
Graph (complete) has 125 edges and 74 vertex of which 51 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.1 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 51 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 50 transition count 59
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 44 place count 10 transition count 19
Iterating global reduction 2 with 40 rules applied. Total rules applied 84 place count 10 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 10 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 10 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 9 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 9 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 9 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 9 transition count 15
Applied a total of 90 rules in 11 ms. Remains 9 /253 variables (removed 244) and now considering 15/429 (removed 414) transitions.
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
// Phase 1: matrix 10 rows 9 cols
[2024-05-22 19:18:56] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 19:18:56] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
[2024-05-22 19:18:56] [INFO ] Invariant cache hit.
[2024-05-22 19:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-22 19:18:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 10 transitions (discarded 5 similar events)
[2024-05-22 19:18:56] [INFO ] Invariant cache hit.
[2024-05-22 19:18:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/253 places, 15/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 90 ms. Remains : 9/253 places, 15/429 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s8 0)), p1:(AND (EQ s6 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-10 finished in 217 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)))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Graph (trivial) has 426 edges and 253 vertex of which 226 / 253 are part of one of the 42 SCC in 1 ms
Free SCC test removed 184 places
Ensure Unique test removed 382 transitions
Reduce isomorphic transitions removed 382 transitions.
Graph (complete) has 112 edges and 69 vertex of which 46 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 42 place count 6 transition count 7
Iterating global reduction 0 with 40 rules applied. Total rules applied 82 place count 6 transition count 7
Applied a total of 82 rules in 5 ms. Remains 6 /253 variables (removed 247) and now considering 7/429 (removed 422) transitions.
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
// Phase 1: matrix 5 rows 6 cols
[2024-05-22 19:18:56] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 19:18:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
[2024-05-22 19:18:56] [INFO ] Invariant cache hit.
[2024-05-22 19:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-22 19:18:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 5 transitions (discarded 2 similar events)
[2024-05-22 19:18:56] [INFO ] Invariant cache hit.
[2024-05-22 19:18:56] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/253 places, 7/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 6/253 places, 7/429 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s5 1))], nbAcceptance=1, 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 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-12 finished in 131 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)&&F(p1)))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Graph (trivial) has 416 edges and 253 vertex of which 220 / 253 are part of one of the 42 SCC in 2 ms
Free SCC test removed 178 places
Ensure Unique test removed 366 transitions
Reduce isomorphic transitions removed 366 transitions.
Graph (complete) has 128 edges and 75 vertex of which 53 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 52 transition count 62
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 43 place count 13 transition count 23
Iterating global reduction 2 with 39 rules applied. Total rules applied 82 place count 13 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 13 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 13 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 12 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 12 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 12 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 12 transition count 19
Applied a total of 88 rules in 15 ms. Remains 12 /253 variables (removed 241) and now considering 19/429 (removed 410) transitions.
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
// Phase 1: matrix 12 rows 12 cols
[2024-05-22 19:18:56] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 19:18:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
[2024-05-22 19:18:56] [INFO ] Invariant cache hit.
[2024-05-22 19:18:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:56] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-22 19:18:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 12 transitions (discarded 7 similar events)
[2024-05-22 19:18:56] [INFO ] Invariant cache hit.
[2024-05-22 19:18:56] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/253 places, 19/429 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 12/253 places, 19/429 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (EQ s2 1) (EQ s11 1)), p0:(AND (EQ s8 1) (EQ s10 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-13 finished in 230 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' '!(((!p0 U p1)||((X(p2) U G(p3))&&G(p4))))'
Support contains 8 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 232 transition count 429
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 223 transition count 411
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 223 transition count 411
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 44 place count 223 transition count 406
Applied a total of 44 rules in 9 ms. Remains 223 /253 variables (removed 30) and now considering 406/429 (removed 23) transitions.
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
// Phase 1: matrix 317 rows 223 cols
[2024-05-22 19:18:56] [INFO ] Computed 45 invariants in 2 ms
[2024-05-22 19:18:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 19:18:56] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-05-22 19:18:56] [INFO ] Invariant cache hit.
[2024-05-22 19:18:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:57] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-22 19:18:57] [INFO ] Flow matrix only has 317 transitions (discarded 89 similar events)
[2024-05-22 19:18:57] [INFO ] Invariant cache hit.
[2024-05-22 19:18:57] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/253 places, 406/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 223/253 places, 406/429 transitions.
Stuttering acceptance computed with spot in 549 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), true, (NOT p1), (NOT p2), (NOT p3), (NOT p4), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) p2), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 (NOT p4)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3) p4), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0 p4), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p4), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p4), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p4), acceptance={} source=0 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p4), acceptance={} source=0 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p3 p4), acceptance={} source=0 dest: 9}, { cond=(AND (NOT p1) p0 p3 p4), acceptance={} source=0 dest: 10}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}, { cond=p3, acceptance={} source=4 dest: 10}], [{ cond=(NOT p4), acceptance={} source=5 dest: 1}, { cond=p4, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) p0 (NOT p4)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p4)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p1) p0 p4), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p4), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p1) p0 p3 (NOT p2)), acceptance={} source=9 dest: 11}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p3) p2), acceptance={} source=11 dest: 1}, { cond=(AND p3 p2), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=12 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=12 dest: 2}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(AND (EQ s217 1) (EQ s222 1)), p0:(AND (EQ s175 1) (EQ s220 1)), p4:(AND (EQ s160 1) (EQ s221 1)), p3:(OR (AND (EQ s175 1) (EQ s220 1)) (EQ s90 1)), p2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-14 finished in 1111 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) U X(G(p1))))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 429/429 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 231 transition count 429
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 223 transition count 413
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 223 transition count 413
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 223 transition count 409
Applied a total of 42 rules in 7 ms. Remains 223 /253 variables (removed 30) and now considering 409/429 (removed 20) transitions.
[2024-05-22 19:18:57] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
// Phase 1: matrix 319 rows 223 cols
[2024-05-22 19:18:57] [INFO ] Computed 44 invariants in 2 ms
[2024-05-22 19:18:58] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 19:18:58] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
[2024-05-22 19:18:58] [INFO ] Invariant cache hit.
[2024-05-22 19:18:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 19:18:58] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-22 19:18:58] [INFO ] Flow matrix only has 319 transitions (discarded 90 similar events)
[2024-05-22 19:18:58] [INFO ] Invariant cache hit.
[2024-05-22 19:18:58] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/253 places, 409/429 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 223/253 places, 409/429 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : DLCshifumi-PT-3a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s208 1) (EQ s222 1)), p0:(AND (EQ s66 1) (EQ s221 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 1 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-3a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-3a-LTLFireability-15 finished in 764 ms.
All properties solved by simple procedures.
Total runtime 14818 ms.

BK_STOP 1716405539780

--------------------
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="DLCshifumi-PT-3a"
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 DLCshifumi-PT-3a, 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 r131-smll-171624288500193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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