Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 25 22:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 22:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 22:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 614K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679174799524

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 21:26:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 21:26:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:26:42] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-18 21:26:42] [INFO ] Transformed 2503 places.
[2023-03-18 21:26:42] [INFO ] Transformed 2503 transitions.
[2023-03-18 21:26:42] [INFO ] Found NUPN structural information;
[2023-03-18 21:26:42] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-050B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 538 places :
Symmetric choice reduction at 0 with 538 rule applications. Total rules 538 place count 1965 transition count 1965
Iterating global reduction 0 with 538 rules applied. Total rules applied 1076 place count 1965 transition count 1965
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1077 place count 1964 transition count 1964
Iterating global reduction 0 with 1 rules applied. Total rules applied 1078 place count 1964 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1079 place count 1963 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 1080 place count 1963 transition count 1963
Applied a total of 1080 rules in 822 ms. Remains 1963 /2503 variables (removed 540) and now considering 1963/2503 (removed 540) transitions.
// Phase 1: matrix 1963 rows 1963 cols
[2023-03-18 21:26:43] [INFO ] Computed 201 place invariants in 32 ms
[2023-03-18 21:26:43] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-18 21:26:43] [INFO ] Invariant cache hit.
[2023-03-18 21:26:45] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 2297 ms to find 0 implicit places.
[2023-03-18 21:26:45] [INFO ] Invariant cache hit.
[2023-03-18 21:26:46] [INFO ] Dead Transitions using invariants and state equation in 1252 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1963/2503 places, 1963/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4375 ms. Remains : 1963/2503 places, 1963/2503 transitions.
Support contains 39 out of 1963 places after structural reductions.
[2023-03-18 21:26:46] [INFO ] Flatten gal took : 117 ms
[2023-03-18 21:26:47] [INFO ] Flatten gal took : 64 ms
[2023-03-18 21:26:47] [INFO ] Input system was already deterministic with 1963 transitions.
Support contains 37 out of 1963 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=14 ) properties (out of 31) seen :12
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-18 21:26:48] [INFO ] Invariant cache hit.
[2023-03-18 21:26:48] [INFO ] [Real]Absence check using 201 positive place invariants in 68 ms returned sat
[2023-03-18 21:26:48] [INFO ] After 886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-18 21:26:49] [INFO ] [Nat]Absence check using 201 positive place invariants in 60 ms returned sat
[2023-03-18 21:26:53] [INFO ] After 3599ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-18 21:26:54] [INFO ] Deduced a trap composed of 39 places in 465 ms of which 7 ms to minimize.
[2023-03-18 21:26:54] [INFO ] Deduced a trap composed of 42 places in 431 ms of which 1 ms to minimize.
[2023-03-18 21:26:55] [INFO ] Deduced a trap composed of 39 places in 442 ms of which 1 ms to minimize.
[2023-03-18 21:26:55] [INFO ] Deduced a trap composed of 49 places in 379 ms of which 2 ms to minimize.
[2023-03-18 21:26:56] [INFO ] Deduced a trap composed of 49 places in 606 ms of which 3 ms to minimize.
[2023-03-18 21:26:56] [INFO ] Deduced a trap composed of 43 places in 454 ms of which 1 ms to minimize.
[2023-03-18 21:26:57] [INFO ] Deduced a trap composed of 43 places in 426 ms of which 14 ms to minimize.
[2023-03-18 21:26:57] [INFO ] Deduced a trap composed of 69 places in 384 ms of which 1 ms to minimize.
[2023-03-18 21:26:58] [INFO ] Deduced a trap composed of 59 places in 380 ms of which 1 ms to minimize.
[2023-03-18 21:26:58] [INFO ] Deduced a trap composed of 56 places in 344 ms of which 1 ms to minimize.
[2023-03-18 21:26:59] [INFO ] Deduced a trap composed of 79 places in 316 ms of which 1 ms to minimize.
[2023-03-18 21:26:59] [INFO ] Deduced a trap composed of 73 places in 311 ms of which 0 ms to minimize.
[2023-03-18 21:26:59] [INFO ] Deduced a trap composed of 44 places in 474 ms of which 1 ms to minimize.
[2023-03-18 21:27:00] [INFO ] Deduced a trap composed of 68 places in 443 ms of which 1 ms to minimize.
[2023-03-18 21:27:00] [INFO ] Deduced a trap composed of 84 places in 415 ms of which 1 ms to minimize.
[2023-03-18 21:27:01] [INFO ] Deduced a trap composed of 43 places in 408 ms of which 1 ms to minimize.
[2023-03-18 21:27:01] [INFO ] Deduced a trap composed of 59 places in 283 ms of which 1 ms to minimize.
[2023-03-18 21:27:02] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 0 ms to minimize.
[2023-03-18 21:27:02] [INFO ] Deduced a trap composed of 59 places in 262 ms of which 1 ms to minimize.
[2023-03-18 21:27:02] [INFO ] Deduced a trap composed of 75 places in 319 ms of which 2 ms to minimize.
[2023-03-18 21:27:03] [INFO ] Deduced a trap composed of 68 places in 295 ms of which 1 ms to minimize.
[2023-03-18 21:27:03] [INFO ] Deduced a trap composed of 61 places in 312 ms of which 3 ms to minimize.
[2023-03-18 21:27:03] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 10095 ms
[2023-03-18 21:27:04] [INFO ] Deduced a trap composed of 32 places in 347 ms of which 2 ms to minimize.
[2023-03-18 21:27:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 520 ms
[2023-03-18 21:27:05] [INFO ] Deduced a trap composed of 60 places in 343 ms of which 1 ms to minimize.
[2023-03-18 21:27:06] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 1 ms to minimize.
[2023-03-18 21:27:06] [INFO ] Deduced a trap composed of 62 places in 308 ms of which 1 ms to minimize.
[2023-03-18 21:27:07] [INFO ] Deduced a trap composed of 61 places in 428 ms of which 1 ms to minimize.
[2023-03-18 21:27:07] [INFO ] Deduced a trap composed of 62 places in 408 ms of which 1 ms to minimize.
[2023-03-18 21:27:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2438 ms
[2023-03-18 21:27:08] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 1 ms to minimize.
[2023-03-18 21:27:08] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 1 ms to minimize.
[2023-03-18 21:27:09] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 0 ms to minimize.
[2023-03-18 21:27:09] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 0 ms to minimize.
[2023-03-18 21:27:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1683 ms
[2023-03-18 21:27:10] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 0 ms to minimize.
[2023-03-18 21:27:10] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 6 ms to minimize.
[2023-03-18 21:27:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 631 ms
[2023-03-18 21:27:11] [INFO ] Deduced a trap composed of 70 places in 319 ms of which 1 ms to minimize.
[2023-03-18 21:27:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 468 ms
[2023-03-18 21:27:11] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 2 ms to minimize.
[2023-03-18 21:27:12] [INFO ] Deduced a trap composed of 72 places in 253 ms of which 1 ms to minimize.
[2023-03-18 21:27:12] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 0 ms to minimize.
[2023-03-18 21:27:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 912 ms
[2023-03-18 21:27:13] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 1 ms to minimize.
[2023-03-18 21:27:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 444 ms
[2023-03-18 21:27:13] [INFO ] After 23682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 329 ms.
[2023-03-18 21:27:13] [INFO ] After 25008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 1 properties in 1018 ms.
Support contains 27 out of 1963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Drop transitions removed 531 transitions
Trivial Post-agglo rules discarded 531 transitions
Performed 531 trivial Post agglomeration. Transition count delta: 531
Iterating post reduction 0 with 531 rules applied. Total rules applied 531 place count 1963 transition count 1432
Reduce places removed 531 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 534 rules applied. Total rules applied 1065 place count 1432 transition count 1429
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1068 place count 1429 transition count 1429
Performed 387 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 387 Pre rules applied. Total rules applied 1068 place count 1429 transition count 1042
Deduced a syphon composed of 387 places in 2 ms
Reduce places removed 387 places and 0 transitions.
Iterating global reduction 3 with 774 rules applied. Total rules applied 1842 place count 1042 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1844 place count 1040 transition count 1040
Iterating global reduction 3 with 2 rules applied. Total rules applied 1846 place count 1040 transition count 1040
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1846 place count 1040 transition count 1038
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1850 place count 1038 transition count 1038
Performed 456 Post agglomeration using F-continuation condition.Transition count delta: 456
Deduced a syphon composed of 456 places in 0 ms
Reduce places removed 456 places and 0 transitions.
Iterating global reduction 3 with 912 rules applied. Total rules applied 2762 place count 582 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2763 place count 582 transition count 581
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2765 place count 581 transition count 580
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2967 place count 480 transition count 672
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 3049 place count 439 transition count 710
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3050 place count 439 transition count 709
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3052 place count 439 transition count 707
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3054 place count 437 transition count 707
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3056 place count 437 transition count 705
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3057 place count 436 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3058 place count 435 transition count 704
Applied a total of 3058 rules in 576 ms. Remains 435 /1963 variables (removed 1528) and now considering 704/1963 (removed 1259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 576 ms. Remains : 435/1963 places, 704/1963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 704 rows 435 cols
[2023-03-18 21:27:17] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-18 21:27:17] [INFO ] [Real]Absence check using 200 positive place invariants in 42 ms returned sat
[2023-03-18 21:27:17] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-18 21:27:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 71 ms returned sat
[2023-03-18 21:27:18] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-18 21:27:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:27:18] [INFO ] After 190ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-18 21:27:18] [INFO ] After 548ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-18 21:27:19] [INFO ] After 1425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 466 ms.
Support contains 19 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 704/704 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 1 place count 435 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 434 transition count 703
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 434 transition count 699
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 430 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 429 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 429 transition count 698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 429 transition count 697
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 428 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 427 transition count 696
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 425 transition count 699
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 425 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 424 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 424 transition count 698
Applied a total of 23 rules in 142 ms. Remains 424 /435 variables (removed 11) and now considering 698/704 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 424/435 places, 698/704 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 85173 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85173 steps, saw 58488 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 698 rows 424 cols
[2023-03-18 21:27:23] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-18 21:27:23] [INFO ] [Real]Absence check using 200 positive place invariants in 62 ms returned sat
[2023-03-18 21:27:23] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-18 21:27:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 19 ms returned sat
[2023-03-18 21:27:24] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-18 21:27:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:27:24] [INFO ] After 176ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-18 21:27:24] [INFO ] After 479ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-18 21:27:24] [INFO ] After 1248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 209 ms.
Support contains 19 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 698/698 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 424/424 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 698/698 transitions.
Applied a total of 0 rules in 22 ms. Remains 424 /424 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-18 21:27:25] [INFO ] Invariant cache hit.
[2023-03-18 21:27:25] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-18 21:27:25] [INFO ] Invariant cache hit.
[2023-03-18 21:27:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:27:26] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
[2023-03-18 21:27:26] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-18 21:27:26] [INFO ] Invariant cache hit.
[2023-03-18 21:27:26] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1311 ms. Remains : 424/424 places, 698/698 transitions.
Graph (trivial) has 179 edges and 424 vertex of which 4 / 424 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1433 edges and 422 vertex of which 420 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 176 edges and 418 vertex of which 4 / 418 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 416 transition count 689
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 175 edges and 414 vertex of which 6 / 414 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 411 transition count 680
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 173 edges and 408 vertex of which 8 / 408 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 404 transition count 669
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 400 vertex of which 8 / 400 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 396 transition count 655
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 389 transition count 641
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 161 edges and 386 vertex of which 4 / 386 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 5 with 14 rules applied. Total rules applied 87 place count 384 transition count 631
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 158 edges and 382 vertex of which 2 / 382 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 9 rules applied. Total rules applied 96 place count 381 transition count 625
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 101 place count 380 transition count 621
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 101 place count 380 transition count 620
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 104 place count 378 transition count 620
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 107 place count 376 transition count 619
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 110 place count 376 transition count 616
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 127 place count 376 transition count 599
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 128 place count 376 transition count 599
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 129 place count 376 transition count 598
Applied a total of 129 rules in 145 ms. Remains 376 /424 variables (removed 48) and now considering 598/698 (removed 100) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 598 rows 376 cols
[2023-03-18 21:27:26] [INFO ] Computed 176 place invariants in 1 ms
[2023-03-18 21:27:27] [INFO ] [Real]Absence check using 176 positive place invariants in 15 ms returned sat
[2023-03-18 21:27:27] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-18 21:27:27] [INFO ] [Nat]Absence check using 176 positive place invariants in 29 ms returned sat
[2023-03-18 21:27:27] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-18 21:27:27] [INFO ] After 498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-18 21:27:27] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Computed a total of 601 stabilizing places and 601 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F(p1))))))'
Support contains 1 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1951 transition count 1951
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1951 transition count 1951
Applied a total of 24 rules in 147 ms. Remains 1951 /1963 variables (removed 12) and now considering 1951/1963 (removed 12) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2023-03-18 21:27:28] [INFO ] Computed 201 place invariants in 28 ms
[2023-03-18 21:27:28] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-18 21:27:28] [INFO ] Invariant cache hit.
[2023-03-18 21:27:30] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
[2023-03-18 21:27:30] [INFO ] Invariant cache hit.
[2023-03-18 21:27:31] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1951/1963 places, 1951/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3010 ms. Remains : 1951/1963 places, 1951/1963 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s522 0), p0:(EQ s522 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-00 finished in 3344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(!p1))||G(!p1))))'
Support contains 3 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1951 transition count 1951
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1951 transition count 1951
Applied a total of 24 rules in 159 ms. Remains 1951 /1963 variables (removed 12) and now considering 1951/1963 (removed 12) transitions.
[2023-03-18 21:27:31] [INFO ] Invariant cache hit.
[2023-03-18 21:27:32] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-18 21:27:32] [INFO ] Invariant cache hit.
[2023-03-18 21:27:33] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
[2023-03-18 21:27:33] [INFO ] Invariant cache hit.
[2023-03-18 21:27:34] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1951/1963 places, 1951/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2989 ms. Remains : 1951/1963 places, 1951/1963 transitions.
Stuttering acceptance computed with spot in 81 ms :[p1, p1]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s55 1), p1:(AND (EQ s1060 1) (EQ s1074 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 944 ms.
Product exploration explored 100000 steps with 50000 reset in 1121 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Detected a total of 598/1951 stabilizing places and 598/1951 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 10 factoid took 336 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLFireability-01 finished in 5518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1&&F(G(p2)))))))'
Support contains 5 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1962 transition count 1416
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1416 transition count 1416
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1092 place count 1416 transition count 1023
Deduced a syphon composed of 393 places in 1 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1878 place count 1023 transition count 1023
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1887 place count 1014 transition count 1014
Iterating global reduction 2 with 9 rules applied. Total rules applied 1896 place count 1014 transition count 1014
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1896 place count 1014 transition count 1006
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1912 place count 1006 transition count 1006
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 0 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2806 place count 559 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2807 place count 559 transition count 558
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2809 place count 558 transition count 557
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3011 place count 457 transition count 656
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3107 place count 409 transition count 704
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3109 place count 407 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3110 place count 406 transition count 702
Applied a total of 3110 rules in 307 ms. Remains 406 /1963 variables (removed 1557) and now considering 702/1963 (removed 1261) transitions.
// Phase 1: matrix 702 rows 406 cols
[2023-03-18 21:27:37] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-18 21:27:37] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-18 21:27:37] [INFO ] Invariant cache hit.
[2023-03-18 21:27:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:27:37] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-18 21:27:37] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 21:27:37] [INFO ] Invariant cache hit.
[2023-03-18 21:27:38] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 406/1963 places, 702/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1277 ms. Remains : 406/1963 places, 702/1963 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s234 0), p1:(EQ s333 0), p2:(OR (EQ s252 0) (EQ s262 0) (EQ s269 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 32 reset in 492 ms.
Product exploration explored 100000 steps with 38 reset in 623 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/406 stabilizing places and 2/702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 16 factoid took 935 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 21:27:41] [INFO ] Invariant cache hit.
[2023-03-18 21:27:41] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 21:27:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-18 21:27:41] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 21:27:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:27:41] [INFO ] After 141ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 21:27:42] [INFO ] After 336ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 168 ms.
[2023-03-18 21:27:42] [INFO ] After 992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 129 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 702/702 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 406 transition count 701
Applied a total of 1 rules in 12 ms. Remains 406 /406 variables (removed 0) and now considering 701/702 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 406/406 places, 701/702 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 353357 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 353357 steps, saw 87463 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :5
Running SMT prover for 2 properties.
// Phase 1: matrix 701 rows 406 cols
[2023-03-18 21:27:45] [INFO ] Computed 200 place invariants in 6 ms
[2023-03-18 21:27:45] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:27:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 18 ms returned sat
[2023-03-18 21:27:46] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:27:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:27:46] [INFO ] After 26ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:27:46] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-18 21:27:46] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 33 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 10 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 406/406 places, 701/701 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 294394 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294394 steps, saw 79870 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:27:49] [INFO ] Invariant cache hit.
[2023-03-18 21:27:49] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:27:49] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-18 21:27:49] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:27:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:27:49] [INFO ] After 30ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:27:49] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-18 21:27:50] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 49 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 13 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 406/406 places, 701/701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 14 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2023-03-18 21:27:50] [INFO ] Invariant cache hit.
[2023-03-18 21:27:50] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-18 21:27:50] [INFO ] Invariant cache hit.
[2023-03-18 21:27:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:27:50] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2023-03-18 21:27:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:27:50] [INFO ] Invariant cache hit.
[2023-03-18 21:27:51] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1116 ms. Remains : 406/406 places, 701/701 transitions.
Graph (trivial) has 197 edges and 406 vertex of which 4 / 406 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1397 edges and 404 vertex of which 402 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 194 edges and 400 vertex of which 4 / 400 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 398 transition count 692
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 193 edges and 396 vertex of which 6 / 396 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 393 transition count 683
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 191 edges and 390 vertex of which 8 / 390 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 386 transition count 672
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 382 vertex of which 8 / 382 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 378 transition count 658
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 374 vertex of which 8 / 374 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 370 transition count 644
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 366 vertex of which 8 / 366 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 362 transition count 630
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 358 vertex of which 8 / 358 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 354 transition count 616
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 350 vertex of which 8 / 350 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 346 transition count 602
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 342 vertex of which 8 / 342 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 338 transition count 588
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 161 edges and 335 vertex of which 4 / 335 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 165 place count 333 transition count 576
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 158 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 9 rules applied. Total rules applied 174 place count 330 transition count 570
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 179 place count 329 transition count 566
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 182 place count 327 transition count 565
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 186 place count 327 transition count 561
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 193 place count 327 transition count 554
Applied a total of 193 rules in 68 ms. Remains 327 /406 variables (removed 79) and now considering 554/701 (removed 147) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 554 rows 327 cols
[2023-03-18 21:27:51] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-18 21:27:51] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:27:51] [INFO ] [Nat]Absence check using 161 positive place invariants in 27 ms returned sat
[2023-03-18 21:27:51] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:27:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-18 21:27:51] [INFO ] After 20ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:27:51] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 21:27:51] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1010 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 406/406 places, 702/702 transitions.
Applied a total of 0 rules in 15 ms. Remains 406 /406 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 406 cols
[2023-03-18 21:27:53] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-18 21:27:53] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-18 21:27:53] [INFO ] Invariant cache hit.
[2023-03-18 21:27:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:27:53] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2023-03-18 21:27:53] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:27:53] [INFO ] Invariant cache hit.
[2023-03-18 21:27:53] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 912 ms. Remains : 406/406 places, 702/702 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/406 stabilizing places and 2/702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 16 factoid took 624 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 21:27:55] [INFO ] Invariant cache hit.
[2023-03-18 21:27:55] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 21:27:55] [INFO ] [Nat]Absence check using 200 positive place invariants in 17 ms returned sat
[2023-03-18 21:27:55] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 21:27:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:27:55] [INFO ] After 95ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 21:27:55] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-18 21:27:56] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 320 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 702/702 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 406 transition count 701
Applied a total of 1 rules in 10 ms. Remains 406 /406 variables (removed 0) and now considering 701/702 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 406/406 places, 701/702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 307592 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 307592 steps, saw 82054 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :5
Running SMT prover for 2 properties.
// Phase 1: matrix 701 rows 406 cols
[2023-03-18 21:28:00] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-18 21:28:00] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:28:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 17 ms returned sat
[2023-03-18 21:28:00] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:28:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:28:00] [INFO ] After 26ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:28:00] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-18 21:28:00] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 39 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 8 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 406/406 places, 701/701 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 356895 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 356895 steps, saw 88049 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:28:03] [INFO ] Invariant cache hit.
[2023-03-18 21:28:03] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:28:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 18 ms returned sat
[2023-03-18 21:28:03] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:28:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:28:03] [INFO ] After 26ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:28:03] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-18 21:28:04] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 5 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 8 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 406/406 places, 701/701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 701/701 transitions.
Applied a total of 0 rules in 7 ms. Remains 406 /406 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2023-03-18 21:28:04] [INFO ] Invariant cache hit.
[2023-03-18 21:28:04] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-18 21:28:04] [INFO ] Invariant cache hit.
[2023-03-18 21:28:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:28:04] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2023-03-18 21:28:04] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:28:04] [INFO ] Invariant cache hit.
[2023-03-18 21:28:04] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 841 ms. Remains : 406/406 places, 701/701 transitions.
Graph (trivial) has 197 edges and 406 vertex of which 4 / 406 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1397 edges and 404 vertex of which 402 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 194 edges and 400 vertex of which 4 / 400 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 398 transition count 692
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 193 edges and 396 vertex of which 6 / 396 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 393 transition count 683
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 191 edges and 390 vertex of which 8 / 390 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 386 transition count 672
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 382 vertex of which 8 / 382 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 378 transition count 658
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 374 vertex of which 8 / 374 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 370 transition count 644
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 366 vertex of which 8 / 366 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 362 transition count 630
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 358 vertex of which 8 / 358 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 354 transition count 616
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 350 vertex of which 8 / 350 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 346 transition count 602
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 342 vertex of which 8 / 342 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 338 transition count 588
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 161 edges and 335 vertex of which 4 / 335 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 165 place count 333 transition count 576
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 158 edges and 331 vertex of which 2 / 331 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 9 rules applied. Total rules applied 174 place count 330 transition count 570
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 179 place count 329 transition count 566
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 3 rules applied. Total rules applied 182 place count 327 transition count 565
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 186 place count 327 transition count 561
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 13 with 7 rules applied. Total rules applied 193 place count 327 transition count 554
Applied a total of 193 rules in 40 ms. Remains 327 /406 variables (removed 79) and now considering 554/701 (removed 147) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 554 rows 327 cols
[2023-03-18 21:28:04] [INFO ] Computed 161 place invariants in 1 ms
[2023-03-18 21:28:05] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:28:05] [INFO ] [Nat]Absence check using 161 positive place invariants in 14 ms returned sat
[2023-03-18 21:28:05] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:28:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-18 21:28:05] [INFO ] After 19ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:28:05] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 21:28:05] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p1 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 16 factoid took 951 ms. Reduced automaton from 2 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 27 reset in 496 ms.
Product exploration explored 100000 steps with 24 reset in 536 ms.
Built C files in :
/tmp/ltsmin12779415851281170603
[2023-03-18 21:28:07] [INFO ] Computing symmetric may disable matrix : 702 transitions.
[2023-03-18 21:28:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:28:07] [INFO ] Computing symmetric may enable matrix : 702 transitions.
[2023-03-18 21:28:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:28:07] [INFO ] Computing Do-Not-Accords matrix : 702 transitions.
[2023-03-18 21:28:07] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:28:07] [INFO ] Built C files in 213ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12779415851281170603
Running compilation step : cd /tmp/ltsmin12779415851281170603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1732 ms.
Running link step : cd /tmp/ltsmin12779415851281170603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin12779415851281170603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1546303194356417982.hoa' '--buchi-type=spotba'
LTSmin run took 6307 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-050B-LTLFireability-02 finished in 38994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 542 transitions
Trivial Post-agglo rules discarded 542 transitions
Performed 542 trivial Post agglomeration. Transition count delta: 542
Iterating post reduction 0 with 542 rules applied. Total rules applied 542 place count 1962 transition count 1420
Reduce places removed 542 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 543 rules applied. Total rules applied 1085 place count 1420 transition count 1419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1086 place count 1419 transition count 1419
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 1086 place count 1419 transition count 1025
Deduced a syphon composed of 394 places in 1 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 1874 place count 1025 transition count 1025
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1883 place count 1016 transition count 1016
Iterating global reduction 3 with 9 rules applied. Total rules applied 1892 place count 1016 transition count 1016
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1892 place count 1016 transition count 1007
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1910 place count 1007 transition count 1007
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 0 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2804 place count 560 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2805 place count 560 transition count 559
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2807 place count 559 transition count 558
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3009 place count 458 transition count 658
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3103 place count 411 transition count 704
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3105 place count 409 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3106 place count 408 transition count 702
Applied a total of 3106 rules in 185 ms. Remains 408 /1963 variables (removed 1555) and now considering 702/1963 (removed 1261) transitions.
// Phase 1: matrix 702 rows 408 cols
[2023-03-18 21:28:16] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-18 21:28:16] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-18 21:28:16] [INFO ] Invariant cache hit.
[2023-03-18 21:28:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-18 21:28:16] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2023-03-18 21:28:16] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:28:16] [INFO ] Invariant cache hit.
[2023-03-18 21:28:17] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 408/1963 places, 702/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1182 ms. Remains : 408/1963 places, 702/1963 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-03 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 (EQ s31 1) (EQ s345 1)), p0:(AND (EQ s80 1) (EQ s84 1) (EQ s91 1) (EQ s345 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-03 finished in 1252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1962 transition count 1414
Reduce places removed 548 places and 0 transitions.
Iterating post reduction 1 with 548 rules applied. Total rules applied 1096 place count 1414 transition count 1414
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1096 place count 1414 transition count 1020
Deduced a syphon composed of 394 places in 1 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1884 place count 1020 transition count 1020
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1894 place count 1010 transition count 1010
Iterating global reduction 2 with 10 rules applied. Total rules applied 1904 place count 1010 transition count 1010
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1904 place count 1010 transition count 1002
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1920 place count 1002 transition count 1002
Performed 446 Post agglomeration using F-continuation condition.Transition count delta: 446
Deduced a syphon composed of 446 places in 0 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2812 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2813 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2815 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3017 place count 454 transition count 654
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3111 place count 407 transition count 700
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3113 place count 405 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3114 place count 404 transition count 698
Applied a total of 3114 rules in 266 ms. Remains 404 /1963 variables (removed 1559) and now considering 698/1963 (removed 1265) transitions.
// Phase 1: matrix 698 rows 404 cols
[2023-03-18 21:28:17] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-18 21:28:17] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-18 21:28:17] [INFO ] Invariant cache hit.
[2023-03-18 21:28:17] [INFO ] State equation strengthened by 250 read => feed constraints.
[2023-03-18 21:28:19] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 1719 ms to find 0 implicit places.
[2023-03-18 21:28:19] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:28:19] [INFO ] Invariant cache hit.
[2023-03-18 21:28:19] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/1963 places, 698/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2266 ms. Remains : 404/1963 places, 698/1963 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-04 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 0), p1:(EQ s335 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-04 finished in 2373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(((p2 U p3)&&p1)))) U G(!p2)))'
Support contains 3 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1953 transition count 1953
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1953 transition count 1953
Applied a total of 20 rules in 224 ms. Remains 1953 /1963 variables (removed 10) and now considering 1953/1963 (removed 10) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-18 21:28:19] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-18 21:28:20] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-18 21:28:20] [INFO ] Invariant cache hit.
[2023-03-18 21:28:21] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2023-03-18 21:28:21] [INFO ] Invariant cache hit.
[2023-03-18 21:28:22] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1963 places, 1953/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2847 ms. Remains : 1953/1963 places, 1953/1963 transitions.
Stuttering acceptance computed with spot in 344 ms :[p2, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (OR (NOT p3) (NOT p1)), true, (NOT p3), (OR (AND (NOT p1) p2) (AND p2 (NOT p3))), p2]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p3)) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p3))), acceptance={} source=6 dest: 7}], [{ cond=p2, acceptance={} source=7 dest: 4}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s1720 1), p0:(EQ s181 1), p3:(EQ s1116 1), p1:(AND (EQ s1720 1) (EQ s1116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2303 steps with 0 reset in 26 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-05 finished in 3253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1962 transition count 1416
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1416 transition count 1416
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1092 place count 1416 transition count 1020
Deduced a syphon composed of 396 places in 2 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 1884 place count 1020 transition count 1020
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1892 place count 1012 transition count 1012
Iterating global reduction 2 with 8 rules applied. Total rules applied 1900 place count 1012 transition count 1012
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1900 place count 1012 transition count 1005
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1914 place count 1005 transition count 1005
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 1 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2812 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2813 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2815 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3017 place count 454 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3113 place count 406 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3115 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3116 place count 403 transition count 699
Applied a total of 3116 rules in 314 ms. Remains 403 /1963 variables (removed 1560) and now considering 699/1963 (removed 1264) transitions.
// Phase 1: matrix 699 rows 403 cols
[2023-03-18 21:28:23] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-18 21:28:23] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-18 21:28:23] [INFO ] Invariant cache hit.
[2023-03-18 21:28:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:28:23] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-18 21:28:23] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 21:28:23] [INFO ] Invariant cache hit.
[2023-03-18 21:28:24] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1963 places, 699/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1407 ms. Remains : 403/1963 places, 699/1963 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s141 1) (EQ s150 0)), p0:(EQ s150 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14909 reset in 431 ms.
Product exploration explored 100000 steps with 14907 reset in 526 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 267 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:28:25] [INFO ] Invariant cache hit.
[2023-03-18 21:28:25] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:28:25] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2023-03-18 21:28:25] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:28:26] [INFO ] After 22ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:26] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 21:28:26] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 2 place count 403 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 402 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 401 transition count 696
Applied a total of 4 rules in 25 ms. Remains 401 /403 variables (removed 2) and now considering 696/699 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 401/403 places, 696/699 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3777 steps, run visited all 1 properties in 39 ms. (steps per millisecond=96 )
Probabilistic random walk after 3777 steps, saw 2153 distinct states, run finished after 40 ms. (steps per millisecond=94 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 439 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 17 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2023-03-18 21:28:26] [INFO ] Invariant cache hit.
[2023-03-18 21:28:27] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-18 21:28:27] [INFO ] Invariant cache hit.
[2023-03-18 21:28:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:28:27] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2023-03-18 21:28:27] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 21:28:27] [INFO ] Invariant cache hit.
[2023-03-18 21:28:28] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1292 ms. Remains : 403/403 places, 699/699 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 255 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:28:28] [INFO ] Invariant cache hit.
[2023-03-18 21:28:28] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:28:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-18 21:28:29] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:28:29] [INFO ] After 38ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:29] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-18 21:28:29] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 2 place count 403 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 402 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 401 transition count 696
Applied a total of 4 rules in 47 ms. Remains 401 /403 variables (removed 2) and now considering 696/699 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 401/403 places, 696/699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3777 steps, run visited all 1 properties in 89 ms. (steps per millisecond=42 )
Probabilistic random walk after 3777 steps, saw 2153 distinct states, run finished after 89 ms. (steps per millisecond=42 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 322 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14555 reset in 618 ms.
Product exploration explored 100000 steps with 15019 reset in 709 ms.
Built C files in :
/tmp/ltsmin16089442590458914955
[2023-03-18 21:28:31] [INFO ] Computing symmetric may disable matrix : 699 transitions.
[2023-03-18 21:28:31] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:28:31] [INFO ] Computing symmetric may enable matrix : 699 transitions.
[2023-03-18 21:28:31] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:28:31] [INFO ] Computing Do-Not-Accords matrix : 699 transitions.
[2023-03-18 21:28:31] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:28:31] [INFO ] Built C files in 172ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16089442590458914955
Running compilation step : cd /tmp/ltsmin16089442590458914955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2123 ms.
Running link step : cd /tmp/ltsmin16089442590458914955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin16089442590458914955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17822617510043729804.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 23 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2023-03-18 21:28:46] [INFO ] Invariant cache hit.
[2023-03-18 21:28:46] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-18 21:28:46] [INFO ] Invariant cache hit.
[2023-03-18 21:28:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:28:47] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2023-03-18 21:28:47] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 21:28:47] [INFO ] Invariant cache hit.
[2023-03-18 21:28:47] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1220 ms. Remains : 403/403 places, 699/699 transitions.
Built C files in :
/tmp/ltsmin15393283517028588005
[2023-03-18 21:28:47] [INFO ] Computing symmetric may disable matrix : 699 transitions.
[2023-03-18 21:28:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:28:47] [INFO ] Computing symmetric may enable matrix : 699 transitions.
[2023-03-18 21:28:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:28:47] [INFO ] Computing Do-Not-Accords matrix : 699 transitions.
[2023-03-18 21:28:47] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:28:47] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15393283517028588005
Running compilation step : cd /tmp/ltsmin15393283517028588005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1960 ms.
Running link step : cd /tmp/ltsmin15393283517028588005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin15393283517028588005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1109261333381346693.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:29:03] [INFO ] Flatten gal took : 42 ms
[2023-03-18 21:29:03] [INFO ] Flatten gal took : 36 ms
[2023-03-18 21:29:03] [INFO ] Time to serialize gal into /tmp/LTL3065216859105015666.gal : 10 ms
[2023-03-18 21:29:03] [INFO ] Time to serialize properties into /tmp/LTL564346540577081786.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3065216859105015666.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10967786677523034136.hoa' '-atoms' '/tmp/LTL564346540577081786.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL564346540577081786.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10967786677523034136.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t0.t157, t0.t158, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:29:18] [INFO ] Flatten gal took : 53 ms
[2023-03-18 21:29:18] [INFO ] Flatten gal took : 40 ms
[2023-03-18 21:29:18] [INFO ] Time to serialize gal into /tmp/LTL9117980354477188152.gal : 7 ms
[2023-03-18 21:29:18] [INFO ] Time to serialize properties into /tmp/LTL12478544190952098608.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9117980354477188152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12478544190952098608.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(p947==0)"))||(F("((p900==1)&&(p947==0))"))))
Formula 0 simplified : F!"(p947==0)" & G!"((p900==1)&&(p947==0))"
Reverse transition relation is NOT exact ! Due to transitions t1, t0.t157, t0.t158, Intersection with reachable at each step enabled. (destroyed/reverse/i...183
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:29:33] [INFO ] Flatten gal took : 51 ms
[2023-03-18 21:29:33] [INFO ] Applying decomposition
[2023-03-18 21:29:33] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14344624566642863065.txt' '-o' '/tmp/graph14344624566642863065.bin' '-w' '/tmp/graph14344624566642863065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14344624566642863065.bin' '-l' '-1' '-v' '-w' '/tmp/graph14344624566642863065.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:29:33] [INFO ] Decomposing Gal with order
[2023-03-18 21:29:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:29:33] [INFO ] Removed a total of 1376 redundant transitions.
[2023-03-18 21:29:33] [INFO ] Flatten gal took : 112 ms
[2023-03-18 21:29:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 626 labels/synchronizations in 34 ms.
[2023-03-18 21:29:33] [INFO ] Time to serialize gal into /tmp/LTL3174064867996236107.gal : 10 ms
[2023-03-18 21:29:33] [INFO ] Time to serialize properties into /tmp/LTL5513743399458303957.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3174064867996236107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5513743399458303957.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("(i5.u73.p947==0)"))||(F("((i4.u69.p900==1)&&(i5.u73.p947==0))"))))
Formula 0 simplified : F!"(i5.u73.p947==0)" & G!"((i4.u69.p900==1)&&(i5.u73.p947==0))"
Reverse transition relation is NOT exact ! Due to transitions i4.u69.t1, i5.u73.t0.t157, i5.u73.t0.t158, Intersection with reachable at each step enabled....204
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4829700901017815854
[2023-03-18 21:29:49] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4829700901017815854
Running compilation step : cd /tmp/ltsmin4829700901017815854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1070 ms.
Running link step : cd /tmp/ltsmin4829700901017815854;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin4829700901017815854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-050B-LTLFireability-06 finished in 101315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(p1&&X(G(p2))))))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 291 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-18 21:30:04] [INFO ] Computed 201 place invariants in 14 ms
[2023-03-18 21:30:05] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-18 21:30:05] [INFO ] Invariant cache hit.
[2023-03-18 21:30:06] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
[2023-03-18 21:30:06] [INFO ] Invariant cache hit.
[2023-03-18 21:30:07] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3281 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s958 0), p0:(EQ s958 1), p2:(EQ s818 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 509 ms.
Product exploration explored 100000 steps with 1 reset in 842 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Detected a total of 598/1952 stabilizing places and 598/1952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 1510 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 21:30:11] [INFO ] Invariant cache hit.
[2023-03-18 21:30:11] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-18 21:30:11] [INFO ] [Nat]Absence check using 201 positive place invariants in 76 ms returned sat
[2023-03-18 21:30:12] [INFO ] After 911ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-18 21:30:13] [INFO ] Deduced a trap composed of 22 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:30:13] [INFO ] Deduced a trap composed of 30 places in 313 ms of which 13 ms to minimize.
[2023-03-18 21:30:13] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 1 ms to minimize.
[2023-03-18 21:30:14] [INFO ] Deduced a trap composed of 37 places in 338 ms of which 1 ms to minimize.
[2023-03-18 21:30:14] [INFO ] Deduced a trap composed of 35 places in 270 ms of which 1 ms to minimize.
[2023-03-18 21:30:15] [INFO ] Deduced a trap composed of 32 places in 366 ms of which 1 ms to minimize.
[2023-03-18 21:30:15] [INFO ] Deduced a trap composed of 44 places in 368 ms of which 1 ms to minimize.
[2023-03-18 21:30:15] [INFO ] Deduced a trap composed of 25 places in 423 ms of which 3 ms to minimize.
[2023-03-18 21:30:16] [INFO ] Deduced a trap composed of 51 places in 335 ms of which 2 ms to minimize.
[2023-03-18 21:30:16] [INFO ] Deduced a trap composed of 33 places in 291 ms of which 1 ms to minimize.
[2023-03-18 21:30:16] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 0 ms to minimize.
[2023-03-18 21:30:17] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 1 ms to minimize.
[2023-03-18 21:30:17] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 1 ms to minimize.
[2023-03-18 21:30:17] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 1 ms to minimize.
[2023-03-18 21:30:18] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 1 ms to minimize.
[2023-03-18 21:30:18] [INFO ] Deduced a trap composed of 36 places in 320 ms of which 1 ms to minimize.
[2023-03-18 21:30:18] [INFO ] Deduced a trap composed of 51 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:30:19] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 1 ms to minimize.
[2023-03-18 21:30:19] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 0 ms to minimize.
[2023-03-18 21:30:20] [INFO ] Deduced a trap composed of 41 places in 330 ms of which 1 ms to minimize.
[2023-03-18 21:30:20] [INFO ] Deduced a trap composed of 62 places in 337 ms of which 1 ms to minimize.
[2023-03-18 21:30:21] [INFO ] Deduced a trap composed of 67 places in 363 ms of which 1 ms to minimize.
[2023-03-18 21:30:21] [INFO ] Deduced a trap composed of 40 places in 394 ms of which 1 ms to minimize.
[2023-03-18 21:30:21] [INFO ] Deduced a trap composed of 41 places in 362 ms of which 1 ms to minimize.
[2023-03-18 21:30:22] [INFO ] Deduced a trap composed of 49 places in 359 ms of which 1 ms to minimize.
[2023-03-18 21:30:22] [INFO ] Deduced a trap composed of 41 places in 366 ms of which 1 ms to minimize.
[2023-03-18 21:30:23] [INFO ] Deduced a trap composed of 64 places in 360 ms of which 1 ms to minimize.
[2023-03-18 21:30:23] [INFO ] Deduced a trap composed of 40 places in 360 ms of which 3 ms to minimize.
[2023-03-18 21:30:24] [INFO ] Deduced a trap composed of 55 places in 384 ms of which 1 ms to minimize.
[2023-03-18 21:30:24] [INFO ] Deduced a trap composed of 59 places in 357 ms of which 1 ms to minimize.
[2023-03-18 21:30:25] [INFO ] Deduced a trap composed of 67 places in 326 ms of which 1 ms to minimize.
[2023-03-18 21:30:25] [INFO ] Deduced a trap composed of 77 places in 324 ms of which 0 ms to minimize.
[2023-03-18 21:30:25] [INFO ] Deduced a trap composed of 69 places in 317 ms of which 1 ms to minimize.
[2023-03-18 21:30:26] [INFO ] Deduced a trap composed of 68 places in 333 ms of which 1 ms to minimize.
[2023-03-18 21:30:26] [INFO ] Deduced a trap composed of 61 places in 329 ms of which 1 ms to minimize.
[2023-03-18 21:30:27] [INFO ] Deduced a trap composed of 69 places in 306 ms of which 1 ms to minimize.
[2023-03-18 21:30:27] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 14334 ms
[2023-03-18 21:30:27] [INFO ] After 15699ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-18 21:30:27] [INFO ] After 16458ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 124 ms.
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1405
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1405 transition count 1405
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1094 place count 1405 transition count 1004
Deduced a syphon composed of 401 places in 2 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1896 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2794 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2797 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2999 place count 453 transition count 652
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3095 place count 405 transition count 700
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3096 place count 405 transition count 699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3097 place count 404 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3098 place count 403 transition count 698
Applied a total of 3098 rules in 311 ms. Remains 403 /1952 variables (removed 1549) and now considering 698/1952 (removed 1254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 403/1952 places, 698/1952 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 227028 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227028 steps, saw 146676 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 698 rows 403 cols
[2023-03-18 21:30:31] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-18 21:30:31] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:30:31] [INFO ] [Nat]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-18 21:30:31] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:30:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:30:31] [INFO ] After 60ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:30:32] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-18 21:30:32] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 698/698 transitions.
Applied a total of 0 rules in 10 ms. Remains 403 /403 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 403/403 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 698/698 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-18 21:30:32] [INFO ] Invariant cache hit.
[2023-03-18 21:30:32] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-18 21:30:32] [INFO ] Invariant cache hit.
[2023-03-18 21:30:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:30:32] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-18 21:30:32] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:30:32] [INFO ] Invariant cache hit.
[2023-03-18 21:30:33] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 924 ms. Remains : 403/403 places, 698/698 transitions.
Graph (trivial) has 200 edges and 403 vertex of which 4 / 403 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1387 edges and 401 vertex of which 399 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 197 edges and 397 vertex of which 4 / 397 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 395 transition count 689
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 196 edges and 393 vertex of which 6 / 393 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 390 transition count 680
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 194 edges and 387 vertex of which 8 / 387 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 383 transition count 669
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 190 edges and 379 vertex of which 8 / 379 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 375 transition count 655
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 186 edges and 371 vertex of which 8 / 371 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 367 transition count 641
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 182 edges and 363 vertex of which 8 / 363 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 359 transition count 627
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 178 edges and 355 vertex of which 8 / 355 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 351 transition count 613
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 174 edges and 347 vertex of which 8 / 347 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 599
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 170 edges and 339 vertex of which 8 / 339 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 335 transition count 585
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 166 edges and 331 vertex of which 8 / 331 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 327 transition count 571
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 162 edges and 323 vertex of which 8 / 323 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 319 transition count 557
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 158 edges and 315 vertex of which 8 / 315 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 311 transition count 543
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 154 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 303 transition count 529
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 299 vertex of which 8 / 299 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 295 transition count 515
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 146 edges and 291 vertex of which 8 / 291 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 287 transition count 501
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 142 edges and 283 vertex of which 8 / 283 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 279 transition count 487
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 138 edges and 275 vertex of which 8 / 275 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 271 transition count 473
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 267 vertex of which 8 / 267 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 263 transition count 459
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 130 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 255 transition count 445
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 126 edges and 251 vertex of which 8 / 251 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 247 transition count 431
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 122 edges and 243 vertex of which 8 / 243 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 239 transition count 417
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 231 transition count 403
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 223 transition count 389
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 110 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 215 transition count 375
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 106 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 207 transition count 361
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 102 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 199 transition count 347
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 95 edges and 197 vertex of which 2 / 197 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 26 with 13 rules applied. Total rules applied 485 place count 196 transition count 337
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 489 place count 195 transition count 334
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 491 place count 194 transition count 333
Graph (complete) has 661 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 28 with 1 rules applied. Total rules applied 492 place count 192 transition count 332
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 496 place count 192 transition count 328
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 30 with 4 rules applied. Total rules applied 500 place count 192 transition count 324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 502 place count 190 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 3 rules applied. Total rules applied 505 place count 188 transition count 323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 509 place count 188 transition count 319
Applied a total of 509 rules in 72 ms. Remains 188 /403 variables (removed 215) and now considering 319/698 (removed 379) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 319 rows 188 cols
[2023-03-18 21:30:33] [INFO ] Computed 93 place invariants in 2 ms
[2023-03-18 21:30:33] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:30:33] [INFO ] [Nat]Absence check using 93 positive place invariants in 12 ms returned sat
[2023-03-18 21:30:33] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:30:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-18 21:30:33] [INFO ] After 22ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:30:33] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 21:30:33] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p0))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 p0))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT p1)), (F (AND (NOT p1) p0)), (F (AND p0 p2)), (F (NOT (AND (NOT p0) p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 28 factoid took 1621 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 182 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Applied a total of 0 rules in 165 ms. Remains 1952 /1952 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-18 21:30:35] [INFO ] Computed 201 place invariants in 13 ms
[2023-03-18 21:30:36] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-18 21:30:36] [INFO ] Invariant cache hit.
[2023-03-18 21:30:37] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 2141 ms to find 0 implicit places.
[2023-03-18 21:30:37] [INFO ] Invariant cache hit.
[2023-03-18 21:30:38] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3396 ms. Remains : 1952/1952 places, 1952/1952 transitions.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Detected a total of 598/1952 stabilizing places and 598/1952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (AND p2 p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p0) p1)), (X (AND p2 p1)), (X p2), (X p1), (X (X (NOT (OR (AND p2 p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND p2 (NOT p0) p1))), (X (X (AND p2 p1))), (X (X p2)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 859 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:30:40] [INFO ] Invariant cache hit.
[2023-03-18 21:30:40] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:30:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 75 ms returned sat
[2023-03-18 21:30:41] [INFO ] After 791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:30:42] [INFO ] Deduced a trap composed of 26 places in 341 ms of which 1 ms to minimize.
[2023-03-18 21:30:42] [INFO ] Deduced a trap composed of 23 places in 320 ms of which 0 ms to minimize.
[2023-03-18 21:30:42] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 1 ms to minimize.
[2023-03-18 21:30:43] [INFO ] Deduced a trap composed of 37 places in 302 ms of which 1 ms to minimize.
[2023-03-18 21:30:43] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 1 ms to minimize.
[2023-03-18 21:30:44] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 1 ms to minimize.
[2023-03-18 21:30:44] [INFO ] Deduced a trap composed of 29 places in 330 ms of which 1 ms to minimize.
[2023-03-18 21:30:44] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 1 ms to minimize.
[2023-03-18 21:30:45] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 1 ms to minimize.
[2023-03-18 21:30:45] [INFO ] Deduced a trap composed of 39 places in 393 ms of which 1 ms to minimize.
[2023-03-18 21:30:45] [INFO ] Deduced a trap composed of 38 places in 291 ms of which 1 ms to minimize.
[2023-03-18 21:30:46] [INFO ] Deduced a trap composed of 58 places in 253 ms of which 1 ms to minimize.
[2023-03-18 21:30:46] [INFO ] Deduced a trap composed of 50 places in 377 ms of which 0 ms to minimize.
[2023-03-18 21:30:46] [INFO ] Deduced a trap composed of 35 places in 373 ms of which 1 ms to minimize.
[2023-03-18 21:30:47] [INFO ] Deduced a trap composed of 40 places in 370 ms of which 1 ms to minimize.
[2023-03-18 21:30:47] [INFO ] Deduced a trap composed of 35 places in 320 ms of which 1 ms to minimize.
[2023-03-18 21:30:48] [INFO ] Deduced a trap composed of 36 places in 396 ms of which 2 ms to minimize.
[2023-03-18 21:30:48] [INFO ] Deduced a trap composed of 47 places in 357 ms of which 1 ms to minimize.
[2023-03-18 21:30:48] [INFO ] Deduced a trap composed of 30 places in 283 ms of which 1 ms to minimize.
[2023-03-18 21:30:49] [INFO ] Deduced a trap composed of 38 places in 381 ms of which 1 ms to minimize.
[2023-03-18 21:30:49] [INFO ] Deduced a trap composed of 48 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:30:50] [INFO ] Deduced a trap composed of 48 places in 315 ms of which 1 ms to minimize.
[2023-03-18 21:30:50] [INFO ] Deduced a trap composed of 35 places in 344 ms of which 1 ms to minimize.
[2023-03-18 21:30:51] [INFO ] Deduced a trap composed of 47 places in 341 ms of which 1 ms to minimize.
[2023-03-18 21:30:51] [INFO ] Deduced a trap composed of 60 places in 337 ms of which 2 ms to minimize.
[2023-03-18 21:30:51] [INFO ] Deduced a trap composed of 66 places in 336 ms of which 1 ms to minimize.
[2023-03-18 21:30:52] [INFO ] Deduced a trap composed of 44 places in 332 ms of which 1 ms to minimize.
[2023-03-18 21:30:52] [INFO ] Deduced a trap composed of 43 places in 343 ms of which 1 ms to minimize.
[2023-03-18 21:30:53] [INFO ] Deduced a trap composed of 54 places in 341 ms of which 1 ms to minimize.
[2023-03-18 21:30:53] [INFO ] Deduced a trap composed of 69 places in 341 ms of which 1 ms to minimize.
[2023-03-18 21:30:53] [INFO ] Deduced a trap composed of 59 places in 305 ms of which 1 ms to minimize.
[2023-03-18 21:30:54] [INFO ] Deduced a trap composed of 53 places in 329 ms of which 1 ms to minimize.
[2023-03-18 21:30:54] [INFO ] Deduced a trap composed of 58 places in 254 ms of which 1 ms to minimize.
[2023-03-18 21:30:54] [INFO ] Deduced a trap composed of 69 places in 320 ms of which 1 ms to minimize.
[2023-03-18 21:30:55] [INFO ] Deduced a trap composed of 65 places in 299 ms of which 1 ms to minimize.
[2023-03-18 21:30:55] [INFO ] Deduced a trap composed of 62 places in 309 ms of which 1 ms to minimize.
[2023-03-18 21:30:56] [INFO ] Deduced a trap composed of 68 places in 296 ms of which 1 ms to minimize.
[2023-03-18 21:30:56] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 14371 ms
[2023-03-18 21:30:56] [INFO ] After 15407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-18 21:30:56] [INFO ] After 15998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1405
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1405 transition count 1405
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1094 place count 1405 transition count 1004
Deduced a syphon composed of 401 places in 2 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1896 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2794 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2797 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2999 place count 453 transition count 652
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3095 place count 405 transition count 700
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3096 place count 405 transition count 699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3097 place count 404 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3098 place count 403 transition count 698
Applied a total of 3098 rules in 267 ms. Remains 403 /1952 variables (removed 1549) and now considering 698/1952 (removed 1254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 403/1952 places, 698/1952 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 270788 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 270788 steps, saw 174929 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 698 rows 403 cols
[2023-03-18 21:31:00] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-18 21:31:00] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:31:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-18 21:31:00] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:31:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:31:00] [INFO ] After 46ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:31:00] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-18 21:31:00] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 44 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 698/698 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 403/403 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 698/698 transitions.
Applied a total of 0 rules in 8 ms. Remains 403 /403 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2023-03-18 21:31:00] [INFO ] Invariant cache hit.
[2023-03-18 21:31:01] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-18 21:31:01] [INFO ] Invariant cache hit.
[2023-03-18 21:31:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:31:01] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-18 21:31:01] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:31:01] [INFO ] Invariant cache hit.
[2023-03-18 21:31:01] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 921 ms. Remains : 403/403 places, 698/698 transitions.
Graph (trivial) has 200 edges and 403 vertex of which 4 / 403 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1387 edges and 401 vertex of which 399 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 197 edges and 397 vertex of which 4 / 397 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 395 transition count 689
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 196 edges and 393 vertex of which 6 / 393 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 390 transition count 680
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 194 edges and 387 vertex of which 8 / 387 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 383 transition count 669
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 190 edges and 379 vertex of which 8 / 379 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 375 transition count 655
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 186 edges and 371 vertex of which 8 / 371 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 367 transition count 641
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 182 edges and 363 vertex of which 8 / 363 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 359 transition count 627
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 178 edges and 355 vertex of which 8 / 355 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 351 transition count 613
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 174 edges and 347 vertex of which 8 / 347 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 599
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 170 edges and 339 vertex of which 8 / 339 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 335 transition count 585
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 166 edges and 331 vertex of which 8 / 331 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 327 transition count 571
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 162 edges and 323 vertex of which 8 / 323 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 319 transition count 557
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 158 edges and 315 vertex of which 8 / 315 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 311 transition count 543
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 154 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 303 transition count 529
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 299 vertex of which 8 / 299 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 295 transition count 515
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 146 edges and 291 vertex of which 8 / 291 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 287 transition count 501
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 142 edges and 283 vertex of which 8 / 283 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 279 transition count 487
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 138 edges and 275 vertex of which 8 / 275 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 271 transition count 473
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 267 vertex of which 8 / 267 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 263 transition count 459
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 130 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 255 transition count 445
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 126 edges and 251 vertex of which 8 / 251 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 247 transition count 431
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 122 edges and 243 vertex of which 8 / 243 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 239 transition count 417
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 231 transition count 403
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 223 transition count 389
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 110 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 215 transition count 375
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 106 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 207 transition count 361
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 102 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 199 transition count 347
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 95 edges and 197 vertex of which 2 / 197 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 26 with 13 rules applied. Total rules applied 485 place count 196 transition count 337
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 489 place count 195 transition count 334
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 491 place count 194 transition count 333
Graph (complete) has 661 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 28 with 1 rules applied. Total rules applied 492 place count 192 transition count 332
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 496 place count 192 transition count 328
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 30 with 4 rules applied. Total rules applied 500 place count 192 transition count 324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 502 place count 190 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 31 with 3 rules applied. Total rules applied 505 place count 188 transition count 323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 509 place count 188 transition count 319
Applied a total of 509 rules in 63 ms. Remains 188 /403 variables (removed 215) and now considering 319/698 (removed 379) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 319 rows 188 cols
[2023-03-18 21:31:01] [INFO ] Computed 93 place invariants in 0 ms
[2023-03-18 21:31:01] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:31:01] [INFO ] [Nat]Absence check using 93 positive place invariants in 11 ms returned sat
[2023-03-18 21:31:01] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:31:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-18 21:31:02] [INFO ] After 15ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:31:02] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-18 21:31:02] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (OR (AND p2 p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (AND p2 (NOT p0) p1)), (X (AND p2 p1)), (X p2), (X p1), (X (X (NOT (OR (AND p2 p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), true, (X (X (AND p2 (NOT p0) p1))), (X (X (AND p2 p1))), (X (X p2)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p2 p1))), (F (NOT (AND p2 p1 (NOT p0)))), (F (OR (AND p2 p0) (NOT p1)))]
Knowledge based reduction with 16 factoid took 1009 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 118 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Stuttering acceptance computed with spot in 160 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Product exploration explored 100000 steps with 3 reset in 433 ms.
Product exploration explored 100000 steps with 0 reset in 689 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND p1 (NOT p2)) (AND p0 p1)), true, p1, (NOT p2)]
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Performed 547 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1952
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 547 place count 1952 transition count 2153
Deduced a syphon composed of 749 places in 3 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 749 place count 1952 transition count 2153
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1347 places in 3 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 1347 place count 1952 transition count 2153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1348 place count 1952 transition count 2152
Renaming transitions due to excessive name length > 1024 char.
Discarding 397 places :
Symmetric choice reduction at 2 with 397 rule applications. Total rules 1745 place count 1555 transition count 1755
Deduced a syphon composed of 950 places in 2 ms
Iterating global reduction 2 with 397 rules applied. Total rules applied 2142 place count 1555 transition count 1755
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 951 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2143 place count 1555 transition count 1755
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2145 place count 1553 transition count 1753
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2147 place count 1553 transition count 1753
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -725
Deduced a syphon composed of 1050 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2248 place count 1553 transition count 2478
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2350 place count 1451 transition count 2274
Deduced a syphon composed of 948 places in 1 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2452 place count 1451 transition count 2274
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -705
Deduced a syphon composed of 1046 places in 0 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 2550 place count 1451 transition count 2979
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 2648 place count 1353 transition count 2783
Deduced a syphon composed of 948 places in 0 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 2746 place count 1353 transition count 2783
Deduced a syphon composed of 948 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2749 place count 1353 transition count 2780
Deduced a syphon composed of 948 places in 1 ms
Applied a total of 2749 rules in 1146 ms. Remains 1353 /1952 variables (removed 599) and now considering 2780/1952 (removed -828) transitions.
[2023-03-18 21:31:06] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 2780 rows 1353 cols
[2023-03-18 21:31:06] [INFO ] Computed 201 place invariants in 52 ms
[2023-03-18 21:31:07] [INFO ] Dead Transitions using invariants and state equation in 1128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1353/1952 places, 2780/1952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2359 ms. Remains : 1353/1952 places, 2780/1952 transitions.
Built C files in :
/tmp/ltsmin17664900481811030441
[2023-03-18 21:31:07] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17664900481811030441
Running compilation step : cd /tmp/ltsmin17664900481811030441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17664900481811030441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17664900481811030441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Applied a total of 0 rules in 79 ms. Remains 1952 /1952 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-18 21:31:10] [INFO ] Computed 201 place invariants in 8 ms
[2023-03-18 21:31:11] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-18 21:31:11] [INFO ] Invariant cache hit.
[2023-03-18 21:31:12] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2023-03-18 21:31:12] [INFO ] Invariant cache hit.
[2023-03-18 21:31:13] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2818 ms. Remains : 1952/1952 places, 1952/1952 transitions.
Built C files in :
/tmp/ltsmin18050917827542389169
[2023-03-18 21:31:13] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18050917827542389169
Running compilation step : cd /tmp/ltsmin18050917827542389169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18050917827542389169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18050917827542389169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 21:31:16] [INFO ] Flatten gal took : 77 ms
[2023-03-18 21:31:16] [INFO ] Flatten gal took : 61 ms
[2023-03-18 21:31:16] [INFO ] Time to serialize gal into /tmp/LTL16064518113456901427.gal : 13 ms
[2023-03-18 21:31:16] [INFO ] Time to serialize properties into /tmp/LTL2565750942323296548.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16064518113456901427.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5522424063177828471.hoa' '-atoms' '/tmp/LTL2565750942323296548.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2565750942323296548.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5522424063177828471.hoa
Detected timeout of ITS tools.
[2023-03-18 21:31:31] [INFO ] Flatten gal took : 55 ms
[2023-03-18 21:31:31] [INFO ] Flatten gal took : 46 ms
[2023-03-18 21:31:31] [INFO ] Time to serialize gal into /tmp/LTL2376125453906957120.gal : 8 ms
[2023-03-18 21:31:31] [INFO ] Time to serialize properties into /tmp/LTL9657563238826412890.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2376125453906957120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9657563238826412890.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((G("(p1218==1)"))||(("(p1218==0)")&&(X(G("(p1038==0)")))))))
Formula 0 simplified : F(F!"(p1218==1)" & (!"(p1218==0)" | XF!"(p1038==0)"))
Detected timeout of ITS tools.
[2023-03-18 21:31:46] [INFO ] Flatten gal took : 49 ms
[2023-03-18 21:31:46] [INFO ] Applying decomposition
[2023-03-18 21:31:46] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6507381636015998375.txt' '-o' '/tmp/graph6507381636015998375.bin' '-w' '/tmp/graph6507381636015998375.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6507381636015998375.bin' '-l' '-1' '-v' '-w' '/tmp/graph6507381636015998375.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:31:47] [INFO ] Decomposing Gal with order
[2023-03-18 21:31:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:31:47] [INFO ] Removed a total of 496 redundant transitions.
[2023-03-18 21:31:47] [INFO ] Flatten gal took : 107 ms
[2023-03-18 21:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-18 21:31:47] [INFO ] Time to serialize gal into /tmp/LTL530423198274137892.gal : 23 ms
[2023-03-18 21:31:47] [INFO ] Time to serialize properties into /tmp/LTL4040008199158686475.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL530423198274137892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4040008199158686475.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G((G("(i23.i4.u372.p1218==1)"))||(("(i23.i4.u372.p1218==0)")&&(X(G("(i20.i1.u319.p1038==0)")))))))
Formula 0 simplified : F(F!"(i23.i4.u372.p1218==1)" & (!"(i23.i4.u372.p1218==0)" | XF!"(i20.i1.u319.p1038==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7197418633229385897
[2023-03-18 21:32:02] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7197418633229385897
Running compilation step : cd /tmp/ltsmin7197418633229385897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7197418633229385897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7197418633229385897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVt-PT-050B-LTLFireability-07 finished in 121510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1951 transition count 1951
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1951 transition count 1951
Applied a total of 24 rules in 234 ms. Remains 1951 /1963 variables (removed 12) and now considering 1951/1963 (removed 12) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2023-03-18 21:32:05] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-18 21:32:06] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-18 21:32:06] [INFO ] Invariant cache hit.
[2023-03-18 21:32:07] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
[2023-03-18 21:32:07] [INFO ] Invariant cache hit.
[2023-03-18 21:32:08] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1951/1963 places, 1951/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3160 ms. Remains : 1951/1963 places, 1951/1963 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s126 1), p1:(NEQ s1885 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 588 ms.
Product exploration explored 100000 steps with 33333 reset in 765 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLFireability-08 finished in 4892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U (G((p1||G(!p1)))||(G(p2)&&(p1||G(!p1)))))))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 230 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-18 21:32:10] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-18 21:32:11] [INFO ] Implicit Places using invariants in 651 ms returned []
[2023-03-18 21:32:11] [INFO ] Invariant cache hit.
[2023-03-18 21:32:12] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2023-03-18 21:32:12] [INFO ] Invariant cache hit.
[2023-03-18 21:32:13] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3079 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 267 ms :[true, (AND (NOT p2) p1), false, false, false, false, false, (AND p1 (NOT p0)), p1, (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 8}, { cond=(AND p1 p2), acceptance={} source=1 dest: 9}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 p2), acceptance={} source=2 dest: 6}, { cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=p1, acceptance={} source=8 dest: 0}, { cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 0}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=2, aps=[p1:(EQ s1355 1), p2:(NEQ s623 1), p0:(EQ s623 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 831 ms.
Product exploration explored 100000 steps with 50000 reset in 832 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/1952 stabilizing places and 599/1952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 15 factoid took 291 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLFireability-09 finished in 5351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 208 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-18 21:32:16] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-18 21:32:16] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-18 21:32:16] [INFO ] Invariant cache hit.
[2023-03-18 21:32:17] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2023-03-18 21:32:17] [INFO ] Invariant cache hit.
[2023-03-18 21:32:18] [INFO ] Dead Transitions using invariants and state equation in 848 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2857 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-10 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 (EQ s98 1) (AND (EQ s1623 1) (EQ s1627 1) (EQ s1640 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 14 reset in 372 ms.
Stack based approach found an accepted trace after 1079 steps with 0 reset with depth 1080 and stack size 1080 in 5 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-10 finished in 3334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1962 transition count 1415
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1415 transition count 1415
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1094 place count 1415 transition count 1020
Deduced a syphon composed of 395 places in 2 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1884 place count 1020 transition count 1020
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1893 place count 1011 transition count 1011
Iterating global reduction 2 with 9 rules applied. Total rules applied 1902 place count 1011 transition count 1011
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1902 place count 1011 transition count 1003
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1918 place count 1003 transition count 1003
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2814 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2815 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2817 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3019 place count 453 transition count 653
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3113 place count 406 transition count 698
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3115 place count 404 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3116 place count 403 transition count 696
Applied a total of 3116 rules in 274 ms. Remains 403 /1963 variables (removed 1560) and now considering 696/1963 (removed 1267) transitions.
// Phase 1: matrix 696 rows 403 cols
[2023-03-18 21:32:19] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-18 21:32:19] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-18 21:32:19] [INFO ] Invariant cache hit.
[2023-03-18 21:32:20] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2023-03-18 21:32:20] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 21:32:20] [INFO ] Invariant cache hit.
[2023-03-18 21:32:20] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1963 places, 696/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1186 ms. Remains : 403/1963 places, 696/1963 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s59 1), p1:(EQ s334 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-12 finished in 1262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1962 transition count 1416
Reduce places removed 546 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 548 rules applied. Total rules applied 1094 place count 1416 transition count 1414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1096 place count 1414 transition count 1414
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1096 place count 1414 transition count 1019
Deduced a syphon composed of 395 places in 1 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 1886 place count 1019 transition count 1019
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1896 place count 1009 transition count 1009
Iterating global reduction 3 with 10 rules applied. Total rules applied 1906 place count 1009 transition count 1009
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1906 place count 1009 transition count 1000
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1924 place count 1000 transition count 1000
Performed 443 Post agglomeration using F-continuation condition.Transition count delta: 443
Deduced a syphon composed of 443 places in 0 ms
Reduce places removed 443 places and 0 transitions.
Iterating global reduction 3 with 886 rules applied. Total rules applied 2810 place count 557 transition count 557
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2811 place count 557 transition count 556
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2813 place count 556 transition count 555
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3015 place count 455 transition count 655
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 3111 place count 407 transition count 703
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3113 place count 405 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3114 place count 404 transition count 701
Applied a total of 3114 rules in 215 ms. Remains 404 /1963 variables (removed 1559) and now considering 701/1963 (removed 1262) transitions.
// Phase 1: matrix 701 rows 404 cols
[2023-03-18 21:32:20] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-18 21:32:20] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-18 21:32:20] [INFO ] Invariant cache hit.
[2023-03-18 21:32:21] [INFO ] State equation strengthened by 105 read => feed constraints.
[2023-03-18 21:32:21] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2023-03-18 21:32:21] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 21:32:21] [INFO ] Invariant cache hit.
[2023-03-18 21:32:21] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/1963 places, 701/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1282 ms. Remains : 404/1963 places, 701/1963 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s75 0) (EQ s135 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLFireability-13 finished in 1367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1953 transition count 1953
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1953 transition count 1953
Applied a total of 20 rules in 234 ms. Remains 1953 /1963 variables (removed 10) and now considering 1953/1963 (removed 10) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-18 21:32:22] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-18 21:32:22] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-18 21:32:22] [INFO ] Invariant cache hit.
[2023-03-18 21:32:23] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1904 ms to find 0 implicit places.
[2023-03-18 21:32:23] [INFO ] Invariant cache hit.
[2023-03-18 21:32:24] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1963 places, 1953/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3041 ms. Remains : 1953/1963 places, 1953/1963 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1123 1), p1:(EQ s350 0)], 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 2 reset in 492 ms.
Product exploration explored 100000 steps with 2 reset in 664 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 243 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 170340 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170340 steps, saw 95986 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:32:29] [INFO ] Invariant cache hit.
[2023-03-18 21:32:30] [INFO ] [Real]Absence check using 201 positive place invariants in 59 ms returned sat
[2023-03-18 21:32:30] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:32:30] [INFO ] [Nat]Absence check using 201 positive place invariants in 60 ms returned sat
[2023-03-18 21:32:31] [INFO ] After 783ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:32:31] [INFO ] Deduced a trap composed of 32 places in 327 ms of which 1 ms to minimize.
[2023-03-18 21:32:31] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 1 ms to minimize.
[2023-03-18 21:32:32] [INFO ] Deduced a trap composed of 22 places in 309 ms of which 0 ms to minimize.
[2023-03-18 21:32:32] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 1 ms to minimize.
[2023-03-18 21:32:33] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 0 ms to minimize.
[2023-03-18 21:32:33] [INFO ] Deduced a trap composed of 32 places in 397 ms of which 1 ms to minimize.
[2023-03-18 21:32:33] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 1 ms to minimize.
[2023-03-18 21:32:34] [INFO ] Deduced a trap composed of 36 places in 254 ms of which 1 ms to minimize.
[2023-03-18 21:32:34] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 0 ms to minimize.
[2023-03-18 21:32:34] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 2 ms to minimize.
[2023-03-18 21:32:35] [INFO ] Deduced a trap composed of 20 places in 378 ms of which 1 ms to minimize.
[2023-03-18 21:32:35] [INFO ] Deduced a trap composed of 26 places in 462 ms of which 1 ms to minimize.
[2023-03-18 21:32:36] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 1 ms to minimize.
[2023-03-18 21:32:36] [INFO ] Deduced a trap composed of 53 places in 291 ms of which 1 ms to minimize.
[2023-03-18 21:32:36] [INFO ] Deduced a trap composed of 44 places in 332 ms of which 1 ms to minimize.
[2023-03-18 21:32:37] [INFO ] Deduced a trap composed of 56 places in 338 ms of which 1 ms to minimize.
[2023-03-18 21:32:37] [INFO ] Deduced a trap composed of 44 places in 344 ms of which 1 ms to minimize.
[2023-03-18 21:32:38] [INFO ] Deduced a trap composed of 41 places in 359 ms of which 1 ms to minimize.
[2023-03-18 21:32:38] [INFO ] Deduced a trap composed of 57 places in 378 ms of which 1 ms to minimize.
[2023-03-18 21:32:38] [INFO ] Deduced a trap composed of 51 places in 372 ms of which 1 ms to minimize.
[2023-03-18 21:32:39] [INFO ] Deduced a trap composed of 43 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:32:39] [INFO ] Deduced a trap composed of 53 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:32:40] [INFO ] Deduced a trap composed of 51 places in 357 ms of which 1 ms to minimize.
[2023-03-18 21:32:40] [INFO ] Deduced a trap composed of 59 places in 368 ms of which 1 ms to minimize.
[2023-03-18 21:32:41] [INFO ] Deduced a trap composed of 65 places in 350 ms of which 1 ms to minimize.
[2023-03-18 21:32:41] [INFO ] Deduced a trap composed of 48 places in 321 ms of which 1 ms to minimize.
[2023-03-18 21:32:41] [INFO ] Deduced a trap composed of 52 places in 330 ms of which 0 ms to minimize.
[2023-03-18 21:32:42] [INFO ] Deduced a trap composed of 72 places in 337 ms of which 1 ms to minimize.
[2023-03-18 21:32:42] [INFO ] Deduced a trap composed of 50 places in 337 ms of which 1 ms to minimize.
[2023-03-18 21:32:43] [INFO ] Deduced a trap composed of 63 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:32:43] [INFO ] Deduced a trap composed of 59 places in 397 ms of which 1 ms to minimize.
[2023-03-18 21:32:43] [INFO ] Deduced a trap composed of 58 places in 317 ms of which 1 ms to minimize.
[2023-03-18 21:32:44] [INFO ] Deduced a trap composed of 52 places in 507 ms of which 1 ms to minimize.
[2023-03-18 21:32:45] [INFO ] Deduced a trap composed of 55 places in 351 ms of which 1 ms to minimize.
[2023-03-18 21:32:45] [INFO ] Deduced a trap composed of 59 places in 344 ms of which 0 ms to minimize.
[2023-03-18 21:32:45] [INFO ] Deduced a trap composed of 59 places in 302 ms of which 1 ms to minimize.
[2023-03-18 21:32:46] [INFO ] Deduced a trap composed of 65 places in 315 ms of which 1 ms to minimize.
[2023-03-18 21:32:46] [INFO ] Deduced a trap composed of 65 places in 332 ms of which 1 ms to minimize.
[2023-03-18 21:32:47] [INFO ] Deduced a trap composed of 67 places in 310 ms of which 1 ms to minimize.
[2023-03-18 21:32:47] [INFO ] Deduced a trap composed of 67 places in 302 ms of which 1 ms to minimize.
[2023-03-18 21:32:47] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 16318 ms
[2023-03-18 21:32:48] [INFO ] Deduced a trap composed of 43 places in 296 ms of which 1 ms to minimize.
[2023-03-18 21:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 488 ms
[2023-03-18 21:32:48] [INFO ] After 17742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 283 ms.
[2023-03-18 21:32:48] [INFO ] After 18336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 101 ms.
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1953 transition count 1406
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1406 transition count 1406
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1094 place count 1406 transition count 1006
Deduced a syphon composed of 400 places in 2 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1894 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 0 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2798 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2799 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2801 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3003 place count 452 transition count 650
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3099 place count 404 transition count 698
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 404 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 403 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 402 transition count 696
Applied a total of 3102 rules in 229 ms. Remains 402 /1953 variables (removed 1551) and now considering 696/1953 (removed 1257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 402/1953 places, 696/1953 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 282104 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 282104 steps, saw 177172 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 696 rows 402 cols
[2023-03-18 21:32:52] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-18 21:32:52] [INFO ] [Real]Absence check using 200 positive place invariants in 27 ms returned sat
[2023-03-18 21:32:52] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:32:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-18 21:32:52] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:32:52] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-18 21:32:52] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 53 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 402/402 places, 696/696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 7 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2023-03-18 21:32:52] [INFO ] Invariant cache hit.
[2023-03-18 21:32:52] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-18 21:32:52] [INFO ] Invariant cache hit.
[2023-03-18 21:32:53] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2023-03-18 21:32:53] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 21:32:53] [INFO ] Invariant cache hit.
[2023-03-18 21:32:53] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1151 ms. Remains : 402/402 places, 696/696 transitions.
Graph (trivial) has 199 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1385 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 196 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 687
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 195 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 678
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 193 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 667
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 189 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 653
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 185 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 639
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 181 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 177 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 173 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 334 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 326 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 322 vertex of which 8 / 322 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 318 transition count 555
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 314 vertex of which 8 / 314 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 310 transition count 541
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 302 transition count 527
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 149 edges and 298 vertex of which 8 / 298 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 294 transition count 513
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 145 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 286 transition count 499
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 278 transition count 485
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 274 vertex of which 8 / 274 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 270 transition count 471
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 266 vertex of which 8 / 266 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 262 transition count 457
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 129 edges and 258 vertex of which 8 / 258 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 254 transition count 443
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 250 vertex of which 8 / 250 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 246 transition count 429
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 242 vertex of which 8 / 242 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 238 transition count 415
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 117 edges and 234 vertex of which 6 / 234 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 18 rules applied. Total rules applied 395 place count 231 transition count 402
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 114 edges and 228 vertex of which 6 / 228 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 22 with 16 rules applied. Total rules applied 411 place count 225 transition count 390
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 112 edges and 222 vertex of which 8 / 222 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 15 rules applied. Total rules applied 426 place count 218 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 109 edges and 214 vertex of which 10 / 214 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 445 place count 209 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 103 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 22 rules applied. Total rules applied 467 place count 201 transition count 348
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 197 vertex of which 8 / 197 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 486 place count 193 transition count 334
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 189 vertex of which 8 / 189 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 505 place count 185 transition count 320
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 181 vertex of which 8 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 524 place count 177 transition count 306
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 173 vertex of which 8 / 173 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 543 place count 169 transition count 292
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 165 vertex of which 8 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 562 place count 161 transition count 278
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 157 vertex of which 8 / 157 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 581 place count 153 transition count 264
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 149 vertex of which 8 / 149 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 600 place count 145 transition count 250
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 141 vertex of which 8 / 141 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 619 place count 137 transition count 236
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 67 edges and 133 vertex of which 8 / 133 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 638 place count 129 transition count 222
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 63 edges and 125 vertex of which 8 / 125 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 657 place count 121 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 117 vertex of which 8 / 117 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 676 place count 113 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 55 edges and 109 vertex of which 8 / 109 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 695 place count 105 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 51 edges and 101 vertex of which 8 / 101 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 714 place count 97 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 47 edges and 93 vertex of which 8 / 93 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 733 place count 89 transition count 152
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 43 edges and 85 vertex of which 8 / 85 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 752 place count 81 transition count 138
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 39 edges and 77 vertex of which 8 / 77 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 771 place count 73 transition count 124
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 34 edges and 70 vertex of which 6 / 70 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 42 with 17 rules applied. Total rules applied 788 place count 67 transition count 111
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 31 edges and 64 vertex of which 6 / 64 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 43 with 16 rules applied. Total rules applied 804 place count 61 transition count 99
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 29 edges and 58 vertex of which 6 / 58 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 44 with 15 rules applied. Total rules applied 819 place count 55 transition count 88
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 27 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 15 rules applied. Total rules applied 834 place count 48 transition count 77
Discarding 32 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Remove reverse transitions (loop back) rule discarded transition t33.t30.t31 and 32 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 46 with 11 rules applied. Total rules applied 845 place count 12 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 47 with 2 Pre rules applied. Total rules applied 845 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 6 rules applied. Total rules applied 851 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 47 with 3 rules applied. Total rules applied 854 place count 6 transition count 8
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 7 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 47 with 3 rules applied. Total rules applied 857 place count 4 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 858 place count 4 transition count 4
Applied a total of 858 rules in 103 ms. Remains 4 /402 variables (removed 398) and now considering 4/696 (removed 692) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-18 21:32:53] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-18 21:32:53] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:32:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-18 21:32:53] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:32:53] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 21:32:53] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Applied a total of 0 rules in 120 ms. Remains 1953 /1953 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-18 21:32:54] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-18 21:32:55] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-18 21:32:55] [INFO ] Invariant cache hit.
[2023-03-18 21:32:56] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
[2023-03-18 21:32:56] [INFO ] Invariant cache hit.
[2023-03-18 21:32:57] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3181 ms. Remains : 1953/1953 places, 1953/1953 transitions.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 187709 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187709 steps, saw 102982 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:33:01] [INFO ] Invariant cache hit.
[2023-03-18 21:33:01] [INFO ] [Real]Absence check using 201 positive place invariants in 52 ms returned sat
[2023-03-18 21:33:01] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:33:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 80 ms returned sat
[2023-03-18 21:33:02] [INFO ] After 903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:33:03] [INFO ] Deduced a trap composed of 32 places in 465 ms of which 1 ms to minimize.
[2023-03-18 21:33:03] [INFO ] Deduced a trap composed of 21 places in 452 ms of which 1 ms to minimize.
[2023-03-18 21:33:04] [INFO ] Deduced a trap composed of 22 places in 394 ms of which 1 ms to minimize.
[2023-03-18 21:33:04] [INFO ] Deduced a trap composed of 23 places in 380 ms of which 1 ms to minimize.
[2023-03-18 21:33:05] [INFO ] Deduced a trap composed of 34 places in 416 ms of which 1 ms to minimize.
[2023-03-18 21:33:05] [INFO ] Deduced a trap composed of 32 places in 378 ms of which 1 ms to minimize.
[2023-03-18 21:33:06] [INFO ] Deduced a trap composed of 26 places in 350 ms of which 1 ms to minimize.
[2023-03-18 21:33:06] [INFO ] Deduced a trap composed of 36 places in 340 ms of which 1 ms to minimize.
[2023-03-18 21:33:07] [INFO ] Deduced a trap composed of 40 places in 348 ms of which 1 ms to minimize.
[2023-03-18 21:33:07] [INFO ] Deduced a trap composed of 40 places in 355 ms of which 1 ms to minimize.
[2023-03-18 21:33:08] [INFO ] Deduced a trap composed of 20 places in 391 ms of which 1 ms to minimize.
[2023-03-18 21:33:08] [INFO ] Deduced a trap composed of 26 places in 426 ms of which 1 ms to minimize.
[2023-03-18 21:33:08] [INFO ] Deduced a trap composed of 34 places in 364 ms of which 1 ms to minimize.
[2023-03-18 21:33:09] [INFO ] Deduced a trap composed of 53 places in 389 ms of which 1 ms to minimize.
[2023-03-18 21:33:09] [INFO ] Deduced a trap composed of 44 places in 337 ms of which 1 ms to minimize.
[2023-03-18 21:33:10] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 1 ms to minimize.
[2023-03-18 21:33:10] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 1 ms to minimize.
[2023-03-18 21:33:10] [INFO ] Deduced a trap composed of 41 places in 350 ms of which 0 ms to minimize.
[2023-03-18 21:33:11] [INFO ] Deduced a trap composed of 57 places in 371 ms of which 1 ms to minimize.
[2023-03-18 21:33:11] [INFO ] Deduced a trap composed of 51 places in 332 ms of which 1 ms to minimize.
[2023-03-18 21:33:12] [INFO ] Deduced a trap composed of 43 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:33:12] [INFO ] Deduced a trap composed of 53 places in 379 ms of which 1 ms to minimize.
[2023-03-18 21:33:12] [INFO ] Deduced a trap composed of 51 places in 336 ms of which 1 ms to minimize.
[2023-03-18 21:33:13] [INFO ] Deduced a trap composed of 59 places in 334 ms of which 1 ms to minimize.
[2023-03-18 21:33:13] [INFO ] Deduced a trap composed of 65 places in 334 ms of which 1 ms to minimize.
[2023-03-18 21:33:14] [INFO ] Deduced a trap composed of 48 places in 310 ms of which 1 ms to minimize.
[2023-03-18 21:33:14] [INFO ] Deduced a trap composed of 52 places in 317 ms of which 1 ms to minimize.
[2023-03-18 21:33:14] [INFO ] Deduced a trap composed of 72 places in 314 ms of which 1 ms to minimize.
[2023-03-18 21:33:15] [INFO ] Deduced a trap composed of 50 places in 312 ms of which 1 ms to minimize.
[2023-03-18 21:33:15] [INFO ] Deduced a trap composed of 63 places in 331 ms of which 1 ms to minimize.
[2023-03-18 21:33:16] [INFO ] Deduced a trap composed of 59 places in 322 ms of which 1 ms to minimize.
[2023-03-18 21:33:16] [INFO ] Deduced a trap composed of 58 places in 305 ms of which 1 ms to minimize.
[2023-03-18 21:33:16] [INFO ] Deduced a trap composed of 52 places in 301 ms of which 1 ms to minimize.
[2023-03-18 21:33:17] [INFO ] Deduced a trap composed of 55 places in 339 ms of which 1 ms to minimize.
[2023-03-18 21:33:17] [INFO ] Deduced a trap composed of 59 places in 349 ms of which 1 ms to minimize.
[2023-03-18 21:33:17] [INFO ] Deduced a trap composed of 59 places in 292 ms of which 1 ms to minimize.
[2023-03-18 21:33:18] [INFO ] Deduced a trap composed of 65 places in 309 ms of which 1 ms to minimize.
[2023-03-18 21:33:18] [INFO ] Deduced a trap composed of 65 places in 301 ms of which 1 ms to minimize.
[2023-03-18 21:33:19] [INFO ] Deduced a trap composed of 67 places in 285 ms of which 1 ms to minimize.
[2023-03-18 21:33:19] [INFO ] Deduced a trap composed of 67 places in 285 ms of which 1 ms to minimize.
[2023-03-18 21:33:19] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 16694 ms
[2023-03-18 21:33:19] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 1 ms to minimize.
[2023-03-18 21:33:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2023-03-18 21:33:20] [INFO ] After 18191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 308 ms.
[2023-03-18 21:33:20] [INFO ] After 18939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 106 ms.
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1953 transition count 1406
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1406 transition count 1406
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1094 place count 1406 transition count 1006
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1894 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 0 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2798 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2799 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2801 place count 553 transition count 552
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3003 place count 452 transition count 650
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3099 place count 404 transition count 698
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 404 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 403 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 402 transition count 696
Applied a total of 3102 rules in 276 ms. Remains 402 /1953 variables (removed 1551) and now considering 696/1953 (removed 1257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 402/1953 places, 696/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 246868 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246868 steps, saw 154018 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 696 rows 402 cols
[2023-03-18 21:33:24] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-18 21:33:24] [INFO ] [Real]Absence check using 200 positive place invariants in 22 ms returned sat
[2023-03-18 21:33:24] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:33:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-18 21:33:24] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:33:24] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-18 21:33:24] [INFO ] After 426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 107 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 23 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 402/402 places, 696/696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 696/696 transitions.
Applied a total of 0 rules in 19 ms. Remains 402 /402 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2023-03-18 21:33:24] [INFO ] Invariant cache hit.
[2023-03-18 21:33:25] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-18 21:33:25] [INFO ] Invariant cache hit.
[2023-03-18 21:33:25] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2023-03-18 21:33:25] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 21:33:25] [INFO ] Invariant cache hit.
[2023-03-18 21:33:25] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1135 ms. Remains : 402/402 places, 696/696 transitions.
Graph (trivial) has 199 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1385 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 196 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 687
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 195 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 678
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 193 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 667
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 189 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 653
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 185 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 639
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 181 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 625
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 177 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 611
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 173 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 597
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 334 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 326 transition count 569
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 322 vertex of which 8 / 322 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 318 transition count 555
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 314 vertex of which 8 / 314 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 310 transition count 541
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 302 transition count 527
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 149 edges and 298 vertex of which 8 / 298 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 294 transition count 513
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 145 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 286 transition count 499
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 278 transition count 485
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 274 vertex of which 8 / 274 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 270 transition count 471
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 266 vertex of which 8 / 266 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 262 transition count 457
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 129 edges and 258 vertex of which 8 / 258 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 254 transition count 443
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 250 vertex of which 8 / 250 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 246 transition count 429
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 242 vertex of which 8 / 242 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 238 transition count 415
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 117 edges and 234 vertex of which 6 / 234 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 18 rules applied. Total rules applied 395 place count 231 transition count 402
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 114 edges and 228 vertex of which 6 / 228 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 22 with 16 rules applied. Total rules applied 411 place count 225 transition count 390
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 112 edges and 222 vertex of which 8 / 222 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 15 rules applied. Total rules applied 426 place count 218 transition count 379
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 109 edges and 214 vertex of which 10 / 214 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 445 place count 209 transition count 365
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (trivial) has 103 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 22 rules applied. Total rules applied 467 place count 201 transition count 348
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 99 edges and 197 vertex of which 8 / 197 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 486 place count 193 transition count 334
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 189 vertex of which 8 / 189 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 505 place count 185 transition count 320
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 181 vertex of which 8 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 524 place count 177 transition count 306
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 173 vertex of which 8 / 173 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 543 place count 169 transition count 292
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 165 vertex of which 8 / 165 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 562 place count 161 transition count 278
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 79 edges and 157 vertex of which 8 / 157 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 581 place count 153 transition count 264
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 149 vertex of which 8 / 149 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 600 place count 145 transition count 250
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 141 vertex of which 8 / 141 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 619 place count 137 transition count 236
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 67 edges and 133 vertex of which 8 / 133 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 638 place count 129 transition count 222
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 63 edges and 125 vertex of which 8 / 125 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 657 place count 121 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 117 vertex of which 8 / 117 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 676 place count 113 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 55 edges and 109 vertex of which 8 / 109 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 695 place count 105 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 51 edges and 101 vertex of which 8 / 101 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 714 place count 97 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 47 edges and 93 vertex of which 8 / 93 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 733 place count 89 transition count 152
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 43 edges and 85 vertex of which 8 / 85 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 752 place count 81 transition count 138
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 39 edges and 77 vertex of which 8 / 77 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 771 place count 73 transition count 124
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 34 edges and 70 vertex of which 6 / 70 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 42 with 17 rules applied. Total rules applied 788 place count 67 transition count 111
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 31 edges and 64 vertex of which 6 / 64 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 43 with 16 rules applied. Total rules applied 804 place count 61 transition count 99
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 29 edges and 58 vertex of which 6 / 58 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 44 with 15 rules applied. Total rules applied 819 place count 55 transition count 88
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 27 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 15 rules applied. Total rules applied 834 place count 48 transition count 77
Discarding 32 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Remove reverse transitions (loop back) rule discarded transition t33.t30.t31 and 32 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 46 with 11 rules applied. Total rules applied 845 place count 12 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 47 with 2 Pre rules applied. Total rules applied 845 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 6 rules applied. Total rules applied 851 place count 8 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 47 with 3 rules applied. Total rules applied 854 place count 6 transition count 8
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 7 edges and 6 vertex of which 4 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 47 with 3 rules applied. Total rules applied 857 place count 4 transition count 5
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 48 with 1 rules applied. Total rules applied 858 place count 4 transition count 4
Applied a total of 858 rules in 55 ms. Remains 4 /402 variables (removed 398) and now considering 4/696 (removed 692) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-18 21:33:25] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-18 21:33:25] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 21:33:25] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:33:25] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 21:33:25] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2 reset in 641 ms.
Product exploration explored 100000 steps with 3 reset in 651 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Performed 547 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1953 transition count 1953
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 547 place count 1953 transition count 2155
Deduced a syphon composed of 749 places in 3 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 749 place count 1953 transition count 2155
Performed 600 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1349 places in 3 ms
Iterating global reduction 1 with 600 rules applied. Total rules applied 1349 place count 1953 transition count 2155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1350 place count 1953 transition count 2154
Renaming transitions due to excessive name length > 1024 char.
Discarding 398 places :
Symmetric choice reduction at 2 with 398 rule applications. Total rules 1748 place count 1555 transition count 1756
Deduced a syphon composed of 951 places in 2 ms
Iterating global reduction 2 with 398 rules applied. Total rules applied 2146 place count 1555 transition count 1756
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 952 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2147 place count 1555 transition count 1756
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2149 place count 1553 transition count 1754
Deduced a syphon composed of 950 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2151 place count 1553 transition count 1754
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -729
Deduced a syphon composed of 1051 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2252 place count 1553 transition count 2483
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2354 place count 1451 transition count 2279
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2456 place count 1451 transition count 2279
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -698
Deduced a syphon composed of 1047 places in 1 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 2554 place count 1451 transition count 2977
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 2653 place count 1352 transition count 2779
Deduced a syphon composed of 948 places in 0 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 2752 place count 1352 transition count 2779
Deduced a syphon composed of 948 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2755 place count 1352 transition count 2776
Deduced a syphon composed of 948 places in 1 ms
Applied a total of 2755 rules in 881 ms. Remains 1352 /1953 variables (removed 601) and now considering 2776/1953 (removed -823) transitions.
[2023-03-18 21:33:29] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 2776 rows 1352 cols
[2023-03-18 21:33:29] [INFO ] Computed 201 place invariants in 29 ms
[2023-03-18 21:33:30] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1352/1953 places, 2776/1953 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2162 ms. Remains : 1352/1953 places, 2776/1953 transitions.
Built C files in :
/tmp/ltsmin1489372196487423987
[2023-03-18 21:33:30] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1489372196487423987
Running compilation step : cd /tmp/ltsmin1489372196487423987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1489372196487423987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1489372196487423987;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1953 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1953/1953 places, 1953/1953 transitions.
Applied a total of 0 rules in 157 ms. Remains 1953 /1953 variables (removed 0) and now considering 1953/1953 (removed 0) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-18 21:33:33] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-18 21:33:34] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-18 21:33:34] [INFO ] Invariant cache hit.
[2023-03-18 21:33:35] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
[2023-03-18 21:33:35] [INFO ] Invariant cache hit.
[2023-03-18 21:33:36] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3234 ms. Remains : 1953/1953 places, 1953/1953 transitions.
Built C files in :
/tmp/ltsmin16000763904928874302
[2023-03-18 21:33:36] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16000763904928874302
Running compilation step : cd /tmp/ltsmin16000763904928874302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16000763904928874302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16000763904928874302;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 21:33:39] [INFO ] Flatten gal took : 35 ms
[2023-03-18 21:33:39] [INFO ] Flatten gal took : 70 ms
[2023-03-18 21:33:39] [INFO ] Time to serialize gal into /tmp/LTL10670667251602402776.gal : 16 ms
[2023-03-18 21:33:39] [INFO ] Time to serialize properties into /tmp/LTL13824427388711082821.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10670667251602402776.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7277340946720666340.hoa' '-atoms' '/tmp/LTL13824427388711082821.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13824427388711082821.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7277340946720666340.hoa
Detected timeout of ITS tools.
[2023-03-18 21:33:55] [INFO ] Flatten gal took : 29 ms
[2023-03-18 21:33:55] [INFO ] Flatten gal took : 28 ms
[2023-03-18 21:33:55] [INFO ] Time to serialize gal into /tmp/LTL4834456848732363017.gal : 7 ms
[2023-03-18 21:33:55] [INFO ] Time to serialize properties into /tmp/LTL14479296433318599058.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4834456848732363017.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14479296433318599058.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p1430==1)")||(G(F("(p435==0)")))))))
Formula 0 simplified : XG(!"(p1430==1)" & FG!"(p435==0)")
Detected timeout of ITS tools.
[2023-03-18 21:34:10] [INFO ] Flatten gal took : 48 ms
[2023-03-18 21:34:10] [INFO ] Applying decomposition
[2023-03-18 21:34:10] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13401234391260145355.txt' '-o' '/tmp/graph13401234391260145355.bin' '-w' '/tmp/graph13401234391260145355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13401234391260145355.bin' '-l' '-1' '-v' '-w' '/tmp/graph13401234391260145355.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:34:10] [INFO ] Decomposing Gal with order
[2023-03-18 21:34:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:34:10] [INFO ] Removed a total of 499 redundant transitions.
[2023-03-18 21:34:10] [INFO ] Flatten gal took : 134 ms
[2023-03-18 21:34:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2023-03-18 21:34:10] [INFO ] Time to serialize gal into /tmp/LTL18016298392310506105.gal : 19 ms
[2023-03-18 21:34:10] [INFO ] Time to serialize properties into /tmp/LTL4513557075936887159.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18016298392310506105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4513557075936887159.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i31.i1.u447.p1430==1)")||(G(F("(i10.i9.u143.p435==0)")))))))
Formula 0 simplified : XG(!"(i31.i1.u447.p1430==1)" & FG!"(i10.i9.u143.p435==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18036324409633255289
[2023-03-18 21:34:25] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18036324409633255289
Running compilation step : cd /tmp/ltsmin18036324409633255289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18036324409633255289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18036324409633255289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVt-PT-050B-LTLFireability-15 finished in 127082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(p1&&X(G(p2))))))'
Found a Lengthening insensitive property : ShieldRVt-PT-050B-LTLFireability-07
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1962 transition count 1415
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1415 transition count 1415
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1094 place count 1415 transition count 1019
Deduced a syphon composed of 396 places in 2 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 1886 place count 1019 transition count 1019
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1895 place count 1010 transition count 1010
Iterating global reduction 2 with 9 rules applied. Total rules applied 1904 place count 1010 transition count 1010
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1904 place count 1010 transition count 1002
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1920 place count 1002 transition count 1002
Performed 446 Post agglomeration using F-continuation condition.Transition count delta: 446
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2812 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2813 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2815 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3017 place count 454 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3113 place count 406 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3115 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3116 place count 403 transition count 699
Applied a total of 3116 rules in 316 ms. Remains 403 /1963 variables (removed 1560) and now considering 699/1963 (removed 1264) transitions.
// Phase 1: matrix 699 rows 403 cols
[2023-03-18 21:34:29] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-18 21:34:30] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-18 21:34:30] [INFO ] Invariant cache hit.
[2023-03-18 21:34:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:34:30] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2023-03-18 21:34:30] [INFO ] Invariant cache hit.
[2023-03-18 21:34:30] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 403/1963 places, 699/1963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1388 ms. Remains : 403/1963 places, 699/1963 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s194 0), p0:(EQ s194 1), p2:(EQ s162 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 634 steps with 2 reset in 2 ms.
Treatment of property ShieldRVt-PT-050B-LTLFireability-07 finished in 1691 ms.
FORMULA ShieldRVt-PT-050B-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Found a Shortening insensitive property : ShieldRVt-PT-050B-LTLFireability-15
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 548 transitions
Trivial Post-agglo rules discarded 548 transitions
Performed 548 trivial Post agglomeration. Transition count delta: 548
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1962 transition count 1414
Reduce places removed 548 places and 0 transitions.
Iterating post reduction 1 with 548 rules applied. Total rules applied 1096 place count 1414 transition count 1414
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1096 place count 1414 transition count 1019
Deduced a syphon composed of 395 places in 1 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 1886 place count 1019 transition count 1019
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1894 place count 1011 transition count 1011
Iterating global reduction 2 with 8 rules applied. Total rules applied 1902 place count 1011 transition count 1011
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1902 place count 1011 transition count 1004
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1916 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2814 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2815 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2817 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3019 place count 453 transition count 651
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3115 place count 405 transition count 699
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3117 place count 403 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3118 place count 402 transition count 697
Applied a total of 3118 rules in 241 ms. Remains 402 /1963 variables (removed 1561) and now considering 697/1963 (removed 1266) transitions.
// Phase 1: matrix 697 rows 402 cols
[2023-03-18 21:34:31] [INFO ] Computed 200 place invariants in 1 ms
[2023-03-18 21:34:31] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-18 21:34:31] [INFO ] Invariant cache hit.
[2023-03-18 21:34:31] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2023-03-18 21:34:31] [INFO ] Invariant cache hit.
[2023-03-18 21:34:31] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 402/1963 places, 697/1963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1057 ms. Remains : 402/1963 places, 697/1963 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s227 1), p1:(EQ s64 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25 reset in 627 ms.
Product exploration explored 100000 steps with 32 reset in 770 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Finished probabilistic random walk after 29962 steps, run visited all 2 properties in 316 ms. (steps per millisecond=94 )
Probabilistic random walk after 29962 steps, saw 19010 distinct states, run finished after 316 ms. (steps per millisecond=94 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 697/697 transitions.
Applied a total of 0 rules in 10 ms. Remains 402 /402 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-18 21:34:34] [INFO ] Invariant cache hit.
[2023-03-18 21:34:35] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-18 21:34:35] [INFO ] Invariant cache hit.
[2023-03-18 21:34:35] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2023-03-18 21:34:35] [INFO ] Invariant cache hit.
[2023-03-18 21:34:36] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1188 ms. Remains : 402/402 places, 697/697 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Finished probabilistic random walk after 29962 steps, run visited all 2 properties in 337 ms. (steps per millisecond=88 )
Probabilistic random walk after 29962 steps, saw 19010 distinct states, run finished after 338 ms. (steps per millisecond=88 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23 reset in 561 ms.
Product exploration explored 100000 steps with 26 reset in 601 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 697/697 transitions.
Applied a total of 0 rules in 21 ms. Remains 402 /402 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-18 21:34:39] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 21:34:39] [INFO ] Invariant cache hit.
[2023-03-18 21:34:39] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 513 ms. Remains : 402/402 places, 697/697 transitions.
Built C files in :
/tmp/ltsmin16806536858153204578
[2023-03-18 21:34:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16806536858153204578
Running compilation step : cd /tmp/ltsmin16806536858153204578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1136 ms.
Running link step : cd /tmp/ltsmin16806536858153204578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16806536858153204578;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased720363542814992567.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 697/697 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-18 21:34:54] [INFO ] Invariant cache hit.
[2023-03-18 21:34:54] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-18 21:34:54] [INFO ] Invariant cache hit.
[2023-03-18 21:34:55] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-18 21:34:55] [INFO ] Invariant cache hit.
[2023-03-18 21:34:55] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 990 ms. Remains : 402/402 places, 697/697 transitions.
Built C files in :
/tmp/ltsmin14490394205665962881
[2023-03-18 21:34:55] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14490394205665962881
Running compilation step : cd /tmp/ltsmin14490394205665962881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 980 ms.
Running link step : cd /tmp/ltsmin14490394205665962881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14490394205665962881;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12432421679080280750.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:35:10] [INFO ] Flatten gal took : 24 ms
[2023-03-18 21:35:10] [INFO ] Flatten gal took : 22 ms
[2023-03-18 21:35:10] [INFO ] Time to serialize gal into /tmp/LTL7852979261957659131.gal : 4 ms
[2023-03-18 21:35:10] [INFO ] Time to serialize properties into /tmp/LTL10802389116706257289.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7852979261957659131.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6311445058182576863.hoa' '-atoms' '/tmp/LTL10802389116706257289.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10802389116706257289.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6311445058182576863.hoa
Reverse transition relation is NOT exact ! Due to transitions t1.t67, t1.t68, Intersection with reachable at each step enabled. (destroyed/reverse/interse...177
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:35:26] [INFO ] Flatten gal took : 34 ms
[2023-03-18 21:35:26] [INFO ] Flatten gal took : 30 ms
[2023-03-18 21:35:26] [INFO ] Time to serialize gal into /tmp/LTL2522902214967160751.gal : 5 ms
[2023-03-18 21:35:26] [INFO ] Time to serialize properties into /tmp/LTL12232409451786120274.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2522902214967160751.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12232409451786120274.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p1430==1)")||(G(F("(p435==0)")))))))
Formula 0 simplified : XG(!"(p1430==1)" & FG!"(p435==0)")
Reverse transition relation is NOT exact ! Due to transitions t1.t67, t1.t68, Intersection with reachable at each step enabled. (destroyed/reverse/interse...177
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:35:41] [INFO ] Flatten gal took : 18 ms
[2023-03-18 21:35:41] [INFO ] Applying decomposition
[2023-03-18 21:35:41] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7788133569434723452.txt' '-o' '/tmp/graph7788133569434723452.bin' '-w' '/tmp/graph7788133569434723452.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7788133569434723452.bin' '-l' '-1' '-v' '-w' '/tmp/graph7788133569434723452.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:35:41] [INFO ] Decomposing Gal with order
[2023-03-18 21:35:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:35:41] [INFO ] Removed a total of 1368 redundant transitions.
[2023-03-18 21:35:41] [INFO ] Flatten gal took : 31 ms
[2023-03-18 21:35:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 618 labels/synchronizations in 9 ms.
[2023-03-18 21:35:41] [INFO ] Time to serialize gal into /tmp/LTL15559356660986554734.gal : 3 ms
[2023-03-18 21:35:41] [INFO ] Time to serialize properties into /tmp/LTL1952362593856785131.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15559356660986554734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1952362593856785131.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i8.u113.p1430==1)")||(G(F("(i2.u32.p435==0)")))))))
Formula 0 simplified : XG(!"(i8.u113.p1430==1)" & FG!"(i2.u32.p435==0)")
Reverse transition relation is NOT exact ! Due to transitions i2.u32.t1.t67, i2.u32.t1.t68, Intersection with reachable at each step enabled. (destroyed/r...191
Computing Next relation with stutter on 3.26648e+38 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
35 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.40404,41472,1,0,58028,123,2830,139131,139,226,41015
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldRVt-PT-050B-LTLFireability-15 finished in 71014 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-18 21:35:41] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14960334884962636105
[2023-03-18 21:35:41] [INFO ] Too many transitions (1963) to apply POR reductions. Disabling POR matrices.
[2023-03-18 21:35:41] [INFO ] Applying decomposition
[2023-03-18 21:35:41] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14960334884962636105
Running compilation step : cd /tmp/ltsmin14960334884962636105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 21:35:41] [INFO ] Flatten gal took : 104 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9311635219755476770.txt' '-o' '/tmp/graph9311635219755476770.bin' '-w' '/tmp/graph9311635219755476770.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9311635219755476770.bin' '-l' '-1' '-v' '-w' '/tmp/graph9311635219755476770.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:35:42] [INFO ] Decomposing Gal with order
[2023-03-18 21:35:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:35:42] [INFO ] Removed a total of 486 redundant transitions.
[2023-03-18 21:35:42] [INFO ] Flatten gal took : 167 ms
[2023-03-18 21:35:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2023-03-18 21:35:42] [INFO ] Time to serialize gal into /tmp/LTLFireability1488126641883518702.gal : 39 ms
[2023-03-18 21:35:42] [INFO ] Time to serialize properties into /tmp/LTLFireability2037077183767561505.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1488126641883518702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2037077183767561505.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((G("(i2.i1.u296.p947==0)"))||(F("((i18.i1.u281.p900==1)&&(i2.i1.u296.p947==0))"))))
Formula 0 simplified : F!"(i2.i1.u296.p947==0)" & G!"((i18.i1.u281.p900==1)&&(i2.i1.u296.p947==0))"
Compilation finished in 3998 ms.
Running link step : cd /tmp/ltsmin14960334884962636105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin14960334884962636105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 21:58:43] [INFO ] Applying decomposition
[2023-03-18 21:58:43] [INFO ] Flatten gal took : 142 ms
[2023-03-18 21:58:43] [INFO ] Decomposing Gal with order
[2023-03-18 21:58:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:58:43] [INFO ] Removed a total of 144 redundant transitions.
[2023-03-18 21:58:43] [INFO ] Flatten gal took : 137 ms
[2023-03-18 21:58:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-18 21:58:44] [INFO ] Time to serialize gal into /tmp/LTLFireability9207038571302288894.gal : 71 ms
[2023-03-18 21:58:44] [INFO ] Time to serialize properties into /tmp/LTLFireability13127776421244331103.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9207038571302288894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13127776421244331103.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u180.p947==0)"))||(F("((...397
Formula 0 simplified : F!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u180.p947==0)" & G!"((i0.i...389
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin14960334884962636105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14960334884962636105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp5==true)||[](<>((LTLAPp6==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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.046: LTL layer: formula: X(<>(((LTLAPp5==true)||[](<>((LTLAPp6==true))))))
pins2lts-mc-linux64( 2/ 8), 0.048: "X(<>(((LTLAPp5==true)||[](<>((LTLAPp6==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.051: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.077: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.746: DFS-FIFO for weak LTL, using special progress label 1971
pins2lts-mc-linux64( 0/ 8), 0.746: There are 1972 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.746: State length is 1964, there are 1967 groups
pins2lts-mc-linux64( 0/ 8), 0.746: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.746: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.746: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.746: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.898: ~1 levels ~960 states ~5192 transitions
pins2lts-mc-linux64( 0/ 8), 1.053: ~1 levels ~1920 states ~10672 transitions
pins2lts-mc-linux64( 0/ 8), 1.330: ~1 levels ~3840 states ~23368 transitions
pins2lts-mc-linux64( 4/ 8), 1.881: ~1 levels ~7680 states ~61168 transitions
pins2lts-mc-linux64( 7/ 8), 2.988: ~1 levels ~15360 states ~111568 transitions
pins2lts-mc-linux64( 0/ 8), 5.023: ~1 levels ~30720 states ~236352 transitions
pins2lts-mc-linux64( 5/ 8), 9.003: ~1 levels ~61440 states ~570232 transitions
pins2lts-mc-linux64( 0/ 8), 17.002: ~1 levels ~122880 states ~1067032 transitions
pins2lts-mc-linux64( 7/ 8), 32.297: ~1 levels ~245760 states ~2213344 transitions
pins2lts-mc-linux64( 7/ 8), 63.053: ~1 levels ~491520 states ~4855664 transitions
pins2lts-mc-linux64( 7/ 8), 124.119: ~1 levels ~983040 states ~9859888 transitions
pins2lts-mc-linux64( 1/ 8), 248.930: ~1 levels ~1966080 states ~20584504 transitions
pins2lts-mc-linux64( 1/ 8), 501.671: ~1 levels ~3932160 states ~42626728 transitions
pins2lts-mc-linux64( 6/ 8), 898.794: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 898.930:
pins2lts-mc-linux64( 0/ 8), 898.930: mean standard work distribution: 1.4% (states) 4.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 898.930:
pins2lts-mc-linux64( 0/ 8), 898.930: Explored 6748113 states 82988912 transitions, fanout: 12.298
pins2lts-mc-linux64( 0/ 8), 898.930: Total exploration time 898.170 sec (898.020 sec minimum, 898.088 sec on average)
pins2lts-mc-linux64( 0/ 8), 898.930: States per second: 7513, Transitions per second: 92398
pins2lts-mc-linux64( 0/ 8), 898.930:
pins2lts-mc-linux64( 0/ 8), 898.930: Progress states detected: 16462251
pins2lts-mc-linux64( 0/ 8), 898.930: Redundant explorations: -59.0087
pins2lts-mc-linux64( 0/ 8), 898.930:
pins2lts-mc-linux64( 0/ 8), 898.930: Queue width: 8B, total height: 15237526, memory: 116.25MB
pins2lts-mc-linux64( 0/ 8), 898.930: Tree memory: 381.6MB, 24.3 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 898.931: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 898.931: Stored 2205 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 898.931: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 898.931: Est. total memory use: 497.8MB (~1140.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14960334884962636105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp5==true)||[](<>((LTLAPp6==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14960334884962636105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp5==true)||[](<>((LTLAPp6==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 22:21:44] [INFO ] Flatten gal took : 63 ms
[2023-03-18 22:21:44] [INFO ] Input system was already deterministic with 1963 transitions.
[2023-03-18 22:21:44] [INFO ] Transformed 1963 places.
[2023-03-18 22:21:44] [INFO ] Transformed 1963 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 22:21:45] [INFO ] Time to serialize gal into /tmp/LTLFireability14370324047580220343.gal : 13 ms
[2023-03-18 22:21:45] [INFO ] Time to serialize properties into /tmp/LTLFireability5724949035849484485.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14370324047580220343.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5724949035849484485.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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