Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713800635.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPt-PT-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 376K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679217022886

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 09:10:25] [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]
[2023-03-19 09:10:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:10:25] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2023-03-19 09:10:25] [INFO ] Transformed 1563 places.
[2023-03-19 09:10:25] [INFO ] Transformed 1423 transitions.
[2023-03-19 09:10:25] [INFO ] Found NUPN structural information;
[2023-03-19 09:10:25] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 216 places :
Symmetric choice reduction at 0 with 216 rule applications. Total rules 216 place count 1347 transition count 1207
Iterating global reduction 0 with 216 rules applied. Total rules applied 432 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 433 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 434 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 435 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 436 place count 1345 transition count 1205
Applied a total of 436 rules in 463 ms. Remains 1345 /1563 variables (removed 218) and now considering 1205/1423 (removed 218) transitions.
// Phase 1: matrix 1205 rows 1345 cols
[2023-03-19 09:10:26] [INFO ] Computed 221 place invariants in 31 ms
[2023-03-19 09:10:27] [INFO ] Implicit Places using invariants in 796 ms returned []
[2023-03-19 09:10:27] [INFO ] Invariant cache hit.
[2023-03-19 09:10:28] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 2374 ms to find 0 implicit places.
[2023-03-19 09:10:28] [INFO ] Invariant cache hit.
[2023-03-19 09:10:30] [INFO ] Dead Transitions using invariants and state equation in 1193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1345/1563 places, 1205/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4034 ms. Remains : 1345/1563 places, 1205/1423 transitions.
Support contains 23 out of 1345 places after structural reductions.
[2023-03-19 09:10:30] [INFO ] Flatten gal took : 223 ms
[2023-03-19 09:10:30] [INFO ] Flatten gal took : 48 ms
[2023-03-19 09:10:30] [INFO ] Input system was already deterministic with 1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) 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 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-19 09:10:31] [INFO ] Invariant cache hit.
[2023-03-19 09:10:31] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 09:10:32] [INFO ] [Nat]Absence check using 221 positive place invariants in 147 ms returned sat
[2023-03-19 09:10:33] [INFO ] After 1119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 09:10:34] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 9 ms to minimize.
[2023-03-19 09:10:34] [INFO ] Deduced a trap composed of 23 places in 671 ms of which 2 ms to minimize.
[2023-03-19 09:10:36] [INFO ] Deduced a trap composed of 17 places in 1651 ms of which 2 ms to minimize.
[2023-03-19 09:10:36] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 2 ms to minimize.
[2023-03-19 09:10:38] [INFO ] Deduced a trap composed of 33 places in 1513 ms of which 5 ms to minimize.
[2023-03-19 09:10:38] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 1 ms to minimize.
[2023-03-19 09:10:38] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 1 ms to minimize.
[2023-03-19 09:10:39] [INFO ] Deduced a trap composed of 19 places in 616 ms of which 1 ms to minimize.
[2023-03-19 09:10:39] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2023-03-19 09:10:40] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 2 ms to minimize.
[2023-03-19 09:10:40] [INFO ] Deduced a trap composed of 28 places in 344 ms of which 1 ms to minimize.
[2023-03-19 09:10:40] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 1 ms to minimize.
[2023-03-19 09:10:41] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 2 ms to minimize.
[2023-03-19 09:10:41] [INFO ] Deduced a trap composed of 33 places in 429 ms of which 1 ms to minimize.
[2023-03-19 09:10:41] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2023-03-19 09:10:42] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 2 ms to minimize.
[2023-03-19 09:10:42] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2023-03-19 09:10:42] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 0 ms to minimize.
[2023-03-19 09:10:42] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 1 ms to minimize.
[2023-03-19 09:10:43] [INFO ] Deduced a trap composed of 29 places in 427 ms of which 0 ms to minimize.
[2023-03-19 09:10:43] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 0 ms to minimize.
[2023-03-19 09:10:44] [INFO ] Deduced a trap composed of 31 places in 479 ms of which 1 ms to minimize.
[2023-03-19 09:10:44] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 1 ms to minimize.
[2023-03-19 09:10:44] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 1 ms to minimize.
[2023-03-19 09:10:44] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 0 ms to minimize.
[2023-03-19 09:10:44] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 1 ms to minimize.
[2023-03-19 09:10:45] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2023-03-19 09:10:45] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2023-03-19 09:10:45] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 0 ms to minimize.
[2023-03-19 09:10:45] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 11791 ms
[2023-03-19 09:10:46] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2023-03-19 09:10:46] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2023-03-19 09:10:46] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2023-03-19 09:10:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 643 ms
[2023-03-19 09:10:46] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 1 ms to minimize.
[2023-03-19 09:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-03-19 09:10:47] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 13 ms to minimize.
[2023-03-19 09:10:47] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2023-03-19 09:10:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2023-03-19 09:10:47] [INFO ] After 14715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 423 ms.
[2023-03-19 09:10:47] [INFO ] After 15795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 2 properties in 411 ms.
Support contains 12 out of 1345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Drop transitions removed 276 transitions
Trivial Post-agglo rules discarded 276 transitions
Performed 276 trivial Post agglomeration. Transition count delta: 276
Iterating post reduction 0 with 276 rules applied. Total rules applied 276 place count 1345 transition count 929
Reduce places removed 276 places and 0 transitions.
Iterating post reduction 1 with 276 rules applied. Total rules applied 552 place count 1069 transition count 929
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 552 place count 1069 transition count 774
Deduced a syphon composed of 155 places in 2 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 862 place count 914 transition count 774
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 863 place count 913 transition count 773
Iterating global reduction 2 with 1 rules applied. Total rules applied 864 place count 913 transition count 773
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 864 place count 913 transition count 772
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 866 place count 912 transition count 772
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1544 place count 573 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1545 place count 573 transition count 432
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 1547 place count 572 transition count 431
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 1657 place count 517 transition count 431
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 1716 place count 517 transition count 431
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1717 place count 516 transition count 430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1718 place count 515 transition count 430
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1718 place count 515 transition count 428
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 1722 place count 513 transition count 428
Applied a total of 1722 rules in 315 ms. Remains 513 /1345 variables (removed 832) and now considering 428/1205 (removed 777) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 513/1345 places, 428/1205 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) 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 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 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 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 428 rows 513 cols
[2023-03-19 09:10:49] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-19 09:10:49] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:10:49] [INFO ] [Nat]Absence check using 220 positive place invariants in 47 ms returned sat
[2023-03-19 09:10:49] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:10:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:10:49] [INFO ] After 90ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:10:50] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 153 ms.
[2023-03-19 09:10:50] [INFO ] After 1050ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 10 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 428/428 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 512 transition count 427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 511 transition count 426
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 510 transition count 426
Applied a total of 6 rules in 47 ms. Remains 510 /513 variables (removed 3) and now considering 426/428 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 510/513 places, 426/428 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 6) 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 6) 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 6) 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 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 47 ms. (steps per millisecond=212 ) 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 134432 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134432 steps, saw 104250 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 426 rows 510 cols
[2023-03-19 09:10:53] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-19 09:10:53] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:10:54] [INFO ] [Nat]Absence check using 220 positive place invariants in 32 ms returned sat
[2023-03-19 09:10:54] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:10:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:10:54] [INFO ] After 210ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:10:54] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2023-03-19 09:10:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-19 09:10:54] [INFO ] After 525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-03-19 09:10:55] [INFO ] After 1192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 59 ms.
Support contains 10 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 426/426 transitions.
Applied a total of 0 rules in 13 ms. Remains 510 /510 variables (removed 0) and now considering 426/426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 510/510 places, 426/426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 426/426 transitions.
Applied a total of 0 rules in 12 ms. Remains 510 /510 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2023-03-19 09:10:55] [INFO ] Invariant cache hit.
[2023-03-19 09:10:55] [INFO ] Implicit Places using invariants in 411 ms returned [493, 497]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 413 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 508/510 places, 426/426 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 506 transition count 424
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 506 transition count 424
Applied a total of 4 rules in 20 ms. Remains 506 /508 variables (removed 2) and now considering 424/426 (removed 2) transitions.
// Phase 1: matrix 424 rows 506 cols
[2023-03-19 09:10:55] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-19 09:10:55] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-19 09:10:55] [INFO ] Invariant cache hit.
[2023-03-19 09:10:56] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 506/510 places, 424/426 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1254 ms. Remains : 506/510 places, 424/426 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 123773 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123773 steps, saw 96719 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-19 09:11:00] [INFO ] Invariant cache hit.
[2023-03-19 09:11:00] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:11:00] [INFO ] [Nat]Absence check using 218 positive place invariants in 43 ms returned sat
[2023-03-19 09:11:00] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:11:00] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2023-03-19 09:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-19 09:11:01] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-19 09:11:01] [INFO ] After 938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 43 ms.
Support contains 10 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 424/424 transitions.
Applied a total of 0 rules in 9 ms. Remains 506 /506 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 506/506 places, 424/424 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 424/424 transitions.
Applied a total of 0 rules in 20 ms. Remains 506 /506 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2023-03-19 09:11:01] [INFO ] Invariant cache hit.
[2023-03-19 09:11:01] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-19 09:11:01] [INFO ] Invariant cache hit.
[2023-03-19 09:11:02] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2023-03-19 09:11:02] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-19 09:11:02] [INFO ] Invariant cache hit.
[2023-03-19 09:11:02] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1267 ms. Remains : 506/506 places, 424/424 transitions.
Partial Free-agglomeration rule applied 108 times.
Drop transitions removed 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 108 place count 506 transition count 424
Applied a total of 108 rules in 18 ms. Remains 506 /506 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 424 rows 506 cols
[2023-03-19 09:11:02] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:11:02] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:11:02] [INFO ] [Nat]Absence check using 218 positive place invariants in 56 ms returned sat
[2023-03-19 09:11:03] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:11:03] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-19 09:11:03] [INFO ] After 169ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:11:03] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-19 09:11:03] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2023-03-19 09:11:03] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2023-03-19 09:11:04] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2023-03-19 09:11:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 583 ms
[2023-03-19 09:11:04] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 4 ms to minimize.
[2023-03-19 09:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-19 09:11:04] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2023-03-19 09:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-19 09:11:04] [INFO ] After 1449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-19 09:11:04] [INFO ] After 2134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA ShieldPPPt-PT-020B-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 319 stabilizing places and 319 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 159 Pre rules applied. Total rules applied 560 place count 1064 transition count 765
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 878 place count 905 transition count 765
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 881 place count 902 transition count 762
Iterating global reduction 2 with 3 rules applied. Total rules applied 884 place count 902 transition count 762
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 884 place count 902 transition count 760
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 888 place count 900 transition count 760
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1562 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1563 place count 563 transition count 422
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 1565 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1683 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1686 place count 500 transition count 417
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 1690 place count 498 transition count 417
Applied a total of 1690 rules in 240 ms. Remains 498 /1345 variables (removed 847) and now considering 417/1205 (removed 788) transitions.
// Phase 1: matrix 417 rows 498 cols
[2023-03-19 09:11:05] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-19 09:11:05] [INFO ] Implicit Places using invariants in 464 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 465 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1345 places, 417/1205 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 494 transition count 415
Applied a total of 4 rules in 21 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2023-03-19 09:11:05] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:11:06] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-19 09:11:06] [INFO ] Invariant cache hit.
[2023-03-19 09:11:06] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1345 places, 415/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1614 ms. Remains : 494/1345 places, 415/1205 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-01 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 s435 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 241 reset in 513 ms.
Stack based approach found an accepted trace after 96 steps with 0 reset with depth 97 and stack size 97 in 2 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-01 finished in 2364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((!p0 U ((p1 U p2)||F(p1)))) U p0))))'
Support contains 5 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 1344 transition count 926
Reduce places removed 278 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 557 place count 1066 transition count 925
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 558 place count 1065 transition count 925
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 156 Pre rules applied. Total rules applied 558 place count 1065 transition count 769
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 870 place count 909 transition count 769
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 872 place count 907 transition count 767
Iterating global reduction 3 with 2 rules applied. Total rules applied 874 place count 907 transition count 767
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 874 place count 907 transition count 766
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 876 place count 906 transition count 766
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1550 place count 569 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1551 place count 569 transition count 428
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 1553 place count 568 transition count 427
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1667 place count 511 transition count 427
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1669 place count 509 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1670 place count 508 transition count 425
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1670 place count 508 transition count 423
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 1674 place count 506 transition count 423
Applied a total of 1674 rules in 168 ms. Remains 506 /1345 variables (removed 839) and now considering 423/1205 (removed 782) transitions.
// Phase 1: matrix 423 rows 506 cols
[2023-03-19 09:11:07] [INFO ] Computed 220 place invariants in 1 ms
[2023-03-19 09:11:07] [INFO ] Implicit Places using invariants in 334 ms returned [489, 493]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 336 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1345 places, 423/1205 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 502 transition count 421
Applied a total of 4 rules in 17 ms. Remains 502 /504 variables (removed 2) and now considering 421/423 (removed 2) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-19 09:11:07] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:11:08] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-19 09:11:08] [INFO ] Invariant cache hit.
[2023-03-19 09:11:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:08] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 502/1345 places, 421/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1456 ms. Remains : 502/1345 places, 421/1205 transitions.
Stuttering acceptance computed with spot in 411 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s223 0) (EQ s435 1)), p2:(EQ s125 1), p1:(OR (EQ s22 0) (EQ s258 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2 reset in 473 ms.
Product exploration explored 100000 steps with 0 reset in 625 ms.
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 p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 726 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 404 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-19 09:11:12] [INFO ] Invariant cache hit.
[2023-03-19 09:11:12] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 09:11:12] [INFO ] [Nat]Absence check using 218 positive place invariants in 29 ms returned sat
[2023-03-19 09:11:12] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:12] [INFO ] After 144ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:13] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 189 ms.
[2023-03-19 09:11:13] [INFO ] After 1263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 67 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 20 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 502/502 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 148264 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148264 steps, saw 107178 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-19 09:11:17] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-19 09:11:17] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 09:11:17] [INFO ] [Nat]Absence check using 218 positive place invariants in 30 ms returned sat
[2023-03-19 09:11:17] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:17] [INFO ] After 115ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:17] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-19 09:11:18] [INFO ] After 1019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 15 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 502/502 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 15 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2023-03-19 09:11:18] [INFO ] Invariant cache hit.
[2023-03-19 09:11:18] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-19 09:11:18] [INFO ] Invariant cache hit.
[2023-03-19 09:11:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:19] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2023-03-19 09:11:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 09:11:19] [INFO ] Invariant cache hit.
[2023-03-19 09:11:19] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1448 ms. Remains : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 113 times.
Drop transitions removed 113 transitions
Iterating global reduction 0 with 113 rules applied. Total rules applied 113 place count 502 transition count 421
Applied a total of 113 rules in 21 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-19 09:11:19] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:11:19] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 09:11:19] [INFO ] [Nat]Absence check using 218 positive place invariants in 30 ms returned sat
[2023-03-19 09:11:20] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 09:11:20] [INFO ] After 135ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:20] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 158 ms.
[2023-03-19 09:11:20] [INFO ] After 1098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 693 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 372 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 399 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 14 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-19 09:11:22] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:11:22] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-19 09:11:22] [INFO ] Invariant cache hit.
[2023-03-19 09:11:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:23] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-19 09:11:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 09:11:23] [INFO ] Invariant cache hit.
[2023-03-19 09:11:23] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1386 ms. Remains : 502/502 places, 421/421 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 p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 741 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 395 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 6) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-19 09:11:25] [INFO ] Invariant cache hit.
[2023-03-19 09:11:25] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 09:11:25] [INFO ] [Nat]Absence check using 218 positive place invariants in 46 ms returned sat
[2023-03-19 09:11:26] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:26] [INFO ] After 139ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:26] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 175 ms.
[2023-03-19 09:11:26] [INFO ] After 1192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 47 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 502 transition count 421
Applied a total of 4 rules in 20 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 502/502 places, 421/421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 159130 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159130 steps, saw 115106 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-19 09:11:30] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-19 09:11:30] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 09:11:30] [INFO ] [Nat]Absence check using 218 positive place invariants in 185 ms returned sat
[2023-03-19 09:11:31] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:31] [INFO ] After 123ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:31] [INFO ] After 412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-19 09:11:31] [INFO ] After 1236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 50 ms.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 10 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 502/502 places, 421/421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 8 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
[2023-03-19 09:11:31] [INFO ] Invariant cache hit.
[2023-03-19 09:11:32] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-19 09:11:32] [INFO ] Invariant cache hit.
[2023-03-19 09:11:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:32] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2023-03-19 09:11:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 09:11:32] [INFO ] Invariant cache hit.
[2023-03-19 09:11:33] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1322 ms. Remains : 502/502 places, 421/421 transitions.
Partial Free-agglomeration rule applied 113 times.
Drop transitions removed 113 transitions
Iterating global reduction 0 with 113 rules applied. Total rules applied 113 place count 502 transition count 421
Applied a total of 113 rules in 16 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 421 rows 502 cols
[2023-03-19 09:11:33] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:11:33] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 09:11:33] [INFO ] [Nat]Absence check using 218 positive place invariants in 220 ms returned sat
[2023-03-19 09:11:34] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 09:11:34] [INFO ] After 179ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-19 09:11:34] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2023-03-19 09:11:34] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2023-03-19 09:11:34] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 13 ms to minimize.
[2023-03-19 09:11:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 325 ms
[2023-03-19 09:11:34] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2023-03-19 09:11:34] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2023-03-19 09:11:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-19 09:11:34] [INFO ] After 860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 185 ms.
[2023-03-19 09:11:35] [INFO ] After 1861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 833 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter insensitive) to 7 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 522 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 476 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 474 ms :[(NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 497 ms.
Product exploration explored 100000 steps with 1 reset in 687 ms.
Built C files in :
/tmp/ltsmin9666309463128444128
[2023-03-19 09:11:38] [INFO ] Computing symmetric may disable matrix : 421 transitions.
[2023-03-19 09:11:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:11:38] [INFO ] Computing symmetric may enable matrix : 421 transitions.
[2023-03-19 09:11:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:11:38] [INFO ] Computing Do-Not-Accords matrix : 421 transitions.
[2023-03-19 09:11:38] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:11:38] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9666309463128444128
Running compilation step : cd /tmp/ltsmin9666309463128444128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1165 ms.
Running link step : cd /tmp/ltsmin9666309463128444128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 94 ms.
Running LTSmin : cd /tmp/ltsmin9666309463128444128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1192141230622643416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 502 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 502/502 places, 421/421 transitions.
Applied a total of 0 rules in 22 ms. Remains 502 /502 variables (removed 0) and now considering 421/421 (removed 0) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-19 09:11:53] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:11:54] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-19 09:11:54] [INFO ] Invariant cache hit.
[2023-03-19 09:11:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:11:54] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2023-03-19 09:11:54] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 09:11:54] [INFO ] Invariant cache hit.
[2023-03-19 09:11:55] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1187 ms. Remains : 502/502 places, 421/421 transitions.
Built C files in :
/tmp/ltsmin7974413355293866338
[2023-03-19 09:11:55] [INFO ] Computing symmetric may disable matrix : 421 transitions.
[2023-03-19 09:11:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:11:55] [INFO ] Computing symmetric may enable matrix : 421 transitions.
[2023-03-19 09:11:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:11:55] [INFO ] Computing Do-Not-Accords matrix : 421 transitions.
[2023-03-19 09:11:55] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:11:55] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7974413355293866338
Running compilation step : cd /tmp/ltsmin7974413355293866338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 932 ms.
Running link step : cd /tmp/ltsmin7974413355293866338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin7974413355293866338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14839794352566248639.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 09:12:10] [INFO ] Flatten gal took : 18 ms
[2023-03-19 09:12:10] [INFO ] Flatten gal took : 18 ms
[2023-03-19 09:12:10] [INFO ] Time to serialize gal into /tmp/LTL10521696489388874032.gal : 6 ms
[2023-03-19 09:12:10] [INFO ] Time to serialize properties into /tmp/LTL6181905507553924892.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10521696489388874032.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16994274818438190104.hoa' '-atoms' '/tmp/LTL6181905507553924892.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6181905507553924892.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16994274818438190104.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...377
Computing Next relation with stutter on 2.24961e+32 deadlock states
Detected timeout of ITS tools.
[2023-03-19 09:12:25] [INFO ] Flatten gal took : 43 ms
[2023-03-19 09:12:25] [INFO ] Flatten gal took : 25 ms
[2023-03-19 09:12:25] [INFO ] Time to serialize gal into /tmp/LTL12605315352759109596.gal : 4 ms
[2023-03-19 09:12:25] [INFO ] Time to serialize properties into /tmp/LTL12568422466246008164.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12605315352759109596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12568422466246008164.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((G((!("((p671==0)||(p1340==1))"))U((("((p62==0)||(p789==1))")U("(p386==1)"))||(F("((p62==0)||(p789==1))")))))U("((p671==0)||(p1...169
Formula 0 simplified : GF(F("((p671==0)||(p1340==1))" R ((!"((p62==0)||(p789==1))" R !"(p386==1)") & G!"((p62==0)||(p789==1))")) R !"((p671==0)||(p1340==1)...158
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...377
Computing Next relation with stutter on 2.24961e+32 deadlock states
Detected timeout of ITS tools.
[2023-03-19 09:12:40] [INFO ] Flatten gal took : 17 ms
[2023-03-19 09:12:40] [INFO ] Applying decomposition
[2023-03-19 09:12:40] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph865706819408565152.txt' '-o' '/tmp/graph865706819408565152.bin' '-w' '/tmp/graph865706819408565152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph865706819408565152.bin' '-l' '-1' '-v' '-w' '/tmp/graph865706819408565152.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:12:40] [INFO ] Decomposing Gal with order
[2023-03-19 09:12:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:12:40] [INFO ] Removed a total of 125 redundant transitions.
[2023-03-19 09:12:40] [INFO ] Flatten gal took : 72 ms
[2023-03-19 09:12:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 9 ms.
[2023-03-19 09:12:40] [INFO ] Time to serialize gal into /tmp/LTL6329342190035480606.gal : 8 ms
[2023-03-19 09:12:40] [INFO ] Time to serialize properties into /tmp/LTL8969539782336433954.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6329342190035480606.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8969539782336433954.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((G((!("((i8.i2.u74.p671==0)||(i17.i2.u139.p1340==1))"))U((("((i0.i0.u7.p62==0)||(i9.i2.u82.p789==1))")U("(i4.i1.u41.p386==1)"))...261
Formula 0 simplified : GF(F("((i8.i2.u74.p671==0)||(i17.i2.u139.p1340==1))" R ((!"((i0.i0.u7.p62==0)||(i9.i2.u82.p789==1))" R !"(i4.i1.u41.p386==1)") & G!"...250
Reverse transition relation is NOT exact ! Due to transitions i0.t2, i0.i0.t1, i0.i0.u7.t322, i0.i1.u1.t324, i0.i1.u2.t0, i1.t5, i1.t4, i1.t3, i1.i2.u10.t3...601
Computing Next relation with stutter on 2.24961e+32 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
279 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.8463,73712,1,0,108972,450,4299,276202,566,2303,131983
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-02 finished in 96939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1344 transition count 925
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 1065 transition count 925
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 558 place count 1065 transition count 767
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 874 place count 907 transition count 767
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 876 place count 905 transition count 765
Iterating global reduction 2 with 2 rules applied. Total rules applied 878 place count 905 transition count 765
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 878 place count 905 transition count 763
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 882 place count 903 transition count 763
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1554 place count 567 transition count 427
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1555 place count 567 transition count 426
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 1557 place count 566 transition count 425
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1675 place count 507 transition count 425
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1677 place count 505 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1678 place count 504 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1678 place count 504 transition count 421
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 1682 place count 502 transition count 421
Applied a total of 1682 rules in 144 ms. Remains 502 /1345 variables (removed 843) and now considering 421/1205 (removed 784) transitions.
// Phase 1: matrix 421 rows 502 cols
[2023-03-19 09:12:44] [INFO ] Computed 220 place invariants in 6 ms
[2023-03-19 09:12:44] [INFO ] Implicit Places using invariants in 376 ms returned [485, 489]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 380 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1345 places, 421/1205 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 498 transition count 419
Applied a total of 4 rules in 22 ms. Remains 498 /500 variables (removed 2) and now considering 419/421 (removed 2) transitions.
// Phase 1: matrix 419 rows 498 cols
[2023-03-19 09:12:44] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-19 09:12:45] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-19 09:12:45] [INFO ] Invariant cache hit.
[2023-03-19 09:12:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:12:45] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 498/1345 places, 419/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1225 ms. Remains : 498/1345 places, 419/1205 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s52 0) (EQ s334 1)), p1:(OR (EQ s56 0) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 435 ms.
Product exploration explored 100000 steps with 1 reset in 523 ms.
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 p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 331 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:12:47] [INFO ] Invariant cache hit.
[2023-03-19 09:12:47] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:12:47] [INFO ] [Nat]Absence check using 218 positive place invariants in 50 ms returned sat
[2023-03-19 09:12:47] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:12:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:12:47] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:12:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-19 09:12:47] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-19 09:12:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-03-19 09:12:47] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 09:12:47] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 419/419 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 498 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 497 transition count 418
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 497 transition count 418
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 495 transition count 416
Applied a total of 5 rules in 27 ms. Remains 495 /498 variables (removed 3) and now considering 416/419 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 495/498 places, 416/419 transitions.
Finished random walk after 7167 steps, including 2 resets, run visited all 1 properties in 31 ms. (steps per millisecond=231 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 390 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 498/498 places, 419/419 transitions.
Applied a total of 0 rules in 19 ms. Remains 498 /498 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2023-03-19 09:12:48] [INFO ] Invariant cache hit.
[2023-03-19 09:12:49] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-19 09:12:49] [INFO ] Invariant cache hit.
[2023-03-19 09:12:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:12:49] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
[2023-03-19 09:12:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 09:12:49] [INFO ] Invariant cache hit.
[2023-03-19 09:12:49] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1107 ms. Remains : 498/498 places, 419/419 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 p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 272 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:12:50] [INFO ] Invariant cache hit.
[2023-03-19 09:12:50] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:12:50] [INFO ] [Nat]Absence check using 218 positive place invariants in 23 ms returned sat
[2023-03-19 09:12:50] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:12:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:12:50] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:12:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2023-03-19 09:12:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2023-03-19 09:12:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2023-03-19 09:12:50] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 09:12:50] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 498/498 places, 419/419 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 498 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 497 transition count 418
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 497 transition count 418
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 495 transition count 416
Applied a total of 5 rules in 29 ms. Remains 495 /498 variables (removed 3) and now considering 416/419 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 495/498 places, 416/419 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 559467 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 559467 steps, saw 413444 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2023-03-19 09:12:53] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-19 09:12:53] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:12:53] [INFO ] [Nat]Absence check using 218 positive place invariants in 43 ms returned sat
[2023-03-19 09:12:54] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:12:54] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 09:12:54] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 8 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 495/495 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 495/495 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-03-19 09:12:54] [INFO ] Invariant cache hit.
[2023-03-19 09:12:54] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-19 09:12:54] [INFO ] Invariant cache hit.
[2023-03-19 09:12:55] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2023-03-19 09:12:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 09:12:55] [INFO ] Invariant cache hit.
[2023-03-19 09:12:55] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1065 ms. Remains : 495/495 places, 416/416 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 495 transition count 416
Applied a total of 116 rules in 15 ms. Remains 495 /495 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 495 cols
[2023-03-19 09:12:55] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-19 09:12:55] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:12:55] [INFO ] [Nat]Absence check using 218 positive place invariants in 27 ms returned sat
[2023-03-19 09:12:55] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:12:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:12:55] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 09:12:55] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-19 09:12:55] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 429 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 405 ms.
Product exploration explored 100000 steps with 1 reset in 557 ms.
Built C files in :
/tmp/ltsmin9876840258116275943
[2023-03-19 09:12:57] [INFO ] Computing symmetric may disable matrix : 419 transitions.
[2023-03-19 09:12:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:12:57] [INFO ] Computing symmetric may enable matrix : 419 transitions.
[2023-03-19 09:12:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:12:57] [INFO ] Computing Do-Not-Accords matrix : 419 transitions.
[2023-03-19 09:12:57] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:12:57] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9876840258116275943
Running compilation step : cd /tmp/ltsmin9876840258116275943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 973 ms.
Running link step : cd /tmp/ltsmin9876840258116275943;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9876840258116275943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15834786923605732693.hoa' '--buchi-type=spotba'
LTSmin run took 5789 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-03 finished in 20356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1064 transition count 766
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 906 transition count 766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 879 place count 903 transition count 763
Iterating global reduction 2 with 3 rules applied. Total rules applied 882 place count 903 transition count 763
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 882 place count 903 transition count 761
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 886 place count 901 transition count 761
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1562 place count 563 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1563 place count 563 transition count 422
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 1565 place count 562 transition count 421
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1683 place count 503 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 501 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 500 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1686 place count 500 transition count 417
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 1690 place count 498 transition count 417
Applied a total of 1690 rules in 174 ms. Remains 498 /1345 variables (removed 847) and now considering 417/1205 (removed 788) transitions.
// Phase 1: matrix 417 rows 498 cols
[2023-03-19 09:13:04] [INFO ] Computed 220 place invariants in 3 ms
[2023-03-19 09:13:05] [INFO ] Implicit Places using invariants in 305 ms returned [481, 485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 306 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 496/1345 places, 417/1205 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 494 transition count 415
Applied a total of 4 rules in 12 ms. Remains 494 /496 variables (removed 2) and now considering 415/417 (removed 2) transitions.
// Phase 1: matrix 415 rows 494 cols
[2023-03-19 09:13:05] [INFO ] Computed 218 place invariants in 0 ms
[2023-03-19 09:13:05] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-19 09:13:05] [INFO ] Invariant cache hit.
[2023-03-19 09:13:06] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 494/1345 places, 415/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1366 ms. Remains : 494/1345 places, 415/1205 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s380 0) (EQ s78 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 198 reset in 517 ms.
Product exploration explored 100000 steps with 228 reset in 509 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 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 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 349 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=69 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 162 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 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 494/494 places, 415/415 transitions.
Applied a total of 0 rules in 12 ms. Remains 494 /494 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2023-03-19 09:13:07] [INFO ] Invariant cache hit.
[2023-03-19 09:13:08] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-19 09:13:08] [INFO ] Invariant cache hit.
[2023-03-19 09:13:08] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
[2023-03-19 09:13:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 09:13:08] [INFO ] Invariant cache hit.
[2023-03-19 09:13:09] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1401 ms. Remains : 494/494 places, 415/415 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 228 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=228 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 186 reset in 401 ms.
Stack based approach found an accepted trace after 3875 steps with 9 reset with depth 153 and stack size 150 in 19 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-06 finished in 5614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((G(p2)||p1)))))'
Support contains 4 out of 1345 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1343 transition count 1203
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1343 transition count 1203
Applied a total of 4 rules in 93 ms. Remains 1343 /1345 variables (removed 2) and now considering 1203/1205 (removed 2) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2023-03-19 09:13:10] [INFO ] Computed 221 place invariants in 5 ms
[2023-03-19 09:13:10] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-19 09:13:10] [INFO ] Invariant cache hit.
[2023-03-19 09:13:12] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2265 ms to find 0 implicit places.
[2023-03-19 09:13:12] [INFO ] Invariant cache hit.
[2023-03-19 09:13:13] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1343/1345 places, 1203/1205 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3008 ms. Remains : 1343/1345 places, 1203/1205 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p2:(OR (EQ s66 0) (EQ s903 1)), p1:(OR (EQ s649 0) (EQ s1074 1)), p0:(OR (EQ s649 0) (EQ s1074 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 396 ms.
Product exploration explored 100000 steps with 0 reset in 555 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 501 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 09:13:15] [INFO ] Invariant cache hit.
[2023-03-19 09:13:15] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:13:15] [INFO ] [Nat]Absence check using 221 positive place invariants in 143 ms returned sat
[2023-03-19 09:13:16] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:16] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 1 ms to minimize.
[2023-03-19 09:13:17] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 1 ms to minimize.
[2023-03-19 09:13:17] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 1 ms to minimize.
[2023-03-19 09:13:17] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 1 ms to minimize.
[2023-03-19 09:13:18] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 0 ms to minimize.
[2023-03-19 09:13:18] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 0 ms to minimize.
[2023-03-19 09:13:18] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2023-03-19 09:13:18] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 1 ms to minimize.
[2023-03-19 09:13:19] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
[2023-03-19 09:13:19] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 1 ms to minimize.
[2023-03-19 09:13:19] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 1 ms to minimize.
[2023-03-19 09:13:19] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 0 ms to minimize.
[2023-03-19 09:13:20] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 0 ms to minimize.
[2023-03-19 09:13:20] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 1 ms to minimize.
[2023-03-19 09:13:20] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 1 ms to minimize.
[2023-03-19 09:13:20] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 0 ms to minimize.
[2023-03-19 09:13:21] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 1 ms to minimize.
[2023-03-19 09:13:21] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2023-03-19 09:13:21] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2023-03-19 09:13:21] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 0 ms to minimize.
[2023-03-19 09:13:21] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2023-03-19 09:13:21] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2023-03-19 09:13:22] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 0 ms to minimize.
[2023-03-19 09:13:22] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 1 ms to minimize.
[2023-03-19 09:13:22] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2023-03-19 09:13:22] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 0 ms to minimize.
[2023-03-19 09:13:23] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 0 ms to minimize.
[2023-03-19 09:13:23] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 1 ms to minimize.
[2023-03-19 09:13:23] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6810 ms
[2023-03-19 09:13:23] [INFO ] After 7671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 194 ms.
[2023-03-19 09:13:23] [INFO ] After 8234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 113 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1343 transition count 924
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 1064 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1063 transition count 923
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 560 place count 1063 transition count 765
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 876 place count 905 transition count 765
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 1558 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1559 place count 564 transition count 423
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 1561 place count 563 transition count 422
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1677 place count 505 transition count 422
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1678 place count 505 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1679 place count 504 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 1737 place count 504 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1738 place count 503 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1739 place count 502 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1739 place count 502 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1743 place count 500 transition count 418
Applied a total of 1743 rules in 178 ms. Remains 500 /1343 variables (removed 843) and now considering 418/1203 (removed 785) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 500/1343 places, 418/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) 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 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Finished probabilistic random walk after 225741 steps, run visited all 2 properties in 2492 ms. (steps per millisecond=90 )
Probabilistic random walk after 225741 steps, saw 170910 distinct states, run finished after 2492 ms. (steps per millisecond=90 ) properties seen :2
Knowledge obtained : [(AND p2 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 9 factoid took 405 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Applied a total of 0 rules in 52 ms. Remains 1343 /1343 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2023-03-19 09:13:27] [INFO ] Invariant cache hit.
[2023-03-19 09:13:27] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-19 09:13:27] [INFO ] Invariant cache hit.
[2023-03-19 09:13:29] [INFO ] Implicit Places using invariants and state equation in 1581 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2023-03-19 09:13:29] [INFO ] Invariant cache hit.
[2023-03-19 09:13:30] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2698 ms. Remains : 1343/1343 places, 1203/1203 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 313 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :2
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
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.
[2023-03-19 09:13:30] [INFO ] Invariant cache hit.
[2023-03-19 09:13:30] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:13:31] [INFO ] [Nat]Absence check using 221 positive place invariants in 78 ms returned sat
[2023-03-19 09:13:31] [INFO ] After 767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:32] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 1 ms to minimize.
[2023-03-19 09:13:32] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 1 ms to minimize.
[2023-03-19 09:13:32] [INFO ] Deduced a trap composed of 16 places in 212 ms of which 1 ms to minimize.
[2023-03-19 09:13:33] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 1 ms to minimize.
[2023-03-19 09:13:33] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 0 ms to minimize.
[2023-03-19 09:13:33] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2023-03-19 09:13:33] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 0 ms to minimize.
[2023-03-19 09:13:34] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 1 ms to minimize.
[2023-03-19 09:13:34] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2023-03-19 09:13:34] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 1 ms to minimize.
[2023-03-19 09:13:34] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 0 ms to minimize.
[2023-03-19 09:13:34] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-19 09:13:35] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2023-03-19 09:13:35] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 1 ms to minimize.
[2023-03-19 09:13:35] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 1 ms to minimize.
[2023-03-19 09:13:35] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2023-03-19 09:13:35] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 0 ms to minimize.
[2023-03-19 09:13:36] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 0 ms to minimize.
[2023-03-19 09:13:36] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 0 ms to minimize.
[2023-03-19 09:13:36] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 8 ms to minimize.
[2023-03-19 09:13:36] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 1 ms to minimize.
[2023-03-19 09:13:36] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 0 ms to minimize.
[2023-03-19 09:13:37] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 1 ms to minimize.
[2023-03-19 09:13:37] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 0 ms to minimize.
[2023-03-19 09:13:37] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 1 ms to minimize.
[2023-03-19 09:13:37] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 0 ms to minimize.
[2023-03-19 09:13:38] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 1 ms to minimize.
[2023-03-19 09:13:38] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2023-03-19 09:13:38] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6283 ms
[2023-03-19 09:13:38] [INFO ] After 7171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-19 09:13:38] [INFO ] After 7571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 1343 transition count 924
Reduce places removed 279 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 280 rules applied. Total rules applied 559 place count 1064 transition count 923
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 560 place count 1063 transition count 923
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 158 Pre rules applied. Total rules applied 560 place count 1063 transition count 765
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 876 place count 905 transition count 765
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 3 with 682 rules applied. Total rules applied 1558 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1559 place count 564 transition count 423
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 1561 place count 563 transition count 422
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1677 place count 505 transition count 422
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1678 place count 505 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1679 place count 504 transition count 421
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 5 with 58 rules applied. Total rules applied 1737 place count 504 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1738 place count 503 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1739 place count 502 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1739 place count 502 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1743 place count 500 transition count 418
Applied a total of 1743 rules in 190 ms. Remains 500 /1343 variables (removed 843) and now considering 418/1203 (removed 785) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 500/1343 places, 418/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 216648 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216648 steps, saw 163334 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 418 rows 500 cols
[2023-03-19 09:13:41] [INFO ] Computed 220 place invariants in 14 ms
[2023-03-19 09:13:41] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:13:42] [INFO ] [Nat]Absence check using 220 positive place invariants in 87 ms returned sat
[2023-03-19 09:13:42] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:13:42] [INFO ] After 61ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:42] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-19 09:13:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-19 09:13:42] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-19 09:13:42] [INFO ] After 888ms 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 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 418/418 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 500/500 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 418/418 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-19 09:13:42] [INFO ] Invariant cache hit.
[2023-03-19 09:13:43] [INFO ] Implicit Places using invariants in 368 ms returned [483, 487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 382 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 498/500 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 496 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 496 transition count 416
Applied a total of 4 rules in 12 ms. Remains 496 /498 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 496 cols
[2023-03-19 09:13:43] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-19 09:13:43] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-19 09:13:43] [INFO ] Invariant cache hit.
[2023-03-19 09:13:44] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 496/500 places, 416/418 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1369 ms. Remains : 496/500 places, 416/418 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 255151 steps, run timeout after 3011 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 255151 steps, saw 204875 distinct states, run finished after 3012 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 09:13:47] [INFO ] Invariant cache hit.
[2023-03-19 09:13:47] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:13:47] [INFO ] [Nat]Absence check using 218 positive place invariants in 134 ms returned sat
[2023-03-19 09:13:48] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:48] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-19 09:13:48] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 416/416 transitions.
Applied a total of 0 rules in 8 ms. Remains 496 /496 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 496/496 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 496 /496 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-03-19 09:13:48] [INFO ] Invariant cache hit.
[2023-03-19 09:13:48] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-19 09:13:48] [INFO ] Invariant cache hit.
[2023-03-19 09:13:49] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
[2023-03-19 09:13:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 09:13:49] [INFO ] Invariant cache hit.
[2023-03-19 09:13:49] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1375 ms. Remains : 496/496 places, 416/416 transitions.
Partial Free-agglomeration rule applied 112 times.
Drop transitions removed 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 112 place count 496 transition count 416
Applied a total of 112 rules in 16 ms. Remains 496 /496 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 416 rows 496 cols
[2023-03-19 09:13:49] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-19 09:13:49] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 09:13:49] [INFO ] [Nat]Absence check using 218 positive place invariants in 25 ms returned sat
[2023-03-19 09:13:50] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:50] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-19 09:13:50] [INFO ] After 145ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 09:13:50] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-19 09:13:50] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X (NOT (AND p2 (NOT p1))))), true, (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 695 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 193 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 221 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 395 ms.
Product exploration explored 100000 steps with 0 reset in 614 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1343 transition count 1203
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 98 Pre rules applied. Total rules applied 280 place count 1343 transition count 1282
Deduced a syphon composed of 378 places in 2 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 378 place count 1343 transition count 1282
Performed 382 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 760 places in 1 ms
Iterating global reduction 1 with 382 rules applied. Total rules applied 760 place count 1343 transition count 1283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 761 place count 1343 transition count 1282
Renaming transitions due to excessive name length > 1024 char.
Discarding 145 places :
Symmetric choice reduction at 2 with 145 rule applications. Total rules 906 place count 1198 transition count 1136
Deduced a syphon composed of 615 places in 1 ms
Iterating global reduction 2 with 145 rules applied. Total rules applied 1051 place count 1198 transition count 1136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 616 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1052 place count 1198 transition count 1136
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1054 place count 1196 transition count 1134
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1056 place count 1196 transition count 1134
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -328
Deduced a syphon composed of 691 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1133 place count 1196 transition count 1462
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1210 place count 1119 transition count 1308
Deduced a syphon composed of 614 places in 1 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1287 place count 1119 transition count 1308
Deduced a syphon composed of 614 places in 0 ms
Applied a total of 1287 rules in 770 ms. Remains 1119 /1343 variables (removed 224) and now considering 1308/1203 (removed -105) transitions.
[2023-03-19 09:13:54] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1308 rows 1119 cols
[2023-03-19 09:13:54] [INFO ] Computed 221 place invariants in 6 ms
[2023-03-19 09:13:54] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1119/1343 places, 1308/1203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1592 ms. Remains : 1119/1343 places, 1308/1203 transitions.
Built C files in :
/tmp/ltsmin12289243209218990798
[2023-03-19 09:13:54] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12289243209218990798
Running compilation step : cd /tmp/ltsmin12289243209218990798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1963 ms.
Running link step : cd /tmp/ltsmin12289243209218990798;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12289243209218990798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2289328163406190049.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1343/1343 places, 1203/1203 transitions.
Applied a total of 0 rules in 53 ms. Remains 1343 /1343 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1343 cols
[2023-03-19 09:14:10] [INFO ] Computed 221 place invariants in 4 ms
[2023-03-19 09:14:10] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-19 09:14:10] [INFO ] Invariant cache hit.
[2023-03-19 09:14:11] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1720 ms to find 0 implicit places.
[2023-03-19 09:14:11] [INFO ] Invariant cache hit.
[2023-03-19 09:14:12] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2548 ms. Remains : 1343/1343 places, 1203/1203 transitions.
Built C files in :
/tmp/ltsmin3720909394378708307
[2023-03-19 09:14:12] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3720909394378708307
Running compilation step : cd /tmp/ltsmin3720909394378708307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1973 ms.
Running link step : cd /tmp/ltsmin3720909394378708307;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin3720909394378708307;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5919922888976510734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 09:14:27] [INFO ] Flatten gal took : 48 ms
[2023-03-19 09:14:27] [INFO ] Flatten gal took : 30 ms
[2023-03-19 09:14:27] [INFO ] Time to serialize gal into /tmp/LTL1115232627778999727.gal : 5 ms
[2023-03-19 09:14:27] [INFO ] Time to serialize properties into /tmp/LTL2162636373172763801.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1115232627778999727.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2078569083650991788.hoa' '-atoms' '/tmp/LTL2162636373172763801.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2162636373172763801.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2078569083650991788.hoa
Detected timeout of ITS tools.
[2023-03-19 09:14:42] [INFO ] Flatten gal took : 37 ms
[2023-03-19 09:14:42] [INFO ] Flatten gal took : 27 ms
[2023-03-19 09:14:42] [INFO ] Time to serialize gal into /tmp/LTL18236467579317319341.gal : 4 ms
[2023-03-19 09:14:42] [INFO ] Time to serialize properties into /tmp/LTL17973120744428920417.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18236467579317319341.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17973120744428920417.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(("((p747==0)||(p1246==1))")||(G("((p69==0)||(p1045==1))"))))&&("((p747==0)||(p1246==1))"))))
Formula 0 simplified : X(!"((p747==0)||(p1246==1))" | F(!"((p747==0)||(p1246==1))" & F!"((p69==0)||(p1045==1))"))
Detected timeout of ITS tools.
[2023-03-19 09:14:58] [INFO ] Flatten gal took : 50 ms
[2023-03-19 09:14:58] [INFO ] Applying decomposition
[2023-03-19 09:14:58] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5296530230027774370.txt' '-o' '/tmp/graph5296530230027774370.bin' '-w' '/tmp/graph5296530230027774370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5296530230027774370.bin' '-l' '-1' '-v' '-w' '/tmp/graph5296530230027774370.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:14:58] [INFO ] Decomposing Gal with order
[2023-03-19 09:14:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:14:58] [INFO ] Removed a total of 200 redundant transitions.
[2023-03-19 09:14:58] [INFO ] Flatten gal took : 72 ms
[2023-03-19 09:14:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2023-03-19 09:14:58] [INFO ] Time to serialize gal into /tmp/LTL7194312347546433622.gal : 11 ms
[2023-03-19 09:14:58] [INFO ] Time to serialize properties into /tmp/LTL3587272356616530655.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7194312347546433622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3587272356616530655.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G(("((i10.u233.p747==0)||(i16.i0.i3.u389.p1246==1))")||(G("((i2.u27.p69==0)||(i15.i0.i0.u326.p1045==1))"))))&&("((i10.u233.p747=...191
Formula 0 simplified : X(!"((i10.u233.p747==0)||(i16.i0.i3.u389.p1246==1))" | F(!"((i10.u233.p747==0)||(i16.i0.i3.u389.p1246==1))" & F!"((i2.u27.p69==0)||(...183
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13565638680502141883
[2023-03-19 09:15:13] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13565638680502141883
Running compilation step : cd /tmp/ltsmin13565638680502141883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2170 ms.
Running link step : cd /tmp/ltsmin13565638680502141883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin13565638680502141883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](([]((LTLAPp1==true))||(LTLAPp0==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-10 finished in 138332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1064 transition count 766
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 906 transition count 766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 879 place count 903 transition count 763
Iterating global reduction 2 with 3 rules applied. Total rules applied 882 place count 903 transition count 763
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 882 place count 903 transition count 761
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 886 place count 901 transition count 761
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1560 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1561 place count 564 transition count 423
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 1563 place count 563 transition count 422
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1679 place count 505 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1681 place count 503 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1682 place count 502 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1682 place count 502 transition count 418
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 1686 place count 500 transition count 418
Applied a total of 1686 rules in 131 ms. Remains 500 /1345 variables (removed 845) and now considering 418/1205 (removed 787) transitions.
// Phase 1: matrix 418 rows 500 cols
[2023-03-19 09:15:28] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-19 09:15:29] [INFO ] Implicit Places using invariants in 392 ms returned [483, 487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 408 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 498/1345 places, 418/1205 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 496 transition count 416
Applied a total of 4 rules in 14 ms. Remains 496 /498 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 496 cols
[2023-03-19 09:15:29] [INFO ] Computed 218 place invariants in 1 ms
[2023-03-19 09:15:29] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-19 09:15:29] [INFO ] Invariant cache hit.
[2023-03-19 09:15:29] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 496/1345 places, 416/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1286 ms. Remains : 496/1345 places, 416/1205 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s277 0) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3 reset in 400 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-11 finished in 1754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1345 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1345/1345 places, 1205/1205 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1344 transition count 924
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 1064 transition count 924
Performed 158 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 158 Pre rules applied. Total rules applied 560 place count 1064 transition count 766
Deduced a syphon composed of 158 places in 1 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 876 place count 906 transition count 766
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 879 place count 903 transition count 763
Iterating global reduction 2 with 3 rules applied. Total rules applied 882 place count 903 transition count 763
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 882 place count 903 transition count 761
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 886 place count 901 transition count 761
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1560 place count 564 transition count 424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1561 place count 564 transition count 423
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 1563 place count 563 transition count 422
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1681 place count 504 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1683 place count 502 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1684 place count 501 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1684 place count 501 transition count 418
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 1688 place count 499 transition count 418
Applied a total of 1688 rules in 197 ms. Remains 499 /1345 variables (removed 846) and now considering 418/1205 (removed 787) transitions.
// Phase 1: matrix 418 rows 499 cols
[2023-03-19 09:15:30] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-19 09:15:30] [INFO ] Implicit Places using invariants in 312 ms returned [482, 486]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 314 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/1345 places, 418/1205 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 495 transition count 416
Applied a total of 4 rules in 14 ms. Remains 495 /497 variables (removed 2) and now considering 416/418 (removed 2) transitions.
// Phase 1: matrix 416 rows 495 cols
[2023-03-19 09:15:30] [INFO ] Computed 218 place invariants in 3 ms
[2023-03-19 09:15:31] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-19 09:15:31] [INFO ] Invariant cache hit.
[2023-03-19 09:15:31] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 495/1345 places, 416/1205 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1478 ms. Remains : 495/1345 places, 416/1205 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-020B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s22 0) (NEQ s279 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 378 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ShieldPPPt-PT-020B-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-020B-LTLCardinality-15 finished in 1922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((G(p2)||p1)))))'
[2023-03-19 09:15:32] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2405507925847025308
[2023-03-19 09:15:32] [INFO ] Applying decomposition
[2023-03-19 09:15:32] [INFO ] Computing symmetric may disable matrix : 1205 transitions.
[2023-03-19 09:15:32] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:15:32] [INFO ] Computing symmetric may enable matrix : 1205 transitions.
[2023-03-19 09:15:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:15:32] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14097085465097453819.txt' '-o' '/tmp/graph14097085465097453819.bin' '-w' '/tmp/graph14097085465097453819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14097085465097453819.bin' '-l' '-1' '-v' '-w' '/tmp/graph14097085465097453819.weights' '-q' '0' '-e' '0.001'
[2023-03-19 09:15:32] [INFO ] Decomposing Gal with order
[2023-03-19 09:15:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:15:32] [INFO ] Computing Do-Not-Accords matrix : 1205 transitions.
[2023-03-19 09:15:32] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 09:15:32] [INFO ] Built C files in 332ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2405507925847025308
Running compilation step : cd /tmp/ltsmin2405507925847025308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 09:15:32] [INFO ] Removed a total of 198 redundant transitions.
[2023-03-19 09:15:32] [INFO ] Flatten gal took : 53 ms
[2023-03-19 09:15:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-19 09:15:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality14989034640298438052.gal : 12 ms
[2023-03-19 09:15:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality14557648244831696820.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14989034640298438052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14557648244831696820.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(("((i9.u232.p747==0)||(i15.u389.p1246==1))")&&(G(("((i9.u232.p747==0)||(i15.u389.p1246==1))")||(G("((i0.i1.i4.u27.p69==0)||(i13.u...177
Formula 0 simplified : X(!"((i9.u232.p747==0)||(i15.u389.p1246==1))" | F(!"((i9.u232.p747==0)||(i15.u389.p1246==1))" & F!"((i0.i1.i4.u27.p69==0)||(i13.u326...169
Compilation finished in 3595 ms.
Running link step : cd /tmp/ltsmin2405507925847025308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 103 ms.
Running LTSmin : cd /tmp/ltsmin2405507925847025308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&[](([]((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.203: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.203: LTL layer: formula: X(((LTLAPp0==true)&&[](([]((LTLAPp2==true))||(LTLAPp1==true)))))
pins2lts-mc-linux64( 2/ 8), 0.203: "X(((LTLAPp0==true)&&[](([]((LTLAPp2==true))||(LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.204: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.223: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.225: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.244: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.256: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.263: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.270: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.273: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.299: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.669: DFS-FIFO for weak LTL, using special progress label 1209
pins2lts-mc-linux64( 0/ 8), 0.669: There are 1210 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.669: State length is 1346, there are 1216 groups
pins2lts-mc-linux64( 0/ 8), 0.669: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.669: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.669: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.669: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.752: ~1 levels ~960 states ~5224 transitions
pins2lts-mc-linux64( 3/ 8), 0.860: ~1 levels ~1920 states ~11288 transitions
pins2lts-mc-linux64( 3/ 8), 1.016: ~1 levels ~3840 states ~25312 transitions
pins2lts-mc-linux64( 3/ 8), 1.207: ~1 levels ~7680 states ~53568 transitions
pins2lts-mc-linux64( 3/ 8), 1.909: ~1 levels ~15360 states ~115840 transitions
pins2lts-mc-linux64( 3/ 8), 3.242: ~1 levels ~30720 states ~243528 transitions
pins2lts-mc-linux64( 3/ 8), 5.665: ~1 levels ~61440 states ~513640 transitions
pins2lts-mc-linux64( 3/ 8), 10.381: ~1 levels ~122880 states ~1095376 transitions
pins2lts-mc-linux64( 0/ 8), 19.248: ~1 levels ~245760 states ~2082984 transitions
pins2lts-mc-linux64( 0/ 8), 36.706: ~1 levels ~491520 states ~4666968 transitions
pins2lts-mc-linux64( 0/ 8), 70.858: ~1 levels ~983040 states ~9451344 transitions
pins2lts-mc-linux64( 0/ 8), 141.692: ~1 levels ~1966080 states ~20941656 transitions
pins2lts-mc-linux64( 0/ 8), 281.172: ~1 levels ~3932160 states ~42892496 transitions
pins2lts-mc-linux64( 0/ 8), 569.639: ~1 levels ~7864320 states ~91408056 transitions
pins2lts-mc-linux64( 3/ 8), 928.172: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 928.287:
pins2lts-mc-linux64( 0/ 8), 928.287: mean standard work distribution: 1.4% (states) 3.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 928.287:
pins2lts-mc-linux64( 0/ 8), 928.287: Explored 12292527 states 158371303 transitions, fanout: 12.884
pins2lts-mc-linux64( 0/ 8), 928.287: Total exploration time 927.610 sec (927.500 sec minimum, 927.545 sec on average)
pins2lts-mc-linux64( 0/ 8), 928.287: States per second: 13252, Transitions per second: 170730
pins2lts-mc-linux64( 0/ 8), 928.287:
pins2lts-mc-linux64( 0/ 8), 928.287: Progress states detected: 30088740
pins2lts-mc-linux64( 0/ 8), 928.287: Redundant explorations: -59.1458
pins2lts-mc-linux64( 0/ 8), 928.287:
pins2lts-mc-linux64( 0/ 8), 928.287: Queue width: 8B, total height: 27861150, memory: 212.56MB
pins2lts-mc-linux64( 0/ 8), 928.287: Tree memory: 485.6MB, 16.9 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 928.287: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 928.287: Stored 1520 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 928.287: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 928.287: Est. total memory use: 698.1MB (~1236.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2405507925847025308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&[](([]((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2405507925847025308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&[](([]((LTLAPp2==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-19 09:37:16] [INFO ] Applying decomposition
[2023-03-19 09:37:16] [INFO ] Flatten gal took : 216 ms
[2023-03-19 09:37:16] [INFO ] Decomposing Gal with order
[2023-03-19 09:37:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 09:37:17] [INFO ] Removed a total of 59 redundant transitions.
[2023-03-19 09:37:17] [INFO ] Flatten gal took : 406 ms
[2023-03-19 09:37:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 160 ms.
[2023-03-19 09:37:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality8426460307017009303.gal : 113 ms
[2023-03-19 09:37:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality5035757143986294345.ltl : 27 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8426460307017009303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5035757143986294345.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i1.u226.p747==0)||(i0.i0.i0.i0.i1.u356.p1246==1))")&&(G(("((i0.i0.i0.i0.i0.i0.i0...381
Formula 0 simplified : X(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i1.u226.p747==0)||(i0.i0.i0.i0.i1.u356.p1246==1))" | F(!"((i0.i0.i0.i0.i0.i0.i0.i...373
Detected timeout of ITS tools.
[2023-03-19 09:59:20] [INFO ] Flatten gal took : 703 ms
[2023-03-19 09:59:23] [INFO ] Input system was already deterministic with 1205 transitions.
[2023-03-19 09:59:23] [INFO ] Transformed 1345 places.
[2023-03-19 09:59:23] [INFO ] Transformed 1205 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-19 09:59:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality15185199605681412503.gal : 44 ms
[2023-03-19 09:59:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality9639126382627993492.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15185199605681412503.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9639126382627993492.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(("((p747==0)||(p1246==1))")&&(G(("((p747==0)||(p1246==1))")||(G("((p69==0)||(p1045==1))")))))))
Formula 0 simplified : X(!"((p747==0)||(p1246==1))" | F(!"((p747==0)||(p1246==1))" & F!"((p69==0)||(p1045==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 3865016 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16008092 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-020B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-020B, 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 r389-oct2-167903713800635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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