Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 569K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716986917353

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 12:48:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:48:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:48:39] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2024-05-29 12:48:39] [INFO ] Transformed 2343 places.
[2024-05-29 12:48:39] [INFO ] Transformed 2133 transitions.
[2024-05-29 12:48:39] [INFO ] Found NUPN structural information;
[2024-05-29 12:48:39] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 322 places :
Symmetric choice reduction at 0 with 322 rule applications. Total rules 322 place count 2021 transition count 1811
Iterating global reduction 0 with 322 rules applied. Total rules applied 644 place count 2021 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 645 place count 2020 transition count 1810
Iterating global reduction 0 with 1 rules applied. Total rules applied 646 place count 2020 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 647 place count 2019 transition count 1809
Iterating global reduction 0 with 1 rules applied. Total rules applied 648 place count 2019 transition count 1809
Applied a total of 648 rules in 808 ms. Remains 2019 /2343 variables (removed 324) and now considering 1809/2133 (removed 324) transitions.
// Phase 1: matrix 1809 rows 2019 cols
[2024-05-29 12:48:40] [INFO ] Computed 331 invariants in 37 ms
[2024-05-29 12:48:41] [INFO ] Implicit Places using invariants in 866 ms returned []
[2024-05-29 12:48:41] [INFO ] Invariant cache hit.
[2024-05-29 12:48:43] [INFO ] Implicit Places using invariants and state equation in 1823 ms returned []
Implicit Place search using SMT with State Equation took 2814 ms to find 0 implicit places.
[2024-05-29 12:48:43] [INFO ] Invariant cache hit.
[2024-05-29 12:48:44] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2019/2343 places, 1809/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4802 ms. Remains : 2019/2343 places, 1809/2133 transitions.
Support contains 31 out of 2019 places after structural reductions.
[2024-05-29 12:48:44] [INFO ] Flatten gal took : 135 ms
[2024-05-29 12:48:44] [INFO ] Flatten gal took : 75 ms
[2024-05-29 12:48:45] [INFO ] Input system was already deterministic with 1809 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-29 12:48:45] [INFO ] Invariant cache hit.
[2024-05-29 12:48:46] [INFO ] [Real]Absence check using 331 positive place invariants in 123 ms returned sat
[2024-05-29 12:48:46] [INFO ] After 667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 12:48:47] [INFO ] [Nat]Absence check using 331 positive place invariants in 120 ms returned sat
[2024-05-29 12:48:48] [INFO ] After 1263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 12:48:49] [INFO ] Deduced a trap composed of 18 places in 409 ms of which 7 ms to minimize.
[2024-05-29 12:48:49] [INFO ] Deduced a trap composed of 17 places in 384 ms of which 1 ms to minimize.
[2024-05-29 12:48:49] [INFO ] Deduced a trap composed of 25 places in 361 ms of which 1 ms to minimize.
[2024-05-29 12:48:50] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 2 ms to minimize.
[2024-05-29 12:48:50] [INFO ] Deduced a trap composed of 22 places in 351 ms of which 2 ms to minimize.
[2024-05-29 12:48:51] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 2 ms to minimize.
[2024-05-29 12:48:51] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 1 ms to minimize.
[2024-05-29 12:48:52] [INFO ] Deduced a trap composed of 30 places in 339 ms of which 1 ms to minimize.
[2024-05-29 12:48:52] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 1 ms to minimize.
[2024-05-29 12:48:52] [INFO ] Deduced a trap composed of 34 places in 319 ms of which 1 ms to minimize.
[2024-05-29 12:48:53] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 1 ms to minimize.
[2024-05-29 12:48:53] [INFO ] Deduced a trap composed of 30 places in 299 ms of which 1 ms to minimize.
[2024-05-29 12:48:53] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 1 ms to minimize.
[2024-05-29 12:48:54] [INFO ] Deduced a trap composed of 18 places in 321 ms of which 1 ms to minimize.
[2024-05-29 12:48:54] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 1 ms to minimize.
[2024-05-29 12:48:55] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 1 ms to minimize.
[2024-05-29 12:48:55] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 1 ms to minimize.
[2024-05-29 12:48:55] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 1 ms to minimize.
[2024-05-29 12:48:56] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 1 ms to minimize.
[2024-05-29 12:48:56] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 1 ms to minimize.
[2024-05-29 12:48:56] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 0 ms to minimize.
[2024-05-29 12:48:57] [INFO ] Deduced a trap composed of 23 places in 252 ms of which 1 ms to minimize.
[2024-05-29 12:48:57] [INFO ] Deduced a trap composed of 22 places in 518 ms of which 1 ms to minimize.
[2024-05-29 12:48:57] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 0 ms to minimize.
[2024-05-29 12:48:58] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 1 ms to minimize.
[2024-05-29 12:48:58] [INFO ] Deduced a trap composed of 28 places in 383 ms of which 1 ms to minimize.
[2024-05-29 12:48:58] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 1 ms to minimize.
[2024-05-29 12:48:59] [INFO ] Deduced a trap composed of 38 places in 219 ms of which 1 ms to minimize.
[2024-05-29 12:48:59] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 1 ms to minimize.
[2024-05-29 12:48:59] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 1 ms to minimize.
[2024-05-29 12:49:00] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 1 ms to minimize.
[2024-05-29 12:49:00] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 1 ms to minimize.
[2024-05-29 12:49:00] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 1 ms to minimize.
[2024-05-29 12:49:00] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 3 ms to minimize.
[2024-05-29 12:49:01] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 0 ms to minimize.
[2024-05-29 12:49:01] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 0 ms to minimize.
[2024-05-29 12:49:01] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 0 ms to minimize.
[2024-05-29 12:49:01] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 1 ms to minimize.
[2024-05-29 12:49:02] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 1 ms to minimize.
[2024-05-29 12:49:02] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 1 ms to minimize.
[2024-05-29 12:49:02] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 1 ms to minimize.
[2024-05-29 12:49:02] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 0 ms to minimize.
[2024-05-29 12:49:03] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 1 ms to minimize.
[2024-05-29 12:49:03] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
[2024-05-29 12:49:03] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 5 ms to minimize.
[2024-05-29 12:49:03] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 1 ms to minimize.
[2024-05-29 12:49:03] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 1 ms to minimize.
[2024-05-29 12:49:03] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 0 ms to minimize.
[2024-05-29 12:49:04] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 1 ms to minimize.
[2024-05-29 12:49:04] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 15632 ms
[2024-05-29 12:49:04] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2024-05-29 12:49:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-05-29 12:49:05] [INFO ] After 17841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 451 ms.
[2024-05-29 12:49:05] [INFO ] After 19133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 440 ms.
Support contains 13 out of 2019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Drop transitions removed 413 transitions
Trivial Post-agglo rules discarded 413 transitions
Performed 413 trivial Post agglomeration. Transition count delta: 413
Iterating post reduction 0 with 413 rules applied. Total rules applied 413 place count 2019 transition count 1396
Reduce places removed 413 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 415 rules applied. Total rules applied 828 place count 1606 transition count 1394
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 830 place count 1604 transition count 1394
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 830 place count 1604 transition count 1160
Deduced a syphon composed of 234 places in 2 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 468 rules applied. Total rules applied 1298 place count 1370 transition count 1160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1303 place count 1365 transition count 1155
Iterating global reduction 3 with 5 rules applied. Total rules applied 1308 place count 1365 transition count 1155
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1308 place count 1365 transition count 1152
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1314 place count 1362 transition count 1152
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 2330 place count 854 transition count 644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2331 place count 854 transition count 643
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2333 place count 853 transition count 642
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 2503 place count 768 transition count 642
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 4 with 88 rules applied. Total rules applied 2591 place count 768 transition count 642
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2592 place count 767 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2593 place count 766 transition count 641
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2593 place count 766 transition count 639
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2597 place count 764 transition count 639
Applied a total of 2597 rules in 473 ms. Remains 764 /2019 variables (removed 1255) and now considering 639/1809 (removed 1170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 764/2019 places, 639/1809 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) 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
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 54 ms. (steps per millisecond=185 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 131152 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131152 steps, saw 111883 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 639 rows 764 cols
[2024-05-29 12:49:10] [INFO ] Computed 330 invariants in 12 ms
[2024-05-29 12:49:10] [INFO ] [Real]Absence check using 330 positive place invariants in 44 ms returned sat
[2024-05-29 12:49:10] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 12:49:10] [INFO ] [Nat]Absence check using 330 positive place invariants in 53 ms returned sat
[2024-05-29 12:49:11] [INFO ] After 412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 12:49:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 12:49:11] [INFO ] After 178ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-29 12:49:11] [INFO ] After 494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 173 ms.
[2024-05-29 12:49:11] [INFO ] After 1398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 13 out of 764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 639/639 transitions.
Applied a total of 0 rules in 32 ms. Remains 764 /764 variables (removed 0) and now considering 639/639 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 764/764 places, 639/639 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 764/764 places, 639/639 transitions.
Applied a total of 0 rules in 38 ms. Remains 764 /764 variables (removed 0) and now considering 639/639 (removed 0) transitions.
[2024-05-29 12:49:11] [INFO ] Invariant cache hit.
[2024-05-29 12:49:12] [INFO ] Implicit Places using invariants in 461 ms returned [747, 751]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 463 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 762/764 places, 639/639 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 760 transition count 637
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 760 transition count 637
Applied a total of 4 rules in 28 ms. Remains 760 /762 variables (removed 2) and now considering 637/639 (removed 2) transitions.
// Phase 1: matrix 637 rows 760 cols
[2024-05-29 12:49:12] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:49:12] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-29 12:49:12] [INFO ] Invariant cache hit.
[2024-05-29 12:49:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:49:13] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 760/764 places, 637/639 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1702 ms. Remains : 760/764 places, 637/639 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) 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 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) 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 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 12:49:14] [INFO ] Invariant cache hit.
[2024-05-29 12:49:14] [INFO ] [Real]Absence check using 328 positive place invariants in 52 ms returned sat
[2024-05-29 12:49:14] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 12:49:14] [INFO ] [Nat]Absence check using 328 positive place invariants in 48 ms returned sat
[2024-05-29 12:49:14] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 12:49:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:49:15] [INFO ] After 148ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 12:49:15] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2024-05-29 12:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-05-29 12:49:15] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 149 ms.
[2024-05-29 12:49:15] [INFO ] After 1353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 87 ms.
Support contains 11 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 637/637 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 760 transition count 635
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 758 transition count 635
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 756 transition count 635
Applied a total of 8 rules in 30 ms. Remains 756 /760 variables (removed 4) and now considering 635/637 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 756/760 places, 635/637 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 147775 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147775 steps, saw 122130 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 635 rows 756 cols
[2024-05-29 12:49:19] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:49:19] [INFO ] [Real]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 12:49:19] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 12:49:19] [INFO ] [Nat]Absence check using 328 positive place invariants in 48 ms returned sat
[2024-05-29 12:49:20] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 12:49:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:49:20] [INFO ] After 145ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 12:49:20] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 158 ms.
[2024-05-29 12:49:20] [INFO ] After 1212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 75 ms.
Support contains 11 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 635/635 transitions.
Applied a total of 0 rules in 15 ms. Remains 756 /756 variables (removed 0) and now considering 635/635 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 756/756 places, 635/635 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 635/635 transitions.
Applied a total of 0 rules in 15 ms. Remains 756 /756 variables (removed 0) and now considering 635/635 (removed 0) transitions.
[2024-05-29 12:49:20] [INFO ] Invariant cache hit.
[2024-05-29 12:49:21] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-29 12:49:21] [INFO ] Invariant cache hit.
[2024-05-29 12:49:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:49:22] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2024-05-29 12:49:22] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-29 12:49:22] [INFO ] Invariant cache hit.
[2024-05-29 12:49:22] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1592 ms. Remains : 756/756 places, 635/635 transitions.
Partial Free-agglomeration rule applied 169 times.
Drop transitions removed 169 transitions
Iterating global reduction 0 with 169 rules applied. Total rules applied 169 place count 756 transition count 635
Applied a total of 169 rules in 40 ms. Remains 756 /756 variables (removed 0) and now considering 635/635 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 635 rows 756 cols
[2024-05-29 12:49:22] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 12:49:22] [INFO ] [Real]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 12:49:22] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 12:49:22] [INFO ] [Nat]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 12:49:23] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 12:49:23] [INFO ] State equation strengthened by 163 read => feed constraints.
[2024-05-29 12:49:23] [INFO ] After 234ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 12:49:23] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2024-05-29 12:49:23] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-29 12:49:24] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2024-05-29 12:49:24] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2024-05-29 12:49:24] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2024-05-29 12:49:24] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
[2024-05-29 12:49:24] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2024-05-29 12:49:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1165 ms
[2024-05-29 12:49:25] [INFO ] After 1705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 203 ms.
[2024-05-29 12:49:25] [INFO ] After 2567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Computed a total of 482 stabilizing places and 482 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2018 transition count 1388
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1598 transition count 1388
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 840 place count 1598 transition count 1152
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1312 place count 1362 transition count 1152
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1319 place count 1355 transition count 1145
Iterating global reduction 2 with 7 rules applied. Total rules applied 1326 place count 1355 transition count 1145
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1326 place count 1355 transition count 1139
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1338 place count 1349 transition count 1139
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 0 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 2 with 1010 rules applied. Total rules applied 2348 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2349 place count 844 transition count 633
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 2351 place count 843 transition count 632
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2529 place count 754 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2531 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2532 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2532 place count 751 transition count 628
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2536 place count 749 transition count 628
Applied a total of 2536 rules in 286 ms. Remains 749 /2019 variables (removed 1270) and now considering 628/1809 (removed 1181) transitions.
// Phase 1: matrix 628 rows 749 cols
[2024-05-29 12:49:25] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 12:49:26] [INFO ] Implicit Places using invariants in 403 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 407 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 747/2019 places, 628/1809 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 626
Applied a total of 4 rules in 31 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2024-05-29 12:49:26] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:49:26] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-29 12:49:26] [INFO ] Invariant cache hit.
[2024-05-29 12:49:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 12:49:27] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 745/2019 places, 626/1809 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1830 ms. Remains : 745/2019 places, 626/1809 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-00 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:(EQ s699 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5 reset in 656 ms.
Stack based approach found an accepted trace after 326 steps with 2 reset with depth 304 and stack size 304 in 3 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-00 finished in 2761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2018 transition count 1387
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1597 transition count 1387
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 842 place count 1597 transition count 1152
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1312 place count 1362 transition count 1152
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1319 place count 1355 transition count 1145
Iterating global reduction 2 with 7 rules applied. Total rules applied 1326 place count 1355 transition count 1145
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1326 place count 1355 transition count 1140
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1336 place count 1350 transition count 1140
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 1 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 2 with 1012 rules applied. Total rules applied 2348 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2349 place count 844 transition count 633
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 2351 place count 843 transition count 632
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2527 place count 755 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 753 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 752 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2530 place count 752 transition count 628
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2534 place count 750 transition count 628
Applied a total of 2534 rules in 259 ms. Remains 750 /2019 variables (removed 1269) and now considering 628/1809 (removed 1181) transitions.
// Phase 1: matrix 628 rows 750 cols
[2024-05-29 12:49:28] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 12:49:28] [INFO ] Implicit Places using invariants in 420 ms returned [733, 737]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 424 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 748/2019 places, 628/1809 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 746 transition count 626
Applied a total of 4 rules in 28 ms. Remains 746 /748 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 746 cols
[2024-05-29 12:49:29] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:49:29] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-29 12:49:29] [INFO ] Invariant cache hit.
[2024-05-29 12:49:30] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/2019 places, 626/1809 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1826 ms. Remains : 746/2019 places, 626/1809 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-02 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:(AND (EQ s75 0) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 557 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-02 finished in 2473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G(p1))&&F(((p0 U p1)&&F(p0)))))'
Support contains 4 out of 2019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2018 transition count 1390
Reduce places removed 418 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 419 rules applied. Total rules applied 837 place count 1600 transition count 1389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 838 place count 1599 transition count 1389
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 838 place count 1599 transition count 1154
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1308 place count 1364 transition count 1154
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1316 place count 1356 transition count 1146
Iterating global reduction 3 with 8 rules applied. Total rules applied 1324 place count 1356 transition count 1146
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1324 place count 1356 transition count 1140
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1336 place count 1350 transition count 1140
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 504
Deduced a syphon composed of 504 places in 0 ms
Reduce places removed 504 places and 0 transitions.
Iterating global reduction 3 with 1008 rules applied. Total rules applied 2344 place count 846 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2345 place count 846 transition count 635
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 2347 place count 845 transition count 634
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2521 place count 758 transition count 634
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2523 place count 756 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2524 place count 755 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2524 place count 755 transition count 630
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2528 place count 753 transition count 630
Applied a total of 2528 rules in 246 ms. Remains 753 /2019 variables (removed 1266) and now considering 630/1809 (removed 1179) transitions.
// Phase 1: matrix 630 rows 753 cols
[2024-05-29 12:49:31] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 12:49:31] [INFO ] Implicit Places using invariants in 470 ms returned [736, 740]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 474 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/2019 places, 630/1809 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 749 transition count 628
Applied a total of 4 rules in 20 ms. Remains 749 /751 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 749 cols
[2024-05-29 12:49:31] [INFO ] Computed 328 invariants in 4 ms
[2024-05-29 12:49:31] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-29 12:49:31] [INFO ] Invariant cache hit.
[2024-05-29 12:49:32] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 749/2019 places, 628/1809 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1862 ms. Remains : 749/2019 places, 628/1809 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(OR (EQ s76 0) (EQ s418 1)), p0:(OR (EQ s329 0) (EQ s530 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 528 ms.
Product exploration explored 100000 steps with 0 reset in 731 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 p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 326906 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326906 steps, saw 239724 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 12:49:37] [INFO ] Invariant cache hit.
[2024-05-29 12:49:37] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:49:37] [INFO ] [Nat]Absence check using 328 positive place invariants in 52 ms returned sat
[2024-05-29 12:49:37] [INFO ] After 264ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:49:37] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-29 12:49:37] [INFO ] After 503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 628/628 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 749 transition count 626
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 626
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 745 transition count 626
Applied a total of 8 rules in 31 ms. Remains 745 /749 variables (removed 4) and now considering 626/628 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 745/749 places, 626/628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 331931 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331931 steps, saw 243887 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 626 rows 745 cols
[2024-05-29 12:49:41] [INFO ] Computed 328 invariants in 5 ms
[2024-05-29 12:49:41] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:49:41] [INFO ] [Nat]Absence check using 328 positive place invariants in 48 ms returned sat
[2024-05-29 12:49:41] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:49:41] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-29 12:49:41] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 626/626 transitions.
Applied a total of 0 rules in 14 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 745/745 places, 626/626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 626/626 transitions.
Applied a total of 0 rules in 13 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2024-05-29 12:49:41] [INFO ] Invariant cache hit.
[2024-05-29 12:49:42] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-29 12:49:42] [INFO ] Invariant cache hit.
[2024-05-29 12:49:42] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
[2024-05-29 12:49:42] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 12:49:42] [INFO ] Invariant cache hit.
[2024-05-29 12:49:43] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1833 ms. Remains : 745/745 places, 626/626 transitions.
Partial Free-agglomeration rule applied 176 times.
Drop transitions removed 176 transitions
Iterating global reduction 0 with 176 rules applied. Total rules applied 176 place count 745 transition count 626
Applied a total of 176 rules in 33 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 626 rows 745 cols
[2024-05-29 12:49:43] [INFO ] Computed 328 invariants in 6 ms
[2024-05-29 12:49:43] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:49:43] [INFO ] [Nat]Absence check using 328 positive place invariants in 46 ms returned sat
[2024-05-29 12:49:44] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:49:44] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-29 12:49:44] [INFO ] After 513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X p1), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p1)]
Support contains 2 out of 749 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 749/749 places, 628/628 transitions.
Applied a total of 0 rules in 18 ms. Remains 749 /749 variables (removed 0) and now considering 628/628 (removed 0) transitions.
// Phase 1: matrix 628 rows 749 cols
[2024-05-29 12:49:44] [INFO ] Computed 328 invariants in 5 ms
[2024-05-29 12:49:44] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-29 12:49:44] [INFO ] Invariant cache hit.
[2024-05-29 12:49:45] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2024-05-29 12:49:45] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 12:49:45] [INFO ] Invariant cache hit.
[2024-05-29 12:49:46] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1608 ms. Remains : 749/749 places, 628/628 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 : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 339862 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339862 steps, saw 249964 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 12:49:49] [INFO ] Invariant cache hit.
[2024-05-29 12:49:49] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:49:49] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 12:49:49] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:49:49] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 12:49:49] [INFO ] After 478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 628/628 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 749 transition count 626
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 626
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 745 transition count 626
Applied a total of 8 rules in 22 ms. Remains 745 /749 variables (removed 4) and now considering 626/628 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 745/749 places, 626/628 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 336401 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 336401 steps, saw 247465 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 626 rows 745 cols
[2024-05-29 12:49:53] [INFO ] Computed 328 invariants in 5 ms
[2024-05-29 12:49:53] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:49:53] [INFO ] [Nat]Absence check using 328 positive place invariants in 53 ms returned sat
[2024-05-29 12:49:53] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:49:53] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 12:49:53] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 745 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 626/626 transitions.
Applied a total of 0 rules in 11 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 745/745 places, 626/626 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 745/745 places, 626/626 transitions.
Applied a total of 0 rules in 11 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2024-05-29 12:49:53] [INFO ] Invariant cache hit.
[2024-05-29 12:49:54] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-29 12:49:54] [INFO ] Invariant cache hit.
[2024-05-29 12:49:54] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2024-05-29 12:49:54] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 12:49:54] [INFO ] Invariant cache hit.
[2024-05-29 12:49:55] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1456 ms. Remains : 745/745 places, 626/626 transitions.
Partial Free-agglomeration rule applied 176 times.
Drop transitions removed 176 transitions
Iterating global reduction 0 with 176 rules applied. Total rules applied 176 place count 745 transition count 626
Applied a total of 176 rules in 30 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 626 rows 745 cols
[2024-05-29 12:49:55] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:49:55] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:49:55] [INFO ] [Nat]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 12:49:55] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:49:55] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-29 12:49:55] [INFO ] After 511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 534 ms.
Product exploration explored 100000 steps with 0 reset in 762 ms.
Built C files in :
/tmp/ltsmin10123211593807308093
[2024-05-29 12:49:57] [INFO ] Computing symmetric may disable matrix : 628 transitions.
[2024-05-29 12:49:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:49:57] [INFO ] Computing symmetric may enable matrix : 628 transitions.
[2024-05-29 12:49:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:49:57] [INFO ] Computing Do-Not-Accords matrix : 628 transitions.
[2024-05-29 12:49:57] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:49:57] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10123211593807308093
Running compilation step : cd /tmp/ltsmin10123211593807308093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1693 ms.
Running link step : cd /tmp/ltsmin10123211593807308093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin10123211593807308093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2607612109840806402.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 749 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 749/749 places, 628/628 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 749 transition count 626
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 626
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 745 transition count 626
Applied a total of 8 rules in 31 ms. Remains 745 /749 variables (removed 4) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2024-05-29 12:50:12] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 12:50:12] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-29 12:50:12] [INFO ] Invariant cache hit.
[2024-05-29 12:50:13] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
[2024-05-29 12:50:13] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 12:50:13] [INFO ] Invariant cache hit.
[2024-05-29 12:50:14] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 745/749 places, 626/628 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1623 ms. Remains : 745/749 places, 626/628 transitions.
Built C files in :
/tmp/ltsmin560176076199378601
[2024-05-29 12:50:14] [INFO ] Computing symmetric may disable matrix : 626 transitions.
[2024-05-29 12:50:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:50:14] [INFO ] Computing symmetric may enable matrix : 626 transitions.
[2024-05-29 12:50:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:50:14] [INFO ] Computing Do-Not-Accords matrix : 626 transitions.
[2024-05-29 12:50:14] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:50:14] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin560176076199378601
Running compilation step : cd /tmp/ltsmin560176076199378601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1506 ms.
Running link step : cd /tmp/ltsmin560176076199378601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin560176076199378601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5191127981456699499.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 12:50:29] [INFO ] Flatten gal took : 24 ms
[2024-05-29 12:50:29] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:50:29] [INFO ] Time to serialize gal into /tmp/LTL13149844668639592545.gal : 7 ms
[2024-05-29 12:50:29] [INFO ] Time to serialize properties into /tmp/LTL8220243018216562530.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13149844668639592545.gal' '-t' 'CGAL' '-hoa' '/tmp/aut286221837334801174.hoa' '-atoms' '/tmp/LTL8220243018216562530.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8220243018216562530.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut286221837334801174.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.2367e+49 deadlock states
Detected timeout of ITS tools.
[2024-05-29 12:50:44] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:50:44] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:50:44] [INFO ] Time to serialize gal into /tmp/LTL2208661971260111878.gal : 4 ms
[2024-05-29 12:50:44] [INFO ] Time to serialize properties into /tmp/LTL10544418558563668230.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2208661971260111878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10544418558563668230.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((!("((p1030==0)||(p1633==1))"))U(G("((p257==0)||(p1292==1))")))&&(F((("((p1030==0)||(p1633==1))")U("((p257==0)||(p1292==1))"))&&(F...188
Formula 0 simplified : ("((p1030==0)||(p1633==1))" R F!"((p257==0)||(p1292==1))") | G((!"((p1030==0)||(p1633==1))" R !"((p257==0)||(p1292==1))") | G!"((p10...176
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.2367e+49 deadlock states
Detected timeout of ITS tools.
[2024-05-29 12:50:59] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:50:59] [INFO ] Applying decomposition
[2024-05-29 12:50:59] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9141748975283926874.txt' '-o' '/tmp/graph9141748975283926874.bin' '-w' '/tmp/graph9141748975283926874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9141748975283926874.bin' '-l' '-1' '-v' '-w' '/tmp/graph9141748975283926874.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:51:00] [INFO ] Decomposing Gal with order
[2024-05-29 12:51:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:51:00] [INFO ] Removed a total of 183 redundant transitions.
[2024-05-29 12:51:00] [INFO ] Flatten gal took : 77 ms
[2024-05-29 12:51:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 10 ms.
[2024-05-29 12:51:00] [INFO ] Time to serialize gal into /tmp/LTL6230210683918509120.gal : 8 ms
[2024-05-29 12:51:00] [INFO ] Time to serialize properties into /tmp/LTL17373495793943844009.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6230210683918509120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17373495793943844009.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((!("((i12.u104.p1030==0)||(i20.u167.p1633==1))"))U(G("((i2.u25.p257==0)||(i16.u135.p1292==1))")))&&(F((("((i12.u104.p1030==0)||(i2...274
Formula 0 simplified : ("((i12.u104.p1030==0)||(i20.u167.p1633==1))" R F!"((i2.u25.p257==0)||(i16.u135.p1292==1))") | G((!"((i12.u104.p1030==0)||(i20.u167....262
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.2367e+49 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5004958602954503925
[2024-05-29 12:51:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5004958602954503925
Running compilation step : cd /tmp/ltsmin5004958602954503925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1022 ms.
Running link step : cd /tmp/ltsmin5004958602954503925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5004958602954503925;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((!(LTLAPp0==true) U []((LTLAPp1==true)))&&<>((((LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-04 finished in 119621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&F(p1)))||G(p2))))'
Support contains 4 out of 2019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2011 transition count 1801
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2011 transition count 1801
Applied a total of 16 rules in 162 ms. Remains 2011 /2019 variables (removed 8) and now considering 1801/1809 (removed 8) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2024-05-29 12:51:30] [INFO ] Computed 331 invariants in 12 ms
[2024-05-29 12:51:31] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-05-29 12:51:31] [INFO ] Invariant cache hit.
[2024-05-29 12:51:33] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2615 ms to find 0 implicit places.
[2024-05-29 12:51:33] [INFO ] Invariant cache hit.
[2024-05-29 12:51:34] [INFO ] Dead Transitions using invariants and state equation in 1110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2019 places, 1801/1809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3890 ms. Remains : 2011/2019 places, 1801/1809 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s373 0) (EQ s635 1)), p0:(OR (EQ s635 0) (EQ s373 1)), p2:(OR (EQ s1350 0) (EQ s1467 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]]
Product exploration explored 100000 steps with 181 reset in 439 ms.
Product exploration explored 100000 steps with 179 reset in 494 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1166 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 558 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 5) seen :3
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 12:51:37] [INFO ] Invariant cache hit.
[2024-05-29 12:51:37] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:51:38] [INFO ] [Nat]Absence check using 331 positive place invariants in 103 ms returned sat
[2024-05-29 12:51:39] [INFO ] After 889ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:51:39] [INFO ] Deduced a trap composed of 35 places in 571 ms of which 2 ms to minimize.
[2024-05-29 12:51:40] [INFO ] Deduced a trap composed of 26 places in 512 ms of which 1 ms to minimize.
[2024-05-29 12:51:40] [INFO ] Deduced a trap composed of 27 places in 562 ms of which 1 ms to minimize.
[2024-05-29 12:51:41] [INFO ] Deduced a trap composed of 23 places in 525 ms of which 2 ms to minimize.
[2024-05-29 12:51:42] [INFO ] Deduced a trap composed of 24 places in 549 ms of which 2 ms to minimize.
[2024-05-29 12:51:42] [INFO ] Deduced a trap composed of 23 places in 540 ms of which 1 ms to minimize.
[2024-05-29 12:51:43] [INFO ] Deduced a trap composed of 18 places in 531 ms of which 1 ms to minimize.
[2024-05-29 12:51:43] [INFO ] Deduced a trap composed of 27 places in 531 ms of which 2 ms to minimize.
[2024-05-29 12:51:44] [INFO ] Deduced a trap composed of 23 places in 516 ms of which 1 ms to minimize.
[2024-05-29 12:51:45] [INFO ] Deduced a trap composed of 17 places in 514 ms of which 2 ms to minimize.
[2024-05-29 12:51:45] [INFO ] Deduced a trap composed of 25 places in 504 ms of which 1 ms to minimize.
[2024-05-29 12:51:46] [INFO ] Deduced a trap composed of 20 places in 498 ms of which 1 ms to minimize.
[2024-05-29 12:51:46] [INFO ] Deduced a trap composed of 23 places in 487 ms of which 2 ms to minimize.
[2024-05-29 12:51:47] [INFO ] Deduced a trap composed of 28 places in 475 ms of which 1 ms to minimize.
[2024-05-29 12:51:47] [INFO ] Deduced a trap composed of 16 places in 448 ms of which 1 ms to minimize.
[2024-05-29 12:51:48] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 1 ms to minimize.
[2024-05-29 12:51:48] [INFO ] Deduced a trap composed of 29 places in 421 ms of which 2 ms to minimize.
[2024-05-29 12:51:49] [INFO ] Deduced a trap composed of 23 places in 418 ms of which 1 ms to minimize.
[2024-05-29 12:51:49] [INFO ] Deduced a trap composed of 17 places in 409 ms of which 1 ms to minimize.
[2024-05-29 12:51:50] [INFO ] Deduced a trap composed of 29 places in 402 ms of which 1 ms to minimize.
[2024-05-29 12:51:50] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 1 ms to minimize.
[2024-05-29 12:51:51] [INFO ] Deduced a trap composed of 30 places in 389 ms of which 1 ms to minimize.
[2024-05-29 12:51:51] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 1 ms to minimize.
[2024-05-29 12:51:52] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 1 ms to minimize.
[2024-05-29 12:51:52] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 1 ms to minimize.
[2024-05-29 12:51:52] [INFO ] Deduced a trap composed of 31 places in 379 ms of which 1 ms to minimize.
[2024-05-29 12:51:53] [INFO ] Deduced a trap composed of 32 places in 362 ms of which 2 ms to minimize.
[2024-05-29 12:51:53] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 1 ms to minimize.
[2024-05-29 12:51:54] [INFO ] Deduced a trap composed of 37 places in 331 ms of which 1 ms to minimize.
[2024-05-29 12:51:54] [INFO ] Deduced a trap composed of 36 places in 330 ms of which 1 ms to minimize.
[2024-05-29 12:51:54] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 1 ms to minimize.
[2024-05-29 12:51:55] [INFO ] Deduced a trap composed of 35 places in 334 ms of which 1 ms to minimize.
[2024-05-29 12:51:55] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 1 ms to minimize.
[2024-05-29 12:51:56] [INFO ] Deduced a trap composed of 39 places in 313 ms of which 1 ms to minimize.
[2024-05-29 12:51:56] [INFO ] Deduced a trap composed of 37 places in 313 ms of which 1 ms to minimize.
[2024-05-29 12:51:56] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 1 ms to minimize.
[2024-05-29 12:51:57] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 0 ms to minimize.
[2024-05-29 12:51:57] [INFO ] Deduced a trap composed of 41 places in 296 ms of which 1 ms to minimize.
[2024-05-29 12:51:57] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 1 ms to minimize.
[2024-05-29 12:51:58] [INFO ] Deduced a trap composed of 42 places in 301 ms of which 1 ms to minimize.
[2024-05-29 12:51:58] [INFO ] Deduced a trap composed of 46 places in 298 ms of which 0 ms to minimize.
[2024-05-29 12:51:58] [INFO ] Deduced a trap composed of 52 places in 289 ms of which 1 ms to minimize.
[2024-05-29 12:51:59] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 1 ms to minimize.
[2024-05-29 12:51:59] [INFO ] Deduced a trap composed of 45 places in 247 ms of which 1 ms to minimize.
[2024-05-29 12:51:59] [INFO ] Deduced a trap composed of 43 places in 234 ms of which 1 ms to minimize.
[2024-05-29 12:52:00] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 1 ms to minimize.
[2024-05-29 12:52:00] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21214 ms
[2024-05-29 12:52:00] [INFO ] Deduced a trap composed of 30 places in 292 ms of which 1 ms to minimize.
[2024-05-29 12:52:01] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 0 ms to minimize.
[2024-05-29 12:52:01] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 1 ms to minimize.
[2024-05-29 12:52:01] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 0 ms to minimize.
[2024-05-29 12:52:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1402 ms
[2024-05-29 12:52:01] [INFO ] After 23634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 139 ms.
[2024-05-29 12:52:01] [INFO ] After 24190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 2011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2011/2011 places, 1801/1801 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2011 transition count 1384
Reduce places removed 417 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 835 place count 1594 transition count 1383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 836 place count 1593 transition count 1383
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 836 place count 1593 transition count 1143
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1316 place count 1353 transition count 1143
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 0 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 2330 place count 846 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2331 place count 846 transition count 635
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 2333 place count 845 transition count 634
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2509 place count 757 transition count 634
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 4 with 89 rules applied. Total rules applied 2598 place count 757 transition count 634
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2599 place count 756 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2600 place count 755 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2600 place count 755 transition count 631
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2604 place count 753 transition count 631
Applied a total of 2604 rules in 237 ms. Remains 753 /2011 variables (removed 1258) and now considering 631/1801 (removed 1170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 753/2011 places, 631/1801 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :1
Finished Best-First random walk after 9423 steps, including 2 resets, run visited all 1 properties in 32 ms. (steps per millisecond=294 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F p1), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 14 factoid took 360 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 4 out of 2011 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2011/2011 places, 1801/1801 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2010 transition count 1383
Reduce places removed 417 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 835 place count 1593 transition count 1382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 836 place count 1592 transition count 1382
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 836 place count 1592 transition count 1142
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1316 place count 1352 transition count 1142
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 0 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 3 with 1010 rules applied. Total rules applied 2326 place count 847 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2327 place count 847 transition count 636
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 2329 place count 846 transition count 635
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2505 place count 758 transition count 635
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2507 place count 756 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2508 place count 755 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2508 place count 755 transition count 631
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2512 place count 753 transition count 631
Applied a total of 2512 rules in 210 ms. Remains 753 /2011 variables (removed 1258) and now considering 631/1801 (removed 1170) transitions.
// Phase 1: matrix 631 rows 753 cols
[2024-05-29 12:52:03] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 12:52:03] [INFO ] Implicit Places using invariants in 415 ms returned [736, 740]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 416 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/2011 places, 631/1801 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 749 transition count 629
Applied a total of 4 rules in 21 ms. Remains 749 /751 variables (removed 2) and now considering 629/631 (removed 2) transitions.
// Phase 1: matrix 629 rows 749 cols
[2024-05-29 12:52:03] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:52:04] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-29 12:52:04] [INFO ] Invariant cache hit.
[2024-05-29 12:52:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 12:52:04] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 749/2011 places, 629/1801 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1872 ms. Remains : 749/2011 places, 629/1801 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 320 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 12:52:05] [INFO ] Invariant cache hit.
[2024-05-29 12:52:05] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:52:05] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 12:52:06] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 12:52:06] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:52:06] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 12:52:06] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 157 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X p1), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND p1 p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 430 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 16683 reset in 671 ms.
Product exploration explored 100000 steps with 17009 reset in 781 ms.
Built C files in :
/tmp/ltsmin2019284785759881379
[2024-05-29 12:52:08] [INFO ] Computing symmetric may disable matrix : 629 transitions.
[2024-05-29 12:52:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:52:08] [INFO ] Computing symmetric may enable matrix : 629 transitions.
[2024-05-29 12:52:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:52:08] [INFO ] Computing Do-Not-Accords matrix : 629 transitions.
[2024-05-29 12:52:08] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:52:08] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2019284785759881379
Running compilation step : cd /tmp/ltsmin2019284785759881379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1532 ms.
Running link step : cd /tmp/ltsmin2019284785759881379;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2019284785759881379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12549217033695376295.hoa' '--buchi-type=spotba'
LTSmin run took 8618 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-05 finished in 48668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 2019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2018 transition count 1390
Reduce places removed 418 places and 0 transitions.
Iterating post reduction 1 with 418 rules applied. Total rules applied 836 place count 1600 transition count 1390
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 836 place count 1600 transition count 1154
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1308 place count 1364 transition count 1154
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1315 place count 1357 transition count 1147
Iterating global reduction 2 with 7 rules applied. Total rules applied 1322 place count 1357 transition count 1147
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1322 place count 1357 transition count 1142
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1332 place count 1352 transition count 1142
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 504
Deduced a syphon composed of 504 places in 1 ms
Reduce places removed 504 places and 0 transitions.
Iterating global reduction 2 with 1008 rules applied. Total rules applied 2340 place count 848 transition count 638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2341 place count 848 transition count 637
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 2343 place count 847 transition count 636
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2521 place count 758 transition count 636
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2523 place count 756 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2524 place count 755 transition count 634
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2524 place count 755 transition count 632
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2528 place count 753 transition count 632
Applied a total of 2528 rules in 263 ms. Remains 753 /2019 variables (removed 1266) and now considering 632/1809 (removed 1177) transitions.
// Phase 1: matrix 632 rows 753 cols
[2024-05-29 12:52:19] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 12:52:19] [INFO ] Implicit Places using invariants in 401 ms returned [736, 740]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 402 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/2019 places, 632/1809 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 749 transition count 630
Applied a total of 4 rules in 19 ms. Remains 749 /751 variables (removed 2) and now considering 630/632 (removed 2) transitions.
// Phase 1: matrix 630 rows 749 cols
[2024-05-29 12:52:19] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 12:52:20] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-29 12:52:20] [INFO ] Invariant cache hit.
[2024-05-29 12:52:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 12:52:21] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 749/2019 places, 630/1809 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1972 ms. Remains : 749/2019 places, 630/1809 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-07 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s272 0) (EQ s675 1)), p1:(AND (EQ s126 0) (EQ s728 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2285 reset in 495 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-07 finished in 2589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2018 transition count 1386
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1596 transition count 1386
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 844 place count 1596 transition count 1150
Deduced a syphon composed of 236 places in 3 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1316 place count 1360 transition count 1150
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1323 place count 1353 transition count 1143
Iterating global reduction 2 with 7 rules applied. Total rules applied 1330 place count 1353 transition count 1143
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1330 place count 1353 transition count 1138
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1340 place count 1348 transition count 1138
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 503
Deduced a syphon composed of 503 places in 1 ms
Reduce places removed 503 places and 0 transitions.
Iterating global reduction 2 with 1006 rules applied. Total rules applied 2346 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2347 place count 845 transition count 634
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 2349 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2527 place count 755 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 753 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 752 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2530 place count 752 transition count 629
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2534 place count 750 transition count 629
Applied a total of 2534 rules in 234 ms. Remains 750 /2019 variables (removed 1269) and now considering 629/1809 (removed 1180) transitions.
// Phase 1: matrix 629 rows 750 cols
[2024-05-29 12:52:21] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 12:52:22] [INFO ] Implicit Places using invariants in 449 ms returned [733, 737]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 450 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 748/2019 places, 629/1809 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 746 transition count 627
Applied a total of 4 rules in 22 ms. Remains 746 /748 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 746 cols
[2024-05-29 12:52:22] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:52:22] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-29 12:52:22] [INFO ] Invariant cache hit.
[2024-05-29 12:52:23] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/2019 places, 627/1809 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1941 ms. Remains : 746/2019 places, 627/1809 transitions.
Stuttering acceptance computed with spot in 399 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s329 0) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 528 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-08 finished in 2889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F((p1&&X(p2))))))))'
Support contains 6 out of 2019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2013 transition count 1803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2013 transition count 1803
Applied a total of 12 rules in 162 ms. Remains 2013 /2019 variables (removed 6) and now considering 1803/1809 (removed 6) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2024-05-29 12:52:24] [INFO ] Computed 331 invariants in 11 ms
[2024-05-29 12:52:25] [INFO ] Implicit Places using invariants in 707 ms returned []
[2024-05-29 12:52:25] [INFO ] Invariant cache hit.
[2024-05-29 12:52:27] [INFO ] Implicit Places using invariants and state equation in 1886 ms returned []
Implicit Place search using SMT with State Equation took 2601 ms to find 0 implicit places.
[2024-05-29 12:52:27] [INFO ] Invariant cache hit.
[2024-05-29 12:52:28] [INFO ] Dead Transitions using invariants and state equation in 1150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2013/2019 places, 1803/1809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3918 ms. Remains : 2013/2019 places, 1803/1809 transitions.
Stuttering acceptance computed with spot in 1377 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s1448 0) (EQ s1085 1)), p2:(OR (EQ s221 0) (EQ s420 1)), p0:(OR (EQ s1115 0) (EQ s1495 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 735 ms.
Product exploration explored 100000 steps with 20000 reset in 736 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p0), true]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 12:52:31] [INFO ] Invariant cache hit.
[2024-05-29 12:52:32] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:52:32] [INFO ] [Nat]Absence check using 331 positive place invariants in 108 ms returned sat
[2024-05-29 12:52:33] [INFO ] After 1003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:52:34] [INFO ] Deduced a trap composed of 24 places in 439 ms of which 2 ms to minimize.
[2024-05-29 12:52:34] [INFO ] Deduced a trap composed of 25 places in 390 ms of which 1 ms to minimize.
[2024-05-29 12:52:35] [INFO ] Deduced a trap composed of 16 places in 398 ms of which 1 ms to minimize.
[2024-05-29 12:52:35] [INFO ] Deduced a trap composed of 16 places in 377 ms of which 1 ms to minimize.
[2024-05-29 12:52:36] [INFO ] Deduced a trap composed of 17 places in 384 ms of which 1 ms to minimize.
[2024-05-29 12:52:36] [INFO ] Deduced a trap composed of 21 places in 399 ms of which 1 ms to minimize.
[2024-05-29 12:52:36] [INFO ] Deduced a trap composed of 17 places in 383 ms of which 1 ms to minimize.
[2024-05-29 12:52:37] [INFO ] Deduced a trap composed of 34 places in 368 ms of which 1 ms to minimize.
[2024-05-29 12:52:37] [INFO ] Deduced a trap composed of 32 places in 359 ms of which 1 ms to minimize.
[2024-05-29 12:52:38] [INFO ] Deduced a trap composed of 28 places in 392 ms of which 1 ms to minimize.
[2024-05-29 12:52:38] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 1 ms to minimize.
[2024-05-29 12:52:39] [INFO ] Deduced a trap composed of 26 places in 383 ms of which 1 ms to minimize.
[2024-05-29 12:52:39] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 1 ms to minimize.
[2024-05-29 12:52:39] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 1 ms to minimize.
[2024-05-29 12:52:40] [INFO ] Deduced a trap composed of 22 places in 360 ms of which 1 ms to minimize.
[2024-05-29 12:52:40] [INFO ] Deduced a trap composed of 23 places in 354 ms of which 1 ms to minimize.
[2024-05-29 12:52:41] [INFO ] Deduced a trap composed of 26 places in 360 ms of which 1 ms to minimize.
[2024-05-29 12:52:41] [INFO ] Deduced a trap composed of 35 places in 562 ms of which 1 ms to minimize.
[2024-05-29 12:52:42] [INFO ] Deduced a trap composed of 29 places in 336 ms of which 1 ms to minimize.
[2024-05-29 12:52:42] [INFO ] Deduced a trap composed of 18 places in 339 ms of which 1 ms to minimize.
[2024-05-29 12:52:43] [INFO ] Deduced a trap composed of 24 places in 331 ms of which 1 ms to minimize.
[2024-05-29 12:52:43] [INFO ] Deduced a trap composed of 28 places in 303 ms of which 1 ms to minimize.
[2024-05-29 12:52:43] [INFO ] Deduced a trap composed of 26 places in 310 ms of which 1 ms to minimize.
[2024-05-29 12:52:44] [INFO ] Deduced a trap composed of 31 places in 311 ms of which 0 ms to minimize.
[2024-05-29 12:52:44] [INFO ] Deduced a trap composed of 22 places in 302 ms of which 0 ms to minimize.
[2024-05-29 12:52:44] [INFO ] Deduced a trap composed of 45 places in 299 ms of which 1 ms to minimize.
[2024-05-29 12:52:45] [INFO ] Deduced a trap composed of 26 places in 291 ms of which 1 ms to minimize.
[2024-05-29 12:52:45] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 0 ms to minimize.
[2024-05-29 12:52:45] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 1 ms to minimize.
[2024-05-29 12:52:46] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 1 ms to minimize.
[2024-05-29 12:52:46] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 1 ms to minimize.
[2024-05-29 12:52:46] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 1 ms to minimize.
[2024-05-29 12:52:47] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 0 ms to minimize.
[2024-05-29 12:52:47] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 1 ms to minimize.
[2024-05-29 12:52:47] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 1 ms to minimize.
[2024-05-29 12:52:48] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 1 ms to minimize.
[2024-05-29 12:52:48] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 1 ms to minimize.
[2024-05-29 12:52:48] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 1 ms to minimize.
[2024-05-29 12:52:48] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 0 ms to minimize.
[2024-05-29 12:52:49] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 1 ms to minimize.
[2024-05-29 12:52:49] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 1 ms to minimize.
[2024-05-29 12:52:49] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 0 ms to minimize.
[2024-05-29 12:52:49] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 0 ms to minimize.
[2024-05-29 12:52:50] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 1 ms to minimize.
[2024-05-29 12:52:50] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 1 ms to minimize.
[2024-05-29 12:52:50] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 1 ms to minimize.
[2024-05-29 12:52:50] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 16884 ms
[2024-05-29 12:52:50] [INFO ] After 18062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-29 12:52:50] [INFO ] After 18656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 62 ms.
Support contains 4 out of 2013 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2013/2013 places, 1803/1803 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2013 transition count 1384
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 1594 transition count 1384
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 838 place count 1594 transition count 1146
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1314 place count 1356 transition count 1146
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 0 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2336 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2337 place count 845 transition count 634
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 2339 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2517 place count 755 transition count 633
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 3 with 89 rules applied. Total rules applied 2606 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2607 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2608 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2608 place count 753 transition count 630
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2612 place count 751 transition count 630
Applied a total of 2612 rules in 184 ms. Remains 751 /2013 variables (removed 1262) and now considering 630/1803 (removed 1173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 751/2013 places, 630/1803 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) 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 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 213827 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213827 steps, saw 171921 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 630 rows 751 cols
[2024-05-29 12:52:54] [INFO ] Computed 330 invariants in 1 ms
[2024-05-29 12:52:54] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:52:54] [INFO ] [Nat]Absence check using 330 positive place invariants in 51 ms returned sat
[2024-05-29 12:52:54] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:52:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:52:55] [INFO ] After 56ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:52:55] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-29 12:52:55] [INFO ] After 672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 11 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 751/751 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 29 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2024-05-29 12:52:55] [INFO ] Invariant cache hit.
[2024-05-29 12:52:55] [INFO ] Implicit Places using invariants in 450 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 452 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 749/751 places, 630/630 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 747 transition count 628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 23 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2024-05-29 12:52:55] [INFO ] Computed 328 invariants in 6 ms
[2024-05-29 12:52:56] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-29 12:52:56] [INFO ] Invariant cache hit.
[2024-05-29 12:52:56] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 747/751 places, 628/630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1771 ms. Remains : 747/751 places, 628/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) 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
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
Interrupted probabilistic random walk after 215091 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215091 steps, saw 173017 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 12:53:00] [INFO ] Invariant cache hit.
[2024-05-29 12:53:00] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:53:00] [INFO ] [Nat]Absence check using 328 positive place invariants in 52 ms returned sat
[2024-05-29 12:53:00] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:53:00] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-29 12:53:00] [INFO ] After 653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 12 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 747/747 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 11 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2024-05-29 12:53:01] [INFO ] Invariant cache hit.
[2024-05-29 12:53:01] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-29 12:53:01] [INFO ] Invariant cache hit.
[2024-05-29 12:53:02] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2024-05-29 12:53:02] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 12:53:02] [INFO ] Invariant cache hit.
[2024-05-29 12:53:02] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1600 ms. Remains : 747/747 places, 628/628 transitions.
Partial Free-agglomeration rule applied 173 times.
Drop transitions removed 173 transitions
Iterating global reduction 0 with 173 rules applied. Total rules applied 173 place count 747 transition count 628
Applied a total of 173 rules in 25 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 628 rows 747 cols
[2024-05-29 12:53:02] [INFO ] Computed 328 invariants in 1 ms
[2024-05-29 12:53:02] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:53:02] [INFO ] [Nat]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 12:53:03] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:53:03] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-29 12:53:03] [INFO ] After 140ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:53:03] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2024-05-29 12:53:03] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2024-05-29 12:53:03] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 663 ms
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2024-05-29 12:53:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2024-05-29 12:53:04] [INFO ] After 1218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2024-05-29 12:53:04] [INFO ] After 1786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p2 p0), (X p0), true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Support contains 4 out of 2013 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2013/2013 places, 1803/1803 transitions.
Applied a total of 0 rules in 74 ms. Remains 2013 /2013 variables (removed 0) and now considering 1803/1803 (removed 0) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2024-05-29 12:53:05] [INFO ] Computed 331 invariants in 12 ms
[2024-05-29 12:53:05] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-29 12:53:05] [INFO ] Invariant cache hit.
[2024-05-29 12:53:07] [INFO ] Implicit Places using invariants and state equation in 1804 ms returned []
Implicit Place search using SMT with State Equation took 2449 ms to find 0 implicit places.
[2024-05-29 12:53:07] [INFO ] Invariant cache hit.
[2024-05-29 12:53:08] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3646 ms. Remains : 2013/2013 places, 1803/1803 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 12:53:09] [INFO ] Invariant cache hit.
[2024-05-29 12:53:09] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:53:09] [INFO ] [Nat]Absence check using 331 positive place invariants in 105 ms returned sat
[2024-05-29 12:53:10] [INFO ] After 942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:53:11] [INFO ] Deduced a trap composed of 24 places in 434 ms of which 1 ms to minimize.
[2024-05-29 12:53:11] [INFO ] Deduced a trap composed of 25 places in 420 ms of which 1 ms to minimize.
[2024-05-29 12:53:12] [INFO ] Deduced a trap composed of 16 places in 484 ms of which 1 ms to minimize.
[2024-05-29 12:53:13] [INFO ] Deduced a trap composed of 16 places in 420 ms of which 1 ms to minimize.
[2024-05-29 12:53:13] [INFO ] Deduced a trap composed of 17 places in 400 ms of which 1 ms to minimize.
[2024-05-29 12:53:13] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 1 ms to minimize.
[2024-05-29 12:53:14] [INFO ] Deduced a trap composed of 17 places in 368 ms of which 1 ms to minimize.
[2024-05-29 12:53:14] [INFO ] Deduced a trap composed of 34 places in 355 ms of which 1 ms to minimize.
[2024-05-29 12:53:15] [INFO ] Deduced a trap composed of 32 places in 352 ms of which 1 ms to minimize.
[2024-05-29 12:53:15] [INFO ] Deduced a trap composed of 28 places in 353 ms of which 1 ms to minimize.
[2024-05-29 12:53:15] [INFO ] Deduced a trap composed of 29 places in 340 ms of which 1 ms to minimize.
[2024-05-29 12:53:16] [INFO ] Deduced a trap composed of 26 places in 358 ms of which 1 ms to minimize.
[2024-05-29 12:53:16] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 1 ms to minimize.
[2024-05-29 12:53:17] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 1 ms to minimize.
[2024-05-29 12:53:17] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 1 ms to minimize.
[2024-05-29 12:53:17] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 1 ms to minimize.
[2024-05-29 12:53:18] [INFO ] Deduced a trap composed of 26 places in 318 ms of which 1 ms to minimize.
[2024-05-29 12:53:18] [INFO ] Deduced a trap composed of 35 places in 310 ms of which 1 ms to minimize.
[2024-05-29 12:53:19] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 1 ms to minimize.
[2024-05-29 12:53:19] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 1 ms to minimize.
[2024-05-29 12:53:19] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 1 ms to minimize.
[2024-05-29 12:53:20] [INFO ] Deduced a trap composed of 28 places in 296 ms of which 1 ms to minimize.
[2024-05-29 12:53:20] [INFO ] Deduced a trap composed of 26 places in 302 ms of which 1 ms to minimize.
[2024-05-29 12:53:20] [INFO ] Deduced a trap composed of 31 places in 277 ms of which 1 ms to minimize.
[2024-05-29 12:53:21] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 1 ms to minimize.
[2024-05-29 12:53:21] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 1 ms to minimize.
[2024-05-29 12:53:21] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 1 ms to minimize.
[2024-05-29 12:53:22] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 1 ms to minimize.
[2024-05-29 12:53:22] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 1 ms to minimize.
[2024-05-29 12:53:22] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 1 ms to minimize.
[2024-05-29 12:53:23] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 0 ms to minimize.
[2024-05-29 12:53:23] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 0 ms to minimize.
[2024-05-29 12:53:23] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 0 ms to minimize.
[2024-05-29 12:53:24] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 0 ms to minimize.
[2024-05-29 12:53:24] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 1 ms to minimize.
[2024-05-29 12:53:24] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 1 ms to minimize.
[2024-05-29 12:53:24] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 0 ms to minimize.
[2024-05-29 12:53:25] [INFO ] Deduced a trap composed of 46 places in 191 ms of which 1 ms to minimize.
[2024-05-29 12:53:25] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 1 ms to minimize.
[2024-05-29 12:53:25] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 0 ms to minimize.
[2024-05-29 12:53:25] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 1 ms to minimize.
[2024-05-29 12:53:25] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 0 ms to minimize.
[2024-05-29 12:53:26] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 0 ms to minimize.
[2024-05-29 12:53:26] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 2 ms to minimize.
[2024-05-29 12:53:26] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 0 ms to minimize.
[2024-05-29 12:53:26] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 1 ms to minimize.
[2024-05-29 12:53:26] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 15909 ms
[2024-05-29 12:53:27] [INFO ] After 17041ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-29 12:53:27] [INFO ] After 17615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 74 ms.
Support contains 4 out of 2013 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2013/2013 places, 1803/1803 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2013 transition count 1384
Reduce places removed 419 places and 0 transitions.
Iterating post reduction 1 with 419 rules applied. Total rules applied 838 place count 1594 transition count 1384
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 838 place count 1594 transition count 1146
Deduced a syphon composed of 238 places in 2 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1314 place count 1356 transition count 1146
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2336 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2337 place count 845 transition count 634
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 2339 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2517 place count 755 transition count 633
Partial Free-agglomeration rule applied 89 times.
Drop transitions removed 89 transitions
Iterating global reduction 3 with 89 rules applied. Total rules applied 2606 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2607 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2608 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2608 place count 753 transition count 630
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2612 place count 751 transition count 630
Applied a total of 2612 rules in 191 ms. Remains 751 /2013 variables (removed 1262) and now considering 630/1803 (removed 1173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 751/2013 places, 630/1803 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) 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 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 235284 steps, run timeout after 3009 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235284 steps, saw 189199 distinct states, run finished after 3009 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 630 rows 751 cols
[2024-05-29 12:53:30] [INFO ] Computed 330 invariants in 1 ms
[2024-05-29 12:53:30] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:53:30] [INFO ] [Nat]Absence check using 330 positive place invariants in 48 ms returned sat
[2024-05-29 12:53:31] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:53:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:53:31] [INFO ] After 54ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:53:31] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-05-29 12:53:31] [INFO ] After 651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 11 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 751/751 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 10 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2024-05-29 12:53:31] [INFO ] Invariant cache hit.
[2024-05-29 12:53:31] [INFO ] Implicit Places using invariants in 402 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 404 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 749/751 places, 630/630 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 747 transition count 628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 20 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2024-05-29 12:53:31] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:53:32] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-29 12:53:32] [INFO ] Invariant cache hit.
[2024-05-29 12:53:33] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 747/751 places, 628/630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1603 ms. Remains : 747/751 places, 628/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) 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 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 165777 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165777 steps, saw 133192 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 12:53:36] [INFO ] Invariant cache hit.
[2024-05-29 12:53:36] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:53:36] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 12:53:36] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:53:37] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-29 12:53:37] [INFO ] After 601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 10 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 747/747 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 11 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2024-05-29 12:53:37] [INFO ] Invariant cache hit.
[2024-05-29 12:53:37] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-29 12:53:37] [INFO ] Invariant cache hit.
[2024-05-29 12:53:38] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
[2024-05-29 12:53:38] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 12:53:38] [INFO ] Invariant cache hit.
[2024-05-29 12:53:38] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1545 ms. Remains : 747/747 places, 628/628 transitions.
Partial Free-agglomeration rule applied 173 times.
Drop transitions removed 173 transitions
Iterating global reduction 0 with 173 rules applied. Total rules applied 173 place count 747 transition count 628
Applied a total of 173 rules in 25 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 628 rows 747 cols
[2024-05-29 12:53:38] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:53:38] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:53:38] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2024-05-29 12:53:39] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:53:39] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-29 12:53:39] [INFO ] After 129ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:53:39] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-29 12:53:39] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2024-05-29 12:53:39] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-05-29 12:53:40] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2024-05-29 12:53:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 634 ms
[2024-05-29 12:53:40] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2024-05-29 12:53:40] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2024-05-29 12:53:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2024-05-29 12:53:40] [INFO ] After 1168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-29 12:53:40] [INFO ] After 1717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p2), true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 696 ms.
Product exploration explored 100000 steps with 20000 reset in 699 ms.
Built C files in :
/tmp/ltsmin1704647743028132628
[2024-05-29 12:53:42] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1704647743028132628
Running compilation step : cd /tmp/ltsmin1704647743028132628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin1704647743028132628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1704647743028132628;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 4 out of 2013 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2013/2013 places, 1803/1803 transitions.
Applied a total of 0 rules in 75 ms. Remains 2013 /2013 variables (removed 0) and now considering 1803/1803 (removed 0) transitions.
// Phase 1: matrix 1803 rows 2013 cols
[2024-05-29 12:53:46] [INFO ] Computed 331 invariants in 13 ms
[2024-05-29 12:53:46] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-29 12:53:46] [INFO ] Invariant cache hit.
[2024-05-29 12:53:48] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2459 ms to find 0 implicit places.
[2024-05-29 12:53:48] [INFO ] Invariant cache hit.
[2024-05-29 12:53:49] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3595 ms. Remains : 2013/2013 places, 1803/1803 transitions.
Built C files in :
/tmp/ltsmin1156251179952939309
[2024-05-29 12:53:49] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1156251179952939309
Running compilation step : cd /tmp/ltsmin1156251179952939309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin1156251179952939309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1156251179952939309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-29 12:53:52] [INFO ] Flatten gal took : 42 ms
[2024-05-29 12:53:52] [INFO ] Flatten gal took : 43 ms
[2024-05-29 12:53:52] [INFO ] Time to serialize gal into /tmp/LTL10801296838495823088.gal : 10 ms
[2024-05-29 12:53:52] [INFO ] Time to serialize properties into /tmp/LTL10700303779481922818.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10801296838495823088.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1024175444857535353.hoa' '-atoms' '/tmp/LTL10700303779481922818.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10700303779481922818.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1024175444857535353.hoa
Detected timeout of ITS tools.
[2024-05-29 12:54:07] [INFO ] Flatten gal took : 40 ms
[2024-05-29 12:54:07] [INFO ] Flatten gal took : 44 ms
[2024-05-29 12:54:07] [INFO ] Time to serialize gal into /tmp/LTL5907583382874001417.gal : 7 ms
[2024-05-29 12:54:07] [INFO ] Time to serialize properties into /tmp/LTL2673916568177409701.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5907583382874001417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2673916568177409701.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F(("((p1677==0)||(p1257==1))")&&(X("((p249==0)||(p481==1))"))))))&&("((p1289==0)||(p1735==1))"))))
Formula 0 simplified : X(!"((p1289==0)||(p1735==1))" | XXG(!"((p1677==0)||(p1257==1))" | X!"((p249==0)||(p481==1))"))
Detected timeout of ITS tools.
[2024-05-29 12:54:23] [INFO ] Flatten gal took : 39 ms
[2024-05-29 12:54:23] [INFO ] Applying decomposition
[2024-05-29 12:54:23] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15323557511268131850.txt' '-o' '/tmp/graph15323557511268131850.bin' '-w' '/tmp/graph15323557511268131850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15323557511268131850.bin' '-l' '-1' '-v' '-w' '/tmp/graph15323557511268131850.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:54:23] [INFO ] Decomposing Gal with order
[2024-05-29 12:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:54:23] [INFO ] Removed a total of 297 redundant transitions.
[2024-05-29 12:54:23] [INFO ] Flatten gal took : 109 ms
[2024-05-29 12:54:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 12:54:23] [INFO ] Time to serialize gal into /tmp/LTL14673266392622453885.gal : 28 ms
[2024-05-29 12:54:23] [INFO ] Time to serialize properties into /tmp/LTL7502140036951315978.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14673266392622453885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7502140036951315978.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X(X(F(("((i21.u516.p1677==0)||(i15.u391.p1257==1))")&&(X("((i2.i0.i2.u78.p249==0)||(i5.u148.p481==1))"))))))&&("((i16.u398.p1289...186
Formula 0 simplified : X(!"((i16.u398.p1289==0)||(i22.u533.p1735==1))" | XXG(!"((i21.u516.p1677==0)||(i15.u391.p1257==1))" | X!"((i2.i0.i2.u78.p249==0)||(i...174
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3683064821001716660
[2024-05-29 12:54:38] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3683064821001716660
Running compilation step : cd /tmp/ltsmin3683064821001716660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin3683064821001716660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3683064821001716660;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 ShieldPPPt-PT-030B-LTLCardinality-10 finished in 137192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p1))))'
Support contains 3 out of 2019 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2012 transition count 1802
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2012 transition count 1802
Applied a total of 14 rules in 160 ms. Remains 2012 /2019 variables (removed 7) and now considering 1802/1809 (removed 7) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2024-05-29 12:54:41] [INFO ] Computed 331 invariants in 10 ms
[2024-05-29 12:54:42] [INFO ] Implicit Places using invariants in 675 ms returned []
[2024-05-29 12:54:42] [INFO ] Invariant cache hit.
[2024-05-29 12:54:44] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2491 ms to find 0 implicit places.
[2024-05-29 12:54:44] [INFO ] Invariant cache hit.
[2024-05-29 12:54:45] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2019 places, 1802/1809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3712 ms. Remains : 2012/2019 places, 1802/1809 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s730 1), p0:(OR (EQ s403 0) (EQ s1484 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-12 finished in 3858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 2 out of 2019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2018 transition count 1386
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1596 transition count 1386
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 844 place count 1596 transition count 1150
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1316 place count 1360 transition count 1150
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1324 place count 1352 transition count 1142
Iterating global reduction 2 with 8 rules applied. Total rules applied 1332 place count 1352 transition count 1142
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1332 place count 1352 transition count 1136
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1344 place count 1346 transition count 1136
Performed 501 Post agglomeration using F-continuation condition.Transition count delta: 501
Deduced a syphon composed of 501 places in 1 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 2 with 1002 rules applied. Total rules applied 2346 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2347 place count 845 transition count 634
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 2349 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2527 place count 755 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 753 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 752 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2530 place count 752 transition count 629
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2534 place count 750 transition count 629
Applied a total of 2534 rules in 247 ms. Remains 750 /2019 variables (removed 1269) and now considering 629/1809 (removed 1180) transitions.
// Phase 1: matrix 629 rows 750 cols
[2024-05-29 12:54:45] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 12:54:46] [INFO ] Implicit Places using invariants in 408 ms returned [733, 737]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 409 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 748/2019 places, 629/1809 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 746 transition count 627
Applied a total of 4 rules in 21 ms. Remains 746 /748 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 746 cols
[2024-05-29 12:54:46] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:54:46] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-29 12:54:46] [INFO ] Invariant cache hit.
[2024-05-29 12:54:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 12:54:47] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/2019 places, 627/1809 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1826 ms. Remains : 746/2019 places, 627/1809 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s433 0) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 496 ms.
Stack based approach found an accepted trace after 45463 steps with 0 reset with depth 45464 and stack size 39518 in 285 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-13 finished in 2657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 2019 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2019/2019 places, 1809/1809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2018 transition count 1390
Reduce places removed 418 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 419 rules applied. Total rules applied 837 place count 1600 transition count 1389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 838 place count 1599 transition count 1389
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 236 Pre rules applied. Total rules applied 838 place count 1599 transition count 1153
Deduced a syphon composed of 236 places in 2 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 3 with 472 rules applied. Total rules applied 1310 place count 1363 transition count 1153
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1317 place count 1356 transition count 1146
Iterating global reduction 3 with 7 rules applied. Total rules applied 1324 place count 1356 transition count 1146
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1324 place count 1356 transition count 1140
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1336 place count 1350 transition count 1140
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 1 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 3 with 1010 rules applied. Total rules applied 2346 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2347 place count 845 transition count 634
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 2349 place count 844 transition count 633
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2525 place count 756 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2527 place count 754 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2528 place count 753 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2528 place count 753 transition count 629
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2532 place count 751 transition count 629
Applied a total of 2532 rules in 244 ms. Remains 751 /2019 variables (removed 1268) and now considering 629/1809 (removed 1180) transitions.
// Phase 1: matrix 629 rows 751 cols
[2024-05-29 12:54:48] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 12:54:48] [INFO ] Implicit Places using invariants in 399 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 402 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2019 places, 629/1809 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 627
Applied a total of 4 rules in 20 ms. Remains 747 /749 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 747 cols
[2024-05-29 12:54:48] [INFO ] Computed 328 invariants in 1 ms
[2024-05-29 12:54:49] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-29 12:54:49] [INFO ] Invariant cache hit.
[2024-05-29 12:54:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 12:54:50] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2019 places, 627/1809 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1838 ms. Remains : 747/2019 places, 627/1809 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-15 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s422 0), p1:(OR (EQ s660 0) (EQ s526 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 96 reset in 498 ms.
Stack based approach found an accepted trace after 10936 steps with 36 reset with depth 45 and stack size 45 in 71 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-15 finished in 2550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G(p1))&&F(((p0 U p1)&&F(p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F((p1&&X(p2))))))))'
[2024-05-29 12:54:51] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11020572795903211256
[2024-05-29 12:54:51] [INFO ] Too many transitions (1809) to apply POR reductions. Disabling POR matrices.
[2024-05-29 12:54:51] [INFO ] Applying decomposition
[2024-05-29 12:54:51] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11020572795903211256
Running compilation step : cd /tmp/ltsmin11020572795903211256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 12:54:51] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph12907223979786743996.txt' '-o' '/tmp/graph12907223979786743996.bin' '-w' '/tmp/graph12907223979786743996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12907223979786743996.bin' '-l' '-1' '-v' '-w' '/tmp/graph12907223979786743996.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:54:51] [INFO ] Decomposing Gal with order
[2024-05-29 12:54:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:54:51] [INFO ] Removed a total of 292 redundant transitions.
[2024-05-29 12:54:51] [INFO ] Flatten gal took : 144 ms
[2024-05-29 12:54:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2024-05-29 12:54:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality2934704511322697502.gal : 15 ms
[2024-05-29 12:54:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality1644183899402651886.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2934704511322697502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1644183899402651886.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((((!("((i13.u323.p1030==0)||(i21.u508.p1633==1))"))U(G("((i4.u83.p257==0)||(i17.u405.p1292==1))")))&&(F((("((i13.u323.p1030==0)||(i2...274
Formula 0 simplified : ("((i13.u323.p1030==0)||(i21.u508.p1633==1))" R F!"((i4.u83.p257==0)||(i17.u405.p1292==1))") | G((!"((i13.u323.p1030==0)||(i21.u508....262
Compilation finished in 3463 ms.
Running link step : cd /tmp/ltsmin11020572795903211256;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11020572795903211256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((!(LTLAPp0==true) U []((LTLAPp1==true)))&&<>((((LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 13:16:58] [INFO ] Applying decomposition
[2024-05-29 13:16:59] [INFO ] Flatten gal took : 504 ms
[2024-05-29 13:17:00] [INFO ] Decomposing Gal with order
[2024-05-29 13:17:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:17:02] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-29 13:17:02] [INFO ] Flatten gal took : 691 ms
[2024-05-29 13:17:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 358 labels/synchronizations in 594 ms.
[2024-05-29 13:17:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality8747638750586731254.gal : 187 ms
[2024-05-29 13:17:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality9710816614364426765.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8747638750586731254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9710816614364426765.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((((!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u303.p1030==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u470.p1633==1))"))U(...779
Formula 0 simplified : ("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u303.p1030==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u470.p1633==1))" R F!"((...767
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.257: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.261: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.271: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.271: Initializing POR dependencies: labels 1814, guards 1809
pins2lts-mc-linux64( 6/ 8), 183.983: No maybe-coenabled matrix found. Turning off NESs from NDS+MC.
pins2lts-mc-linux64( 4/ 8), 740.891: LTL layer: formula: ((!(LTLAPp0==true) U []((LTLAPp1==true)))&&<>((((LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp0==true)))))
pins2lts-mc-linux64( 4/ 8), 740.891: "((!(LTLAPp0==true) U []((LTLAPp1==true)))&&<>((((LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 740.892: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 742.173: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 742.770: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 742.841: There are 1816 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 742.841: State length is 2020, there are 1815 groups
pins2lts-mc-linux64( 0/ 8), 742.841: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 742.841: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 742.841: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 742.841: Visible groups: 0 / 1815, labels: 2 / 1816
pins2lts-mc-linux64( 0/ 8), 742.841: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 742.841: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 743.233: [Blue] ~120 levels ~960 states ~9200 transitions
pins2lts-mc-linux64( 2/ 8), 743.554: [Blue] ~240 levels ~1920 states ~18400 transitions
pins2lts-mc-linux64( 4/ 8), 744.670: [Blue] ~480 levels ~3840 states ~61448 transitions
pins2lts-mc-linux64( 3/ 8), 746.024: [Blue] ~960 levels ~7680 states ~109304 transitions
pins2lts-mc-linux64( 3/ 8), 747.641: [Blue] ~1920 levels ~15360 states ~156600 transitions
pins2lts-mc-linux64( 3/ 8), 750.158: [Blue] ~3779 levels ~30720 states ~224696 transitions
pins2lts-mc-linux64( 3/ 8), 755.364: [Blue] ~7562 levels ~61440 states ~370656 transitions
pins2lts-mc-linux64( 3/ 8), 765.735: [Blue] ~15138 levels ~122880 states ~687872 transitions
pins2lts-mc-linux64( 3/ 8), 786.181: [Blue] ~30378 levels ~245760 states ~1365240 transitions
pins2lts-mc-linux64( 1/ 8), 826.111: [Blue] ~61182 levels ~491520 states ~2704352 transitions
pins2lts-mc-linux64( 1/ 8), 909.135: [Blue] ~122422 levels ~983040 states ~5405416 transitions
pins2lts-mc-linux64( 1/ 8), 1081.879: [Blue] ~244841 levels ~1966080 states ~10974480 transitions
pins2lts-mc-linux64( 7/ 8), 1430.359: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1430.668:
pins2lts-mc-linux64( 0/ 8), 1430.670: Explored 3409387 states 23940960 transitions, fanout: 7.022
pins2lts-mc-linux64( 0/ 8), 1430.674: Total exploration time 687.820 sec (687.520 sec minimum, 687.622 sec on average)
pins2lts-mc-linux64( 0/ 8), 1430.674: States per second: 4957, Transitions per second: 34807
pins2lts-mc-linux64( 0/ 8), 1430.674:
pins2lts-mc-linux64( 0/ 8), 1430.674: State space has 16595372 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1430.674: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1430.674: blue states: 3409387 (20.54%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1430.674: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1430.674: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1430.674:
pins2lts-mc-linux64( 0/ 8), 1430.674: Total memory used for local state coloring: 51.8MB
pins2lts-mc-linux64( 0/ 8), 1430.674:
pins2lts-mc-linux64( 0/ 8), 1430.674: Queue width: 8B, total height: 3395022, memory: 25.90MB
pins2lts-mc-linux64( 0/ 8), 1430.674: Tree memory: 382.6MB, 24.2 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1430.674: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1430.676: Stored 1837 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1430.693: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1430.696: Est. total memory use: 408.5MB (~1049.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11020572795903211256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((!(LTLAPp0==true) U []((LTLAPp1==true)))&&<>((((LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11020572795903211256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((!(LTLAPp0==true) U []((LTLAPp1==true)))&&<>((((LTLAPp0==true) U (LTLAPp1==true))&&<>((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 13:39:10] [INFO ] Flatten gal took : 347 ms
[2024-05-29 13:39:19] [INFO ] Input system was already deterministic with 1809 transitions.
[2024-05-29 13:39:19] [INFO ] Transformed 2019 places.
[2024-05-29 13:39:19] [INFO ] Transformed 1809 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 13:39:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality14689052322182903.gal : 12 ms
[2024-05-29 13:39:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality8406291002567753558.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14689052322182903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8406291002567753558.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...340
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((!("((p1030==0)||(p1633==1))"))U(G("((p257==0)||(p1292==1))")))&&(F((("((p1030==0)||(p1633==1))")U("((p257==0)||(p1292==1))"))&&(F...188
Formula 0 simplified : ("((p1030==0)||(p1633==1))" R F!"((p257==0)||(p1292==1))") | G((!"((p1030==0)||(p1633==1))" R !"((p257==0)||(p1292==1))") | G!"((p10...176
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3002384 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15865648 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="ShieldPPPt-PT-030B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-030B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789200407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;