Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 489K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679174434285

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=ShieldRVt-PT-040B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 21:20:35] [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-18 21:20:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:20:36] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-18 21:20:36] [INFO ] Transformed 2003 places.
[2023-03-18 21:20:36] [INFO ] Transformed 2003 transitions.
[2023-03-18 21:20:36] [INFO ] Found NUPN structural information;
[2023-03-18 21:20:36] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-040B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 428 places :
Symmetric choice reduction at 0 with 428 rule applications. Total rules 428 place count 1575 transition count 1575
Iterating global reduction 0 with 428 rules applied. Total rules applied 856 place count 1575 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 1574 transition count 1574
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 1574 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 859 place count 1573 transition count 1573
Iterating global reduction 0 with 1 rules applied. Total rules applied 860 place count 1573 transition count 1573
Applied a total of 860 rules in 867 ms. Remains 1573 /2003 variables (removed 430) and now considering 1573/2003 (removed 430) transitions.
// Phase 1: matrix 1573 rows 1573 cols
[2023-03-18 21:20:37] [INFO ] Computed 161 place invariants in 54 ms
[2023-03-18 21:20:38] [INFO ] Implicit Places using invariants in 828 ms returned []
[2023-03-18 21:20:38] [INFO ] Invariant cache hit.
[2023-03-18 21:20:39] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
[2023-03-18 21:20:39] [INFO ] Invariant cache hit.
[2023-03-18 21:20:40] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1573/2003 places, 1573/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4199 ms. Remains : 1573/2003 places, 1573/2003 transitions.
Support contains 33 out of 1573 places after structural reductions.
[2023-03-18 21:20:41] [INFO ] Flatten gal took : 215 ms
[2023-03-18 21:20:41] [INFO ] Flatten gal took : 98 ms
[2023-03-18 21:20:41] [INFO ] Input system was already deterministic with 1573 transitions.
Support contains 29 out of 1573 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 21:20:42] [INFO ] Invariant cache hit.
[2023-03-18 21:20:42] [INFO ] [Real]Absence check using 161 positive place invariants in 53 ms returned sat
[2023-03-18 21:20:43] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 21:20:43] [INFO ] [Nat]Absence check using 161 positive place invariants in 74 ms returned sat
[2023-03-18 21:20:44] [INFO ] After 1200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 21:20:45] [INFO ] Deduced a trap composed of 22 places in 377 ms of which 16 ms to minimize.
[2023-03-18 21:20:45] [INFO ] Deduced a trap composed of 34 places in 364 ms of which 1 ms to minimize.
[2023-03-18 21:20:46] [INFO ] Deduced a trap composed of 23 places in 348 ms of which 1 ms to minimize.
[2023-03-18 21:20:46] [INFO ] Deduced a trap composed of 61 places in 290 ms of which 3 ms to minimize.
[2023-03-18 21:20:46] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 1 ms to minimize.
[2023-03-18 21:20:47] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 1 ms to minimize.
[2023-03-18 21:20:47] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 2 ms to minimize.
[2023-03-18 21:20:47] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 0 ms to minimize.
[2023-03-18 21:20:48] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 0 ms to minimize.
[2023-03-18 21:20:48] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 1 ms to minimize.
[2023-03-18 21:20:48] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 1 ms to minimize.
[2023-03-18 21:20:49] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 0 ms to minimize.
[2023-03-18 21:20:49] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 0 ms to minimize.
[2023-03-18 21:20:49] [INFO ] Deduced a trap composed of 57 places in 195 ms of which 1 ms to minimize.
[2023-03-18 21:20:49] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 1 ms to minimize.
[2023-03-18 21:20:50] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 0 ms to minimize.
[2023-03-18 21:20:50] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 1 ms to minimize.
[2023-03-18 21:20:50] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 1 ms to minimize.
[2023-03-18 21:20:50] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 1 ms to minimize.
[2023-03-18 21:20:51] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 0 ms to minimize.
[2023-03-18 21:20:51] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6219 ms
[2023-03-18 21:20:52] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 1 ms to minimize.
[2023-03-18 21:20:52] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2023-03-18 21:20:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2023-03-18 21:20:52] [INFO ] After 8612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 547 ms.
[2023-03-18 21:20:52] [INFO ] After 9801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 363 ms.
Support contains 16 out of 1573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Drop transitions removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 428 rules applied. Total rules applied 428 place count 1573 transition count 1145
Reduce places removed 428 places and 0 transitions.
Iterating post reduction 1 with 428 rules applied. Total rules applied 856 place count 1145 transition count 1145
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 856 place count 1145 transition count 832
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1482 place count 832 transition count 832
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1484 place count 830 transition count 830
Iterating global reduction 2 with 2 rules applied. Total rules applied 1486 place count 830 transition count 830
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1486 place count 830 transition count 828
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1490 place count 828 transition count 828
Performed 365 Post agglomeration using F-continuation condition.Transition count delta: 365
Deduced a syphon composed of 365 places in 1 ms
Reduce places removed 365 places and 0 transitions.
Iterating global reduction 2 with 730 rules applied. Total rules applied 2220 place count 463 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2221 place count 463 transition count 462
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 2223 place count 462 transition count 461
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2425 place count 361 transition count 553
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 2455 place count 346 transition count 568
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2456 place count 346 transition count 567
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2458 place count 346 transition count 565
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2460 place count 344 transition count 565
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2462 place count 344 transition count 563
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2463 place count 344 transition count 563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2464 place count 343 transition count 562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2465 place count 342 transition count 562
Applied a total of 2465 rules in 463 ms. Remains 342 /1573 variables (removed 1231) and now considering 562/1573 (removed 1011) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 342/1573 places, 562/1573 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 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 44 ms. (steps per millisecond=227 ) 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 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 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 562 rows 342 cols
[2023-03-18 21:20:54] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-18 21:20:54] [INFO ] [Real]Absence check using 160 positive place invariants in 34 ms returned sat
[2023-03-18 21:20:54] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 21:20:54] [INFO ] [Nat]Absence check using 160 positive place invariants in 14 ms returned sat
[2023-03-18 21:20:54] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 21:20:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:20:54] [INFO ] After 115ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 21:20:55] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-18 21:20:55] [INFO ] After 772ms 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 94 ms.
Support contains 10 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 562/562 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 342 transition count 559
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 339 transition count 559
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 2 with 2 rules applied. Total rules applied 8 place count 338 transition count 558
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 336 transition count 558
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 336 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 335 transition count 557
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 334 transition count 556
Applied a total of 15 rules in 39 ms. Remains 334 /342 variables (removed 8) and now considering 556/562 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 334/342 places, 556/562 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 66 ms. (steps per millisecond=151 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 212232 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212232 steps, saw 140122 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 556 rows 334 cols
[2023-03-18 21:20:58] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-18 21:20:58] [INFO ] [Real]Absence check using 160 positive place invariants in 16 ms returned sat
[2023-03-18 21:20:58] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 21:20:59] [INFO ] [Nat]Absence check using 160 positive place invariants in 16 ms returned sat
[2023-03-18 21:20:59] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 21:20:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-18 21:20:59] [INFO ] After 51ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-18 21:20:59] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-18 21:20:59] [INFO ] After 476ms 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 75 ms.
Support contains 10 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 556/556 transitions.
Applied a total of 0 rules in 9 ms. Remains 334 /334 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 334/334 places, 556/556 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 556/556 transitions.
Applied a total of 0 rules in 18 ms. Remains 334 /334 variables (removed 0) and now considering 556/556 (removed 0) transitions.
[2023-03-18 21:20:59] [INFO ] Invariant cache hit.
[2023-03-18 21:20:59] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-18 21:20:59] [INFO ] Invariant cache hit.
[2023-03-18 21:21:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-18 21:21:00] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
[2023-03-18 21:21:00] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-18 21:21:00] [INFO ] Invariant cache hit.
[2023-03-18 21:21:00] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1097 ms. Remains : 334/334 places, 556/556 transitions.
Graph (trivial) has 151 edges and 334 vertex of which 4 / 334 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1122 edges and 332 vertex of which 330 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 148 edges and 328 vertex of which 4 / 328 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 326 transition count 547
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 147 edges and 324 vertex of which 6 / 324 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 321 transition count 538
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 144 edges and 319 vertex of which 6 / 319 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 34 place count 316 transition count 527
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 142 edges and 313 vertex of which 8 / 313 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 49 place count 309 transition count 516
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1018 edges and 305 vertex of which 302 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 137 edges and 302 vertex of which 8 / 302 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 20 rules applied. Total rules applied 69 place count 298 transition count 499
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 294 vertex of which 6 / 294 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 88 place count 291 transition count 485
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 129 edges and 288 vertex of which 4 / 288 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 6 with 13 rules applied. Total rules applied 101 place count 286 transition count 476
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 126 edges and 284 vertex of which 2 / 284 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 9 rules applied. Total rules applied 110 place count 283 transition count 470
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 113 place count 283 transition count 467
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 117 place count 283 transition count 463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 117 place count 283 transition count 462
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 120 place count 281 transition count 462
Applied a total of 120 rules in 47 ms. Remains 281 /334 variables (removed 53) and now considering 462/556 (removed 94) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 462 rows 281 cols
[2023-03-18 21:21:00] [INFO ] Computed 134 place invariants in 1 ms
[2023-03-18 21:21:00] [INFO ] [Real]Absence check using 134 positive place invariants in 24 ms returned sat
[2023-03-18 21:21:00] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 21:21:00] [INFO ] [Nat]Absence check using 134 positive place invariants in 12 ms returned sat
[2023-03-18 21:21:00] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 21:21:01] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-18 21:21:01] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 480 stabilizing places and 480 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((X(p0)&&(G(p1)||G(p2)))))'
Support contains 8 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1564 transition count 1564
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1564 transition count 1564
Applied a total of 18 rules in 121 ms. Remains 1564 /1573 variables (removed 9) and now considering 1564/1573 (removed 9) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2023-03-18 21:21:01] [INFO ] Computed 161 place invariants in 18 ms
[2023-03-18 21:21:02] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-18 21:21:02] [INFO ] Invariant cache hit.
[2023-03-18 21:21:03] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2023-03-18 21:21:03] [INFO ] Invariant cache hit.
[2023-03-18 21:21:03] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1564/1573 places, 1564/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2480 ms. Remains : 1564/1573 places, 1564/1573 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s1310 0) (EQ s1288 1) (EQ s357 0) (EQ s714 1)), p2:(OR (EQ s835 0) (EQ s1048 1)), p0:(AND (EQ s60 0) (EQ s436 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-03 finished in 2841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1563 transition count 1563
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1563 transition count 1563
Applied a total of 20 rules in 163 ms. Remains 1563 /1573 variables (removed 10) and now considering 1563/1573 (removed 10) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2023-03-18 21:21:04] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-18 21:21:04] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-18 21:21:04] [INFO ] Invariant cache hit.
[2023-03-18 21:21:05] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2023-03-18 21:21:05] [INFO ] Invariant cache hit.
[2023-03-18 21:21:06] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1563/1573 places, 1563/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2108 ms. Remains : 1563/1573 places, 1563/1573 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s962 0) (EQ s1016 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 52856 steps with 1 reset in 317 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-05 finished in 2499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||G(!p1)||(!p1&&F(p0))))))'
Support contains 4 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 100 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-18 21:21:06] [INFO ] Computed 161 place invariants in 13 ms
[2023-03-18 21:21:07] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-18 21:21:07] [INFO ] Invariant cache hit.
[2023-03-18 21:21:08] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2023-03-18 21:21:08] [INFO ] Invariant cache hit.
[2023-03-18 21:21:08] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2017 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s852 0) (EQ s877 1)), p0:(AND (NEQ s578 0) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13 reset in 377 ms.
Product exploration explored 100000 steps with 5 reset in 526 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1561 stabilizing places and 478/1561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 283 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 501 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 8 factoid took 305 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 90 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
[2023-03-18 21:21:10] [INFO ] Invariant cache hit.
[2023-03-18 21:21:11] [INFO ] [Real]Absence check using 161 positive place invariants in 95 ms returned sat
[2023-03-18 21:21:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:21:14] [INFO ] [Real]Absence check using state equation in 3074 ms returned sat
[2023-03-18 21:21:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:21:15] [INFO ] [Nat]Absence check using 161 positive place invariants in 146 ms returned sat
[2023-03-18 21:21:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:21:18] [INFO ] [Nat]Absence check using state equation in 3783 ms returned sat
[2023-03-18 21:21:19] [INFO ] Computed and/alt/rep : 1560/2281/1560 causal constraints (skipped 0 transitions) in 101 ms.
[2023-03-18 21:21:30] [INFO ] Deduced a trap composed of 12 places in 733 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:21:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p1 (NOT p0))
Could not prove EG (AND p1 (NOT p0))
Support contains 4 out of 1561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Applied a total of 0 rules in 89 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
[2023-03-18 21:21:30] [INFO ] Invariant cache hit.
[2023-03-18 21:21:30] [INFO ] Implicit Places using invariants in 673 ms returned []
[2023-03-18 21:21:30] [INFO ] Invariant cache hit.
[2023-03-18 21:21:32] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1706 ms to find 0 implicit places.
[2023-03-18 21:21:32] [INFO ] Invariant cache hit.
[2023-03-18 21:21:32] [INFO ] Dead Transitions using invariants and state equation in 714 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2534 ms. Remains : 1561/1561 places, 1561/1561 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1561 stabilizing places and 478/1561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 267 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:21:33] [INFO ] Invariant cache hit.
[2023-03-18 21:21:33] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:21:33] [INFO ] [Nat]Absence check using 161 positive place invariants in 54 ms returned sat
[2023-03-18 21:21:34] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:21:34] [INFO ] Deduced a trap composed of 20 places in 381 ms of which 1 ms to minimize.
[2023-03-18 21:21:35] [INFO ] Deduced a trap composed of 21 places in 355 ms of which 2 ms to minimize.
[2023-03-18 21:21:35] [INFO ] Deduced a trap composed of 32 places in 421 ms of which 1 ms to minimize.
[2023-03-18 21:21:36] [INFO ] Deduced a trap composed of 26 places in 428 ms of which 1 ms to minimize.
[2023-03-18 21:21:36] [INFO ] Deduced a trap composed of 26 places in 436 ms of which 1 ms to minimize.
[2023-03-18 21:21:37] [INFO ] Deduced a trap composed of 44 places in 436 ms of which 1 ms to minimize.
[2023-03-18 21:21:37] [INFO ] Deduced a trap composed of 29 places in 549 ms of which 2 ms to minimize.
[2023-03-18 21:21:38] [INFO ] Deduced a trap composed of 43 places in 443 ms of which 1 ms to minimize.
[2023-03-18 21:21:38] [INFO ] Deduced a trap composed of 25 places in 425 ms of which 2 ms to minimize.
[2023-03-18 21:21:39] [INFO ] Deduced a trap composed of 27 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:21:39] [INFO ] Deduced a trap composed of 42 places in 388 ms of which 1 ms to minimize.
[2023-03-18 21:21:40] [INFO ] Deduced a trap composed of 36 places in 337 ms of which 1 ms to minimize.
[2023-03-18 21:21:40] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 1 ms to minimize.
[2023-03-18 21:21:40] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 0 ms to minimize.
[2023-03-18 21:21:41] [INFO ] Deduced a trap composed of 48 places in 293 ms of which 1 ms to minimize.
[2023-03-18 21:21:41] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 1 ms to minimize.
[2023-03-18 21:21:41] [INFO ] Deduced a trap composed of 42 places in 322 ms of which 0 ms to minimize.
[2023-03-18 21:21:42] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 1 ms to minimize.
[2023-03-18 21:21:42] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7842 ms
[2023-03-18 21:21:42] [INFO ] After 8566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-18 21:21:42] [INFO ] After 8887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 260 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 8 factoid took 342 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
[2023-03-18 21:21:43] [INFO ] Invariant cache hit.
[2023-03-18 21:21:43] [INFO ] [Real]Absence check using 161 positive place invariants in 97 ms returned sat
[2023-03-18 21:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:21:47] [INFO ] [Real]Absence check using state equation in 3427 ms returned sat
[2023-03-18 21:21:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:21:47] [INFO ] [Nat]Absence check using 161 positive place invariants in 142 ms returned sat
[2023-03-18 21:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:21:51] [INFO ] [Nat]Absence check using state equation in 3301 ms returned sat
[2023-03-18 21:21:51] [INFO ] Computed and/alt/rep : 1560/2281/1560 causal constraints (skipped 0 transitions) in 85 ms.
[2023-03-18 21:22:03] [INFO ] Deduced a trap composed of 12 places in 927 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:22:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p1 (NOT p0))
Could not prove EG (AND p1 (NOT p0))
Stuttering acceptance computed with spot in 129 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 467 ms.
Stack based approach found an accepted trace after 20769 steps with 14 reset with depth 5424 and stack size 5327 in 166 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-08 finished in 57077 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 1 out of 1573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 436 transitions
Trivial Post-agglo rules discarded 436 transitions
Performed 436 trivial Post agglomeration. Transition count delta: 436
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 1572 transition count 1136
Reduce places removed 436 places and 0 transitions.
Iterating post reduction 1 with 436 rules applied. Total rules applied 872 place count 1136 transition count 1136
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 872 place count 1136 transition count 822
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1500 place count 822 transition count 822
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1510 place count 812 transition count 812
Iterating global reduction 2 with 10 rules applied. Total rules applied 1520 place count 812 transition count 812
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1520 place count 812 transition count 802
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1540 place count 802 transition count 802
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 2254 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 445 transition count 444
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 2257 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2459 place count 343 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2495 place count 325 transition count 561
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2497 place count 323 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2498 place count 322 transition count 559
Applied a total of 2498 rules in 221 ms. Remains 322 /1573 variables (removed 1251) and now considering 559/1573 (removed 1014) transitions.
// Phase 1: matrix 559 rows 322 cols
[2023-03-18 21:22:04] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-18 21:22:04] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-18 21:22:04] [INFO ] Invariant cache hit.
[2023-03-18 21:22:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-18 21:22:04] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
[2023-03-18 21:22:04] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:22:04] [INFO ] Invariant cache hit.
[2023-03-18 21:22:05] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1573 places, 559/1573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1356 ms. Remains : 322/1573 places, 559/1573 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-09 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 s265 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-09 finished in 1459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1572 transition count 1135
Reduce places removed 437 places and 0 transitions.
Iterating post reduction 1 with 437 rules applied. Total rules applied 874 place count 1135 transition count 1135
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 874 place count 1135 transition count 821
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1502 place count 821 transition count 821
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1510 place count 813 transition count 813
Iterating global reduction 2 with 8 rules applied. Total rules applied 1518 place count 813 transition count 813
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1518 place count 813 transition count 805
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1534 place count 805 transition count 805
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 2 with 720 rules applied. Total rules applied 2254 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 445 transition count 444
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 2257 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2459 place count 343 transition count 542
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2495 place count 325 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2497 place count 323 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2498 place count 322 transition count 558
Applied a total of 2498 rules in 226 ms. Remains 322 /1573 variables (removed 1251) and now considering 558/1573 (removed 1015) transitions.
// Phase 1: matrix 558 rows 322 cols
[2023-03-18 21:22:05] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-18 21:22:05] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-18 21:22:05] [INFO ] Invariant cache hit.
[2023-03-18 21:22:05] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-18 21:22:05] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:22:05] [INFO ] Invariant cache hit.
[2023-03-18 21:22:06] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1573 places, 558/1573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 901 ms. Remains : 322/1573 places, 558/1573 transitions.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s6 0) (EQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19 reset in 394 ms.
Product exploration explored 100000 steps with 23 reset in 433 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 185 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 39 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27598 steps, run visited all 1 properties in 224 ms. (steps per millisecond=123 )
Probabilistic random walk after 27598 steps, saw 17184 distinct states, run finished after 225 ms. (steps per millisecond=122 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLCardinality-11 finished in 2444 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(G(p0)))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 160 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-18 21:22:07] [INFO ] Computed 161 place invariants in 11 ms
[2023-03-18 21:22:08] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-18 21:22:08] [INFO ] Invariant cache hit.
[2023-03-18 21:22:09] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
[2023-03-18 21:22:09] [INFO ] Invariant cache hit.
[2023-03-18 21:22:10] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2350 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s880 0) (NEQ s468 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-12 finished in 2486 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(G((G(p1)||p0))))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 160 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
[2023-03-18 21:22:10] [INFO ] Invariant cache hit.
[2023-03-18 21:22:10] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-18 21:22:10] [INFO ] Invariant cache hit.
[2023-03-18 21:22:11] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2023-03-18 21:22:11] [INFO ] Invariant cache hit.
[2023-03-18 21:22:12] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2323 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s704 0) (EQ s1507 1)), p0:(OR (EQ s704 0) (EQ s1507 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 377 ms.
Product exploration explored 100000 steps with 2 reset in 456 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 362 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 107 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 197548 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197548 steps, saw 98311 distinct states, run finished after 3002 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:22:17] [INFO ] Invariant cache hit.
[2023-03-18 21:22:17] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-18 21:22:17] [INFO ] [Nat]Absence check using 161 positive place invariants in 38 ms returned sat
[2023-03-18 21:22:18] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-18 21:22:18] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 1 ms to minimize.
[2023-03-18 21:22:18] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 1 ms to minimize.
[2023-03-18 21:22:19] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 1 ms to minimize.
[2023-03-18 21:22:19] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 2 ms to minimize.
[2023-03-18 21:22:19] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 1 ms to minimize.
[2023-03-18 21:22:19] [INFO ] Deduced a trap composed of 30 places in 244 ms of which 1 ms to minimize.
[2023-03-18 21:22:20] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 1 ms to minimize.
[2023-03-18 21:22:20] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 1 ms to minimize.
[2023-03-18 21:22:20] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 21 ms to minimize.
[2023-03-18 21:22:21] [INFO ] Deduced a trap composed of 20 places in 297 ms of which 1 ms to minimize.
[2023-03-18 21:22:21] [INFO ] Deduced a trap composed of 48 places in 253 ms of which 1 ms to minimize.
[2023-03-18 21:22:21] [INFO ] Deduced a trap composed of 43 places in 214 ms of which 1 ms to minimize.
[2023-03-18 21:22:21] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 0 ms to minimize.
[2023-03-18 21:22:22] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 1 ms to minimize.
[2023-03-18 21:22:22] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 1 ms to minimize.
[2023-03-18 21:22:22] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 0 ms to minimize.
[2023-03-18 21:22:22] [INFO ] Deduced a trap composed of 44 places in 181 ms of which 1 ms to minimize.
[2023-03-18 21:22:23] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 3 ms to minimize.
[2023-03-18 21:22:23] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 0 ms to minimize.
[2023-03-18 21:22:23] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 1 ms to minimize.
[2023-03-18 21:22:23] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2023-03-18 21:22:23] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 0 ms to minimize.
[2023-03-18 21:22:24] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 0 ms to minimize.
[2023-03-18 21:22:24] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 0 ms to minimize.
[2023-03-18 21:22:24] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 1 ms to minimize.
[2023-03-18 21:22:24] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 1 ms to minimize.
[2023-03-18 21:22:24] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 0 ms to minimize.
[2023-03-18 21:22:25] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 0 ms to minimize.
[2023-03-18 21:22:25] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 0 ms to minimize.
[2023-03-18 21:22:25] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 0 ms to minimize.
[2023-03-18 21:22:25] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 0 ms to minimize.
[2023-03-18 21:22:25] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 1 ms to minimize.
[2023-03-18 21:22:26] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 1 ms to minimize.
[2023-03-18 21:22:26] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 0 ms to minimize.
[2023-03-18 21:22:26] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 8033 ms
[2023-03-18 21:22:26] [INFO ] After 8757ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-18 21:22:26] [INFO ] After 9203ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1561 transition count 1124
Reduce places removed 437 places and 0 transitions.
Iterating post reduction 1 with 437 rules applied. Total rules applied 874 place count 1124 transition count 1124
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 320 Pre rules applied. Total rules applied 874 place count 1124 transition count 804
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 640 rules applied. Total rules applied 1514 place count 804 transition count 804
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 0 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 2232 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2233 place count 445 transition count 444
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 2235 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2437 place count 343 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2473 place count 325 transition count 561
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2474 place count 325 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2475 place count 324 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2476 place count 323 transition count 559
Applied a total of 2476 rules in 177 ms. Remains 323 /1561 variables (removed 1238) and now considering 559/1561 (removed 1002) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 323/1561 places, 559/1561 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) 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 3) 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 3) seen :0
Finished probabilistic random walk after 14403 steps, run visited all 3 properties in 145 ms. (steps per millisecond=99 )
Probabilistic random walk after 14403 steps, saw 9198 distinct states, run finished after 145 ms. (steps per millisecond=99 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 313 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Applied a total of 0 rules in 65 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
[2023-03-18 21:22:27] [INFO ] Invariant cache hit.
[2023-03-18 21:22:28] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-18 21:22:28] [INFO ] Invariant cache hit.
[2023-03-18 21:22:29] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2023-03-18 21:22:29] [INFO ] Invariant cache hit.
[2023-03-18 21:22:30] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2297 ms. Remains : 1561/1561 places, 1561/1561 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 244652 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244652 steps, saw 117546 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:22:33] [INFO ] Invariant cache hit.
[2023-03-18 21:22:33] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:22:33] [INFO ] [Nat]Absence check using 161 positive place invariants in 60 ms returned sat
[2023-03-18 21:22:34] [INFO ] After 631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:22:34] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 1 ms to minimize.
[2023-03-18 21:22:35] [INFO ] Deduced a trap composed of 26 places in 358 ms of which 1 ms to minimize.
[2023-03-18 21:22:35] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 1 ms to minimize.
[2023-03-18 21:22:36] [INFO ] Deduced a trap composed of 37 places in 329 ms of which 1 ms to minimize.
[2023-03-18 21:22:36] [INFO ] Deduced a trap composed of 27 places in 407 ms of which 1 ms to minimize.
[2023-03-18 21:22:37] [INFO ] Deduced a trap composed of 30 places in 345 ms of which 1 ms to minimize.
[2023-03-18 21:22:37] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 1 ms to minimize.
[2023-03-18 21:22:37] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 1 ms to minimize.
[2023-03-18 21:22:38] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 1 ms to minimize.
[2023-03-18 21:22:38] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 0 ms to minimize.
[2023-03-18 21:22:38] [INFO ] Deduced a trap composed of 48 places in 258 ms of which 1 ms to minimize.
[2023-03-18 21:22:39] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 1 ms to minimize.
[2023-03-18 21:22:39] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 1 ms to minimize.
[2023-03-18 21:22:39] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 1 ms to minimize.
[2023-03-18 21:22:39] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 1 ms to minimize.
[2023-03-18 21:22:40] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 1 ms to minimize.
[2023-03-18 21:22:40] [INFO ] Deduced a trap composed of 44 places in 217 ms of which 1 ms to minimize.
[2023-03-18 21:22:40] [INFO ] Deduced a trap composed of 48 places in 205 ms of which 1 ms to minimize.
[2023-03-18 21:22:40] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 1 ms to minimize.
[2023-03-18 21:22:41] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 1 ms to minimize.
[2023-03-18 21:22:41] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 1 ms to minimize.
[2023-03-18 21:22:41] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 0 ms to minimize.
[2023-03-18 21:22:41] [INFO ] Deduced a trap composed of 42 places in 215 ms of which 0 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 57 places in 206 ms of which 0 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 1 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 1 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 0 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 0 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 1 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 1 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 1 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 67 places in 148 ms of which 0 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 1 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 1 ms to minimize.
[2023-03-18 21:22:44] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 9517 ms
[2023-03-18 21:22:44] [INFO ] After 10181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-18 21:22:44] [INFO ] After 10543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1561 transition count 1124
Reduce places removed 437 places and 0 transitions.
Iterating post reduction 1 with 437 rules applied. Total rules applied 874 place count 1124 transition count 1124
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 320 Pre rules applied. Total rules applied 874 place count 1124 transition count 804
Deduced a syphon composed of 320 places in 0 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 640 rules applied. Total rules applied 1514 place count 804 transition count 804
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 0 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 2232 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2233 place count 445 transition count 444
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 2235 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2437 place count 343 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2473 place count 325 transition count 561
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2474 place count 325 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2475 place count 324 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2476 place count 323 transition count 559
Applied a total of 2476 rules in 111 ms. Remains 323 /1561 variables (removed 1238) and now considering 559/1561 (removed 1002) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 323/1561 places, 559/1561 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14403 steps, run visited all 1 properties in 81 ms. (steps per millisecond=177 )
Probabilistic random walk after 14403 steps, saw 9198 distinct states, run finished after 81 ms. (steps per millisecond=177 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 326 ms.
Product exploration explored 100000 steps with 1 reset in 505 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Performed 437 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1561 transition count 1561
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 160 Pre rules applied. Total rules applied 437 place count 1561 transition count 1721
Deduced a syphon composed of 597 places in 2 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 597 place count 1561 transition count 1721
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1076 places in 1 ms
Iterating global reduction 1 with 479 rules applied. Total rules applied 1076 place count 1561 transition count 1721
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1077 place count 1561 transition count 1720
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1396 place count 1242 transition count 1401
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 1715 place count 1242 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 758 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1716 place count 1242 transition count 1401
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1718 place count 1240 transition count 1399
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1720 place count 1240 transition count 1399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 857 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1821 place count 1240 transition count 2131
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1922 place count 1139 transition count 1929
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2023 place count 1139 transition count 1929
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 814 places in 1 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2081 place count 1139 transition count 2344
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2139 place count 1081 transition count 2228
Deduced a syphon composed of 756 places in 0 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2197 place count 1081 transition count 2228
Deduced a syphon composed of 756 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2200 place count 1081 transition count 2225
Deduced a syphon composed of 756 places in 0 ms
Applied a total of 2200 rules in 1082 ms. Remains 1081 /1561 variables (removed 480) and now considering 2225/1561 (removed -664) transitions.
[2023-03-18 21:22:46] [INFO ] Redundant transitions in 56 ms returned []
// Phase 1: matrix 2225 rows 1081 cols
[2023-03-18 21:22:46] [INFO ] Computed 161 place invariants in 25 ms
[2023-03-18 21:22:47] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1081/1561 places, 2225/1561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1966 ms. Remains : 1081/1561 places, 2225/1561 transitions.
Built C files in :
/tmp/ltsmin13650722361995000044
[2023-03-18 21:22:47] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13650722361995000044
Running compilation step : cd /tmp/ltsmin13650722361995000044;'/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 2432 ms.
Running link step : cd /tmp/ltsmin13650722361995000044;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin13650722361995000044;'/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/stateBased4088518601497892054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Applied a total of 0 rules in 47 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-18 21:23:02] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-18 21:23:03] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-18 21:23:03] [INFO ] Invariant cache hit.
[2023-03-18 21:23:04] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
[2023-03-18 21:23:04] [INFO ] Invariant cache hit.
[2023-03-18 21:23:04] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2157 ms. Remains : 1561/1561 places, 1561/1561 transitions.
Built C files in :
/tmp/ltsmin1979842268402982837
[2023-03-18 21:23:05] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1979842268402982837
Running compilation step : cd /tmp/ltsmin1979842268402982837;'/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 2631 ms.
Running link step : cd /tmp/ltsmin1979842268402982837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1979842268402982837;'/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/stateBased17500123546671658798.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:23:20] [INFO ] Flatten gal took : 47 ms
[2023-03-18 21:23:20] [INFO ] Flatten gal took : 43 ms
[2023-03-18 21:23:20] [INFO ] Time to serialize gal into /tmp/LTL15513917996904498164.gal : 22 ms
[2023-03-18 21:23:20] [INFO ] Time to serialize properties into /tmp/LTL141740079016345649.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/LTL15513917996904498164.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10650849054194099173.hoa' '-atoms' '/tmp/LTL141740079016345649.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL141740079016345649.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10650849054194099173.hoa
Detected timeout of ITS tools.
[2023-03-18 21:23:35] [INFO ] Flatten gal took : 61 ms
[2023-03-18 21:23:35] [INFO ] Flatten gal took : 50 ms
[2023-03-18 21:23:35] [INFO ] Time to serialize gal into /tmp/LTL12478597050119047445.gal : 11 ms
[2023-03-18 21:23:35] [INFO ] Time to serialize properties into /tmp/LTL13869414102912906453.ltl : 4 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/LTL12478597050119047445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13869414102912906453.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(("((p895==0)||(p1930==1))")||(G("((p895==0)||(p1930==1))"))))))
Formula 0 simplified : XF!"((p895==0)||(p1930==1))"
Detected timeout of ITS tools.
[2023-03-18 21:23:50] [INFO ] Flatten gal took : 65 ms
[2023-03-18 21:23:50] [INFO ] Applying decomposition
[2023-03-18 21:23:50] [INFO ] Flatten gal took : 48 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/graph12958403190981197461.txt' '-o' '/tmp/graph12958403190981197461.bin' '-w' '/tmp/graph12958403190981197461.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12958403190981197461.bin' '-l' '-1' '-v' '-w' '/tmp/graph12958403190981197461.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:23:51] [INFO ] Decomposing Gal with order
[2023-03-18 21:23:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:23:51] [INFO ] Removed a total of 399 redundant transitions.
[2023-03-18 21:23:51] [INFO ] Flatten gal took : 149 ms
[2023-03-18 21:23:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-18 21:23:51] [INFO ] Time to serialize gal into /tmp/LTL10726758410046776279.gal : 18 ms
[2023-03-18 21:23:51] [INFO ] Time to serialize properties into /tmp/LTL10092372074183163056.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/LTL10726758410046776279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10092372074183163056.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...256
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i21.i2.u275.p895==0)||(i37.i3.u592.p1930==1))")||(G("((i21.i2.u275.p895==0)||(i37.i3.u592.p1930==1))"))))))
Formula 0 simplified : XF!"((i21.i2.u275.p895==0)||(i37.i3.u592.p1930==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin533383804982722623
[2023-03-18 21:24:06] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin533383804982722623
Running compilation step : cd /tmp/ltsmin533383804982722623;'/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 2831 ms.
Running link step : cd /tmp/ltsmin533383804982722623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin533383804982722623;'/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))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-040B-LTLCardinality-13 finished in 131454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 3 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1564 transition count 1564
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1564 transition count 1564
Applied a total of 18 rules in 116 ms. Remains 1564 /1573 variables (removed 9) and now considering 1564/1573 (removed 9) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2023-03-18 21:24:21] [INFO ] Computed 161 place invariants in 11 ms
[2023-03-18 21:24:22] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-18 21:24:22] [INFO ] Invariant cache hit.
[2023-03-18 21:24:23] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2023-03-18 21:24:23] [INFO ] Invariant cache hit.
[2023-03-18 21:24:24] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1564/1573 places, 1564/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2444 ms. Remains : 1564/1573 places, 1564/1573 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s462 0) (EQ s979 1)), p0:(AND (EQ s245 0) (OR (EQ s979 0) (EQ s462 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 353 ms.
Stack based approach found an accepted trace after 966 steps with 0 reset with depth 967 and stack size 967 in 5 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-14 finished in 2943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&F((G(F(!p1))||(!p2&&F(!p1)))))))'
Support contains 5 out of 1573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 433 transitions
Trivial Post-agglo rules discarded 433 transitions
Performed 433 trivial Post agglomeration. Transition count delta: 433
Iterating post reduction 0 with 433 rules applied. Total rules applied 433 place count 1572 transition count 1139
Reduce places removed 433 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 434 rules applied. Total rules applied 867 place count 1139 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 868 place count 1138 transition count 1138
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 868 place count 1138 transition count 825
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1494 place count 825 transition count 825
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1504 place count 815 transition count 815
Iterating global reduction 3 with 10 rules applied. Total rules applied 1514 place count 815 transition count 815
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1514 place count 815 transition count 805
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1534 place count 805 transition count 805
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 0 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 3 with 706 rules applied. Total rules applied 2240 place count 452 transition count 452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2241 place count 452 transition count 451
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 2243 place count 451 transition count 450
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2445 place count 350 transition count 550
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2481 place count 332 transition count 568
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2482 place count 332 transition count 568
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2484 place count 330 transition count 566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2485 place count 329 transition count 566
Applied a total of 2485 rules in 236 ms. Remains 329 /1573 variables (removed 1244) and now considering 566/1573 (removed 1007) transitions.
// Phase 1: matrix 566 rows 329 cols
[2023-03-18 21:24:24] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:24:25] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-18 21:24:25] [INFO ] Invariant cache hit.
[2023-03-18 21:24:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-18 21:24:25] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-18 21:24:25] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 21:24:25] [INFO ] Invariant cache hit.
[2023-03-18 21:24:25] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 329/1573 places, 566/1573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1129 ms. Remains : 329/1573 places, 566/1573 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) p1), true, p1]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s158 0) (EQ s177 1)), p1:(OR (EQ s204 0) (EQ s37 1) (EQ s316 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-15 finished in 1233 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(G((G(p1)||p0))))'
Found a Lengthening insensitive property : ShieldRVt-PT-040B-LTLCardinality-13
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1572 transition count 1137
Reduce places removed 435 places and 0 transitions.
Iterating post reduction 1 with 435 rules applied. Total rules applied 870 place count 1137 transition count 1137
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 870 place count 1137 transition count 823
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1498 place count 823 transition count 823
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1508 place count 813 transition count 813
Iterating global reduction 2 with 10 rules applied. Total rules applied 1518 place count 813 transition count 813
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1518 place count 813 transition count 803
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1538 place count 803 transition count 803
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 2252 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2253 place count 446 transition count 445
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 2255 place count 445 transition count 444
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2457 place count 344 transition count 544
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2493 place count 326 transition count 562
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2495 place count 324 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2496 place count 323 transition count 560
Applied a total of 2496 rules in 140 ms. Remains 323 /1573 variables (removed 1250) and now considering 560/1573 (removed 1013) transitions.
// Phase 1: matrix 560 rows 323 cols
[2023-03-18 21:24:26] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:24:26] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-18 21:24:26] [INFO ] Invariant cache hit.
[2023-03-18 21:24:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:24:26] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2023-03-18 21:24:26] [INFO ] Invariant cache hit.
[2023-03-18 21:24:27] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 323/1573 places, 560/1573 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1193 ms. Remains : 323/1573 places, 560/1573 transitions.
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s141 0) (EQ s312 1)), p0:(OR (EQ s141 0) (EQ s312 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21 reset in 431 ms.
Product exploration explored 100000 steps with 35 reset in 518 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 294 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 97 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 340504 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 340504 steps, saw 212350 distinct states, run finished after 3002 ms. (steps per millisecond=113 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-18 21:24:31] [INFO ] Invariant cache hit.
[2023-03-18 21:24:32] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 449 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 560/560 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-18 21:24:32] [INFO ] Invariant cache hit.
[2023-03-18 21:24:32] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-18 21:24:32] [INFO ] Invariant cache hit.
[2023-03-18 21:24:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:24:33] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-03-18 21:24:33] [INFO ] Invariant cache hit.
[2023-03-18 21:24:33] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 856 ms. Remains : 323/323 places, 560/560 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 61648 steps, run visited all 1 properties in 430 ms. (steps per millisecond=143 )
Probabilistic random walk after 61648 steps, saw 42051 distinct states, run finished after 431 ms. (steps per millisecond=143 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 39 reset in 478 ms.
Product exploration explored 100000 steps with 29 reset in 444 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 560/560 transitions.
Applied a total of 0 rules in 9 ms. Remains 323 /323 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-18 21:24:35] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 21:24:35] [INFO ] Invariant cache hit.
[2023-03-18 21:24:36] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 298 ms. Remains : 323/323 places, 560/560 transitions.
Built C files in :
/tmp/ltsmin16530421241465077997
[2023-03-18 21:24:36] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16530421241465077997
Running compilation step : cd /tmp/ltsmin16530421241465077997;'/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 969 ms.
Running link step : cd /tmp/ltsmin16530421241465077997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin16530421241465077997;'/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/stateBased6630753793430706566.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 560/560 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-18 21:24:51] [INFO ] Invariant cache hit.
[2023-03-18 21:24:51] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-18 21:24:51] [INFO ] Invariant cache hit.
[2023-03-18 21:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:24:51] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2023-03-18 21:24:51] [INFO ] Invariant cache hit.
[2023-03-18 21:24:52] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 877 ms. Remains : 323/323 places, 560/560 transitions.
Built C files in :
/tmp/ltsmin17575913143009887702
[2023-03-18 21:24:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17575913143009887702
Running compilation step : cd /tmp/ltsmin17575913143009887702;'/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 823 ms.
Running link step : cd /tmp/ltsmin17575913143009887702;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin17575913143009887702;'/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/stateBased9331421930857169158.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:25:07] [INFO ] Flatten gal took : 52 ms
[2023-03-18 21:25:07] [INFO ] Flatten gal took : 30 ms
[2023-03-18 21:25:07] [INFO ] Time to serialize gal into /tmp/LTL16225445887988984705.gal : 11 ms
[2023-03-18 21:25:07] [INFO ] Time to serialize properties into /tmp/LTL11539667065823827056.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/LTL16225445887988984705.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10226160914091684307.hoa' '-atoms' '/tmp/LTL11539667065823827056.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...320
Loading property file /tmp/LTL11539667065823827056.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10226160914091684307.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.90389e+30 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:25:22] [INFO ] Flatten gal took : 37 ms
[2023-03-18 21:25:22] [INFO ] Flatten gal took : 35 ms
[2023-03-18 21:25:22] [INFO ] Time to serialize gal into /tmp/LTL11256384415325471817.gal : 4 ms
[2023-03-18 21:25:22] [INFO ] Time to serialize properties into /tmp/LTL8100427014651460129.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/LTL11256384415325471817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8100427014651460129.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p895==0)||(p1930==1))")||(G("((p895==0)||(p1930==1))"))))))
Formula 0 simplified : XF!"((p895==0)||(p1930==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.90389e+30 deadlock states
Detected timeout of ITS tools.
[2023-03-18 21:25:37] [INFO ] Flatten gal took : 37 ms
[2023-03-18 21:25:37] [INFO ] Applying decomposition
[2023-03-18 21:25:37] [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/graph9747048157557825919.txt' '-o' '/tmp/graph9747048157557825919.bin' '-w' '/tmp/graph9747048157557825919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9747048157557825919.bin' '-l' '-1' '-v' '-w' '/tmp/graph9747048157557825919.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:25:37] [INFO ] Decomposing Gal with order
[2023-03-18 21:25:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:25:37] [INFO ] Removed a total of 1103 redundant transitions.
[2023-03-18 21:25:37] [INFO ] Flatten gal took : 79 ms
[2023-03-18 21:25:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 584 labels/synchronizations in 30 ms.
[2023-03-18 21:25:37] [INFO ] Time to serialize gal into /tmp/LTL9225829283182662180.gal : 4 ms
[2023-03-18 21:25:37] [INFO ] Time to serialize properties into /tmp/LTL1175451028871728450.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/LTL9225829283182662180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1175451028871728450.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(("((i4.u70.p895==0)||(i9.i1.i0.u154.p1930==1))")||(G("((i4.u70.p895==0)||(i9.i1.i0.u154.p1930==1))"))))))
Formula 0 simplified : XF!"((i4.u70.p895==0)||(i9.i1.i0.u154.p1930==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.90389e+30 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13648582914381490790
[2023-03-18 21:25:52] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13648582914381490790
Running compilation step : cd /tmp/ltsmin13648582914381490790;'/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 815 ms.
Running link step : cd /tmp/ltsmin13648582914381490790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13648582914381490790;'/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))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-040B-LTLCardinality-13 finished in 102253 ms.
[2023-03-18 21:26:08] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2492732579060772874
[2023-03-18 21:26:08] [INFO ] Too many transitions (1573) to apply POR reductions. Disabling POR matrices.
[2023-03-18 21:26:08] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2492732579060772874
Running compilation step : cd /tmp/ltsmin2492732579060772874;'/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-18 21:26:08] [INFO ] Applying decomposition
[2023-03-18 21:26:08] [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/graph12889258265475348164.txt' '-o' '/tmp/graph12889258265475348164.bin' '-w' '/tmp/graph12889258265475348164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12889258265475348164.bin' '-l' '-1' '-v' '-w' '/tmp/graph12889258265475348164.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:26:08] [INFO ] Decomposing Gal with order
[2023-03-18 21:26:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:26:08] [INFO ] Removed a total of 389 redundant transitions.
[2023-03-18 21:26:08] [INFO ] Flatten gal took : 184 ms
[2023-03-18 21:26:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2023-03-18 21:26:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality3243765695040966080.gal : 26 ms
[2023-03-18 21:26:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality10394764087483361426.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/LTLCardinality3243765695040966080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10394764087483361426.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i21.i2.u282.p895==0)||(i35.i2.u598.p1930==1))")||(G("((i21.i2.u282.p895==0)||(i35.i2.u598.p1930==1))"))))))
Formula 0 simplified : XF!"((i21.i2.u282.p895==0)||(i35.i2.u598.p1930==1))"
Compilation finished in 2660 ms.
Running link step : cd /tmp/ltsmin2492732579060772874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2492732579060772874;'/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))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-18 21:47:59] [INFO ] Applying decomposition
[2023-03-18 21:47:59] [INFO ] Flatten gal took : 74 ms
[2023-03-18 21:47:59] [INFO ] Decomposing Gal with order
[2023-03-18 21:47:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:47:59] [INFO ] Removed a total of 114 redundant transitions.
[2023-03-18 21:47:59] [INFO ] Flatten gal took : 111 ms
[2023-03-18 21:48:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-18 21:48:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality10487037118668181984.gal : 29 ms
[2023-03-18 21:48:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality4142044021229570571.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/LTLCardinality10487037118668181984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4142044021229570571.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u164.p895==0)||(i0.i1.i0.i0.u311.p1930==1))")||(...285
Formula 0 simplified : XF!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u164.p895==0)||(i0.i1.i0.i0.u311.p1930==1))"
Reverse transition relation is NOT exact ! Due to transitions t1491, i0.t1414, i0.i0.t1489, i0.i0.i0.t1416, i0.i0.i0.i0.t1487, i0.i0.i0.i0.i0.t1418, i0.i0....28254
Computing Next relation with stutter on 4.90389e+30 deadlock states
Detected timeout of ITS tools.
[2023-03-18 22:09:50] [INFO ] Flatten gal took : 79 ms
[2023-03-18 22:09:50] [INFO ] Input system was already deterministic with 1573 transitions.
[2023-03-18 22:09:51] [INFO ] Transformed 1573 places.
[2023-03-18 22:09:51] [INFO ] Transformed 1573 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 22:09:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality17383974183843018805.gal : 4 ms
[2023-03-18 22:09:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality11267968831746371823.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/LTLCardinality17383974183843018805.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11267968831746371823.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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("((p895==0)||(p1930==1))")||(G("((p895==0)||(p1930==1))"))))))
Formula 0 simplified : XF!"((p895==0)||(p1930==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8477836 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16033764 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="ShieldRVt-PT-040B"
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 ShieldRVt-PT-040B, 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 r421-tajo-167905975100315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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