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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679174796049

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-050B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 21:26:37] [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:26:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:26:38] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-18 21:26:38] [INFO ] Transformed 2503 places.
[2023-03-18 21:26:38] [INFO ] Transformed 2503 transitions.
[2023-03-18 21:26:38] [INFO ] Found NUPN structural information;
[2023-03-18 21:26:38] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVt-PT-050B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 533 places :
Symmetric choice reduction at 0 with 533 rule applications. Total rules 533 place count 1970 transition count 1970
Iterating global reduction 0 with 533 rules applied. Total rules applied 1066 place count 1970 transition count 1970
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1067 place count 1969 transition count 1969
Iterating global reduction 0 with 1 rules applied. Total rules applied 1068 place count 1969 transition count 1969
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1069 place count 1968 transition count 1968
Iterating global reduction 0 with 1 rules applied. Total rules applied 1070 place count 1968 transition count 1968
Applied a total of 1070 rules in 955 ms. Remains 1968 /2503 variables (removed 535) and now considering 1968/2503 (removed 535) transitions.
// Phase 1: matrix 1968 rows 1968 cols
[2023-03-18 21:26:39] [INFO ] Computed 201 place invariants in 27 ms
[2023-03-18 21:26:40] [INFO ] Implicit Places using invariants in 741 ms returned []
[2023-03-18 21:26:40] [INFO ] Invariant cache hit.
[2023-03-18 21:26:42] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
[2023-03-18 21:26:42] [INFO ] Invariant cache hit.
[2023-03-18 21:26:43] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1968/2503 places, 1968/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4508 ms. Remains : 1968/2503 places, 1968/2503 transitions.
Support contains 36 out of 1968 places after structural reductions.
[2023-03-18 21:26:43] [INFO ] Flatten gal took : 140 ms
[2023-03-18 21:26:43] [INFO ] Flatten gal took : 67 ms
[2023-03-18 21:26:43] [INFO ] Input system was already deterministic with 1968 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-18 21:26:44] [INFO ] Invariant cache hit.
[2023-03-18 21:26:45] [INFO ] After 478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-18 21:26:45] [INFO ] [Nat]Absence check using 201 positive place invariants in 66 ms returned sat
[2023-03-18 21:26:48] [INFO ] After 2155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-18 21:26:48] [INFO ] Deduced a trap composed of 60 places in 455 ms of which 6 ms to minimize.
[2023-03-18 21:26:49] [INFO ] Deduced a trap composed of 44 places in 386 ms of which 2 ms to minimize.
[2023-03-18 21:26:49] [INFO ] Deduced a trap composed of 38 places in 358 ms of which 2 ms to minimize.
[2023-03-18 21:26:49] [INFO ] Deduced a trap composed of 66 places in 345 ms of which 2 ms to minimize.
[2023-03-18 21:26:50] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 2 ms to minimize.
[2023-03-18 21:26:50] [INFO ] Deduced a trap composed of 28 places in 401 ms of which 1 ms to minimize.
[2023-03-18 21:26:51] [INFO ] Deduced a trap composed of 27 places in 357 ms of which 1 ms to minimize.
[2023-03-18 21:26:51] [INFO ] Deduced a trap composed of 59 places in 317 ms of which 1 ms to minimize.
[2023-03-18 21:26:52] [INFO ] Deduced a trap composed of 56 places in 318 ms of which 1 ms to minimize.
[2023-03-18 21:26:52] [INFO ] Deduced a trap composed of 65 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:26:52] [INFO ] Deduced a trap composed of 62 places in 336 ms of which 1 ms to minimize.
[2023-03-18 21:26:53] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 1 ms to minimize.
[2023-03-18 21:26:53] [INFO ] Deduced a trap composed of 58 places in 345 ms of which 1 ms to minimize.
[2023-03-18 21:26:54] [INFO ] Deduced a trap composed of 67 places in 325 ms of which 2 ms to minimize.
[2023-03-18 21:26:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6091 ms
[2023-03-18 21:26:54] [INFO ] Deduced a trap composed of 50 places in 364 ms of which 1 ms to minimize.
[2023-03-18 21:26:55] [INFO ] Deduced a trap composed of 49 places in 344 ms of which 1 ms to minimize.
[2023-03-18 21:26:55] [INFO ] Deduced a trap composed of 56 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:26:55] [INFO ] Deduced a trap composed of 55 places in 325 ms of which 2 ms to minimize.
[2023-03-18 21:26:56] [INFO ] Deduced a trap composed of 45 places in 346 ms of which 1 ms to minimize.
[2023-03-18 21:26:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2254 ms
[2023-03-18 21:26:57] [INFO ] Deduced a trap composed of 45 places in 407 ms of which 4 ms to minimize.
[2023-03-18 21:26:57] [INFO ] Deduced a trap composed of 41 places in 349 ms of which 1 ms to minimize.
[2023-03-18 21:26:57] [INFO ] Deduced a trap composed of 44 places in 380 ms of which 1 ms to minimize.
[2023-03-18 21:26:58] [INFO ] Deduced a trap composed of 68 places in 379 ms of which 1 ms to minimize.
[2023-03-18 21:26:58] [INFO ] Deduced a trap composed of 40 places in 360 ms of which 1 ms to minimize.
[2023-03-18 21:26:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2371 ms
[2023-03-18 21:26:59] [INFO ] Deduced a trap composed of 54 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:27:00] [INFO ] Deduced a trap composed of 53 places in 348 ms of which 1 ms to minimize.
[2023-03-18 21:27:00] [INFO ] Deduced a trap composed of 55 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:27:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1403 ms
[2023-03-18 21:27:01] [INFO ] Deduced a trap composed of 36 places in 350 ms of which 1 ms to minimize.
[2023-03-18 21:27:01] [INFO ] Deduced a trap composed of 36 places in 360 ms of which 1 ms to minimize.
[2023-03-18 21:27:02] [INFO ] Deduced a trap composed of 35 places in 343 ms of which 1 ms to minimize.
[2023-03-18 21:27:02] [INFO ] Deduced a trap composed of 39 places in 313 ms of which 1 ms to minimize.
[2023-03-18 21:27:03] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 1 ms to minimize.
[2023-03-18 21:27:03] [INFO ] Deduced a trap composed of 35 places in 310 ms of which 1 ms to minimize.
[2023-03-18 21:27:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2603 ms
[2023-03-18 21:27:04] [INFO ] Deduced a trap composed of 41 places in 297 ms of which 1 ms to minimize.
[2023-03-18 21:27:04] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 5 ms to minimize.
[2023-03-18 21:27:04] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 0 ms to minimize.
[2023-03-18 21:27:05] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 2 ms to minimize.
[2023-03-18 21:27:05] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 1 ms to minimize.
[2023-03-18 21:27:05] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 1 ms to minimize.
[2023-03-18 21:27:06] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 1 ms to minimize.
[2023-03-18 21:27:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2438 ms
[2023-03-18 21:27:06] [INFO ] Deduced a trap composed of 28 places in 321 ms of which 1 ms to minimize.
[2023-03-18 21:27:07] [INFO ] Deduced a trap composed of 42 places in 295 ms of which 1 ms to minimize.
[2023-03-18 21:27:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 856 ms
[2023-03-18 21:27:07] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 1 ms to minimize.
[2023-03-18 21:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 513 ms
[2023-03-18 21:27:08] [INFO ] After 22147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1438 ms.
[2023-03-18 21:27:09] [INFO ] After 24421ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 786 ms.
Support contains 22 out of 1968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Drop transitions removed 529 transitions
Trivial Post-agglo rules discarded 529 transitions
Performed 529 trivial Post agglomeration. Transition count delta: 529
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1968 transition count 1439
Reduce places removed 529 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 532 rules applied. Total rules applied 1061 place count 1439 transition count 1436
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1064 place count 1436 transition count 1436
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 391 Pre rules applied. Total rules applied 1064 place count 1436 transition count 1045
Deduced a syphon composed of 391 places in 2 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 3 with 782 rules applied. Total rules applied 1846 place count 1045 transition count 1045
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1852 place count 1039 transition count 1039
Iterating global reduction 3 with 6 rules applied. Total rules applied 1858 place count 1039 transition count 1039
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1858 place count 1039 transition count 1034
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1868 place count 1034 transition count 1034
Performed 458 Post agglomeration using F-continuation condition.Transition count delta: 458
Deduced a syphon composed of 458 places in 1 ms
Reduce places removed 458 places and 0 transitions.
Iterating global reduction 3 with 916 rules applied. Total rules applied 2784 place count 576 transition count 576
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2785 place count 576 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2787 place count 575 transition count 574
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2989 place count 474 transition count 667
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 3073 place count 432 transition count 706
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3074 place count 432 transition count 705
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3075 place count 432 transition count 704
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3076 place count 431 transition count 704
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3077 place count 431 transition count 703
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3078 place count 430 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3079 place count 429 transition count 702
Applied a total of 3079 rules in 461 ms. Remains 429 /1968 variables (removed 1539) and now considering 702/1968 (removed 1266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 429/1968 places, 702/1968 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 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 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 702 rows 429 cols
[2023-03-18 21:27:11] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-18 21:27:11] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 21:27:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2023-03-18 21:27:12] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 21:27:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 21:27:12] [INFO ] After 211ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-18 21:27:12] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-18 21:27:12] [INFO ] After 1215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 211 ms.
Support contains 17 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 702/702 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 429 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 428 transition count 701
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 428 transition count 699
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 426 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 425 transition count 698
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 425 transition count 698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 424 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 423 transition count 699
Applied a total of 12 rules in 56 ms. Remains 423 /429 variables (removed 6) and now considering 699/702 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 423/429 places, 699/702 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
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 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 146862 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{1=1}
Probabilistic random walk after 146862 steps, saw 91993 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 699 rows 423 cols
[2023-03-18 21:27:17] [INFO ] Computed 200 place invariants in 7 ms
[2023-03-18 21:27:17] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 21:27:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 23 ms returned sat
[2023-03-18 21:27:17] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 21:27:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 21:27:17] [INFO ] After 102ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 21:27:17] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-18 21:27:18] [INFO ] After 812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 15 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 699/699 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 423 transition count 698
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 698
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 421 transition count 698
Applied a total of 4 rules in 41 ms. Remains 421 /423 variables (removed 2) and now considering 698/699 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 421/423 places, 698/699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) 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 7) seen :0
Interrupted probabilistic random walk after 134975 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{0=1, 1=1, 3=1, 6=1}
Probabilistic random walk after 134975 steps, saw 83179 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :4
Running SMT prover for 3 properties.
// Phase 1: matrix 698 rows 421 cols
[2023-03-18 21:27:21] [INFO ] Computed 200 place invariants in 7 ms
[2023-03-18 21:27:21] [INFO ] [Real]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-18 21:27:21] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:27:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-18 21:27:22] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:27:22] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 21:27:22] [INFO ] After 43ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:27:22] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-18 21:27:22] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 133 ms.
Support contains 7 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 698/698 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 421 transition count 696
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 419 transition count 696
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 419 transition count 692
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 415 transition count 692
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 413 transition count 690
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 409 transition count 696
Applied a total of 24 rules in 61 ms. Remains 409 /421 variables (removed 12) and now considering 696/698 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 409/421 places, 696/698 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 211209 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211209 steps, saw 133986 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 696 rows 409 cols
[2023-03-18 21:27:25] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-18 21:27:26] [INFO ] [Real]Absence check using 200 positive place invariants in 25 ms returned sat
[2023-03-18 21:27:26] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:27:26] [INFO ] [Nat]Absence check using 200 positive place invariants in 24 ms returned sat
[2023-03-18 21:27:26] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:27:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 21:27:26] [INFO ] After 47ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:27:26] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-18 21:27:26] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 97 ms.
Support contains 7 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 696/696 transitions.
Applied a total of 0 rules in 15 ms. Remains 409 /409 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 409/409 places, 696/696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 696/696 transitions.
Applied a total of 0 rules in 13 ms. Remains 409 /409 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2023-03-18 21:27:26] [INFO ] Invariant cache hit.
[2023-03-18 21:27:27] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-18 21:27:27] [INFO ] Invariant cache hit.
[2023-03-18 21:27:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 21:27:27] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-18 21:27:27] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-18 21:27:27] [INFO ] Invariant cache hit.
[2023-03-18 21:27:27] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1053 ms. Remains : 409/409 places, 696/696 transitions.
Graph (trivial) has 193 edges and 409 vertex of which 4 / 409 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 1396 edges and 407 vertex of which 405 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 190 edges and 403 vertex of which 4 / 403 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 401 transition count 687
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 189 edges and 399 vertex of which 6 / 399 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 396 transition count 678
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 187 edges and 393 vertex of which 8 / 393 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 389 transition count 667
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 385 vertex of which 8 / 385 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 381 transition count 653
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 377 vertex of which 8 / 377 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 373 transition count 639
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 369 vertex of which 6 / 369 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 92 place count 366 transition count 625
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 171 edges and 363 vertex of which 4 / 363 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 6 with 14 rules applied. Total rules applied 106 place count 361 transition count 615
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 168 edges and 359 vertex of which 2 / 359 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 9 rules applied. Total rules applied 115 place count 358 transition count 609
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 120 place count 357 transition count 605
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 120 place count 357 transition count 604
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 123 place count 355 transition count 604
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 9 with 2 rules applied. Total rules applied 125 place count 354 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 126 place count 354 transition count 602
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 131 place count 354 transition count 597
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 133 place count 354 transition count 597
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 134 place count 354 transition count 596
Applied a total of 134 rules in 87 ms. Remains 354 /409 variables (removed 55) and now considering 596/696 (removed 100) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 596 rows 354 cols
[2023-03-18 21:27:27] [INFO ] Computed 173 place invariants in 2 ms
[2023-03-18 21:27:28] [INFO ] [Real]Absence check using 173 positive place invariants in 20 ms returned sat
[2023-03-18 21:27:28] [INFO ] After 161ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-18 21:27:28] [INFO ] After 192ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:27:28] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:27:28] [INFO ] [Nat]Absence check using 173 positive place invariants in 23 ms returned sat
[2023-03-18 21:27:28] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:27:28] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-18 21:27:28] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA ShieldRVt-PT-050B-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 599 stabilizing places and 599 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G(!p0)) U p1))))'
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1954 transition count 1954
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1954 transition count 1954
Applied a total of 28 rules in 206 ms. Remains 1954 /1968 variables (removed 14) and now considering 1954/1968 (removed 14) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2023-03-18 21:27:29] [INFO ] Computed 201 place invariants in 17 ms
[2023-03-18 21:27:29] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-18 21:27:29] [INFO ] Invariant cache hit.
[2023-03-18 21:27:31] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2151 ms to find 0 implicit places.
[2023-03-18 21:27:31] [INFO ] Invariant cache hit.
[2023-03-18 21:27:32] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1954/1968 places, 1954/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3358 ms. Remains : 1954/1968 places, 1954/1968 transitions.
Stuttering acceptance computed with spot in 298 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s685 0) (EQ s1504 1)), p0:(OR (EQ s1786 0) (EQ s1514 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 1 reset in 566 ms.
Product exploration explored 100000 steps with 1 reset in 979 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:27:34] [INFO ] Invariant cache hit.
[2023-03-18 21:27:35] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:27:35] [INFO ] [Nat]Absence check using 201 positive place invariants in 64 ms returned sat
[2023-03-18 21:27:36] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:27:36] [INFO ] Deduced a trap composed of 33 places in 521 ms of which 2 ms to minimize.
[2023-03-18 21:27:37] [INFO ] Deduced a trap composed of 45 places in 498 ms of which 1 ms to minimize.
[2023-03-18 21:27:37] [INFO ] Deduced a trap composed of 29 places in 483 ms of which 1 ms to minimize.
[2023-03-18 21:27:38] [INFO ] Deduced a trap composed of 22 places in 468 ms of which 1 ms to minimize.
[2023-03-18 21:27:38] [INFO ] Deduced a trap composed of 25 places in 467 ms of which 1 ms to minimize.
[2023-03-18 21:27:39] [INFO ] Deduced a trap composed of 52 places in 483 ms of which 1 ms to minimize.
[2023-03-18 21:27:40] [INFO ] Deduced a trap composed of 26 places in 477 ms of which 7 ms to minimize.
[2023-03-18 21:27:40] [INFO ] Deduced a trap composed of 53 places in 450 ms of which 1 ms to minimize.
[2023-03-18 21:27:41] [INFO ] Deduced a trap composed of 37 places in 448 ms of which 2 ms to minimize.
[2023-03-18 21:27:41] [INFO ] Deduced a trap composed of 33 places in 439 ms of which 1 ms to minimize.
[2023-03-18 21:27:42] [INFO ] Deduced a trap composed of 47 places in 413 ms of which 2 ms to minimize.
[2023-03-18 21:27:42] [INFO ] Deduced a trap composed of 28 places in 417 ms of which 1 ms to minimize.
[2023-03-18 21:27:42] [INFO ] Deduced a trap composed of 24 places in 424 ms of which 1 ms to minimize.
[2023-03-18 21:27:43] [INFO ] Deduced a trap composed of 32 places in 414 ms of which 1 ms to minimize.
[2023-03-18 21:27:43] [INFO ] Deduced a trap composed of 24 places in 410 ms of which 2 ms to minimize.
[2023-03-18 21:27:44] [INFO ] Deduced a trap composed of 21 places in 398 ms of which 1 ms to minimize.
[2023-03-18 21:27:44] [INFO ] Deduced a trap composed of 38 places in 433 ms of which 1 ms to minimize.
[2023-03-18 21:27:45] [INFO ] Deduced a trap composed of 42 places in 420 ms of which 3 ms to minimize.
[2023-03-18 21:27:45] [INFO ] Deduced a trap composed of 41 places in 404 ms of which 1 ms to minimize.
[2023-03-18 21:27:46] [INFO ] Deduced a trap composed of 44 places in 398 ms of which 1 ms to minimize.
[2023-03-18 21:27:46] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 1 ms to minimize.
[2023-03-18 21:27:47] [INFO ] Deduced a trap composed of 35 places in 385 ms of which 2 ms to minimize.
[2023-03-18 21:27:47] [INFO ] Deduced a trap composed of 25 places in 381 ms of which 1 ms to minimize.
[2023-03-18 21:27:48] [INFO ] Deduced a trap composed of 36 places in 394 ms of which 1 ms to minimize.
[2023-03-18 21:27:48] [INFO ] Deduced a trap composed of 26 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:27:49] [INFO ] Deduced a trap composed of 27 places in 396 ms of which 1 ms to minimize.
[2023-03-18 21:27:49] [INFO ] Deduced a trap composed of 52 places in 381 ms of which 1 ms to minimize.
[2023-03-18 21:27:50] [INFO ] Deduced a trap composed of 51 places in 356 ms of which 2 ms to minimize.
[2023-03-18 21:27:50] [INFO ] Deduced a trap composed of 45 places in 362 ms of which 1 ms to minimize.
[2023-03-18 21:27:51] [INFO ] Deduced a trap composed of 71 places in 361 ms of which 1 ms to minimize.
[2023-03-18 21:27:51] [INFO ] Deduced a trap composed of 65 places in 347 ms of which 1 ms to minimize.
[2023-03-18 21:27:52] [INFO ] Deduced a trap composed of 48 places in 346 ms of which 1 ms to minimize.
[2023-03-18 21:27:52] [INFO ] Deduced a trap composed of 67 places in 341 ms of which 1 ms to minimize.
[2023-03-18 21:27:52] [INFO ] Deduced a trap composed of 71 places in 331 ms of which 1 ms to minimize.
[2023-03-18 21:27:53] [INFO ] Deduced a trap composed of 73 places in 301 ms of which 1 ms to minimize.
[2023-03-18 21:27:53] [INFO ] Deduced a trap composed of 76 places in 293 ms of which 1 ms to minimize.
[2023-03-18 21:27:54] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 1 ms to minimize.
[2023-03-18 21:27:54] [INFO ] Deduced a trap composed of 61 places in 317 ms of which 0 ms to minimize.
[2023-03-18 21:27:54] [INFO ] Deduced a trap composed of 69 places in 304 ms of which 1 ms to minimize.
[2023-03-18 21:27:55] [INFO ] Deduced a trap composed of 60 places in 262 ms of which 1 ms to minimize.
[2023-03-18 21:27:55] [INFO ] Deduced a trap composed of 61 places in 251 ms of which 0 ms to minimize.
[2023-03-18 21:27:55] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 1 ms to minimize.
[2023-03-18 21:27:56] [INFO ] Deduced a trap composed of 54 places in 264 ms of which 0 ms to minimize.
[2023-03-18 21:27:56] [INFO ] Deduced a trap composed of 74 places in 254 ms of which 1 ms to minimize.
[2023-03-18 21:27:56] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 20412 ms
[2023-03-18 21:27:56] [INFO ] After 21234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-18 21:27:56] [INFO ] After 21644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Drop transitions removed 549 transitions
Trivial Post-agglo rules discarded 549 transitions
Performed 549 trivial Post agglomeration. Transition count delta: 549
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 1954 transition count 1405
Reduce places removed 549 places and 0 transitions.
Iterating post reduction 1 with 549 rules applied. Total rules applied 1098 place count 1405 transition count 1405
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 398 Pre rules applied. Total rules applied 1098 place count 1405 transition count 1007
Deduced a syphon composed of 398 places in 2 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1894 place count 1007 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1895 place count 1006 transition count 1006
Iterating global reduction 2 with 1 rules applied. Total rules applied 1896 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 0 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2800 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2801 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2803 place count 553 transition count 552
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 3005 place count 452 transition count 652
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3099 place count 405 transition count 698
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 405 transition count 697
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 405 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 404 transition count 696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3103 place count 404 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3104 place count 403 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3105 place count 402 transition count 694
Applied a total of 3105 rules in 318 ms. Remains 402 /1954 variables (removed 1552) and now considering 694/1954 (removed 1260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 402/1954 places, 694/1954 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 406266 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 406266 steps, saw 260985 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 694 rows 402 cols
[2023-03-18 21:28:00] [INFO ] Computed 200 place invariants in 6 ms
[2023-03-18 21:28:00] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:28:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-18 21:28:00] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:00] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 21:28:00] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 694/694 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 402/402 places, 694/694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 694/694 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2023-03-18 21:28:00] [INFO ] Invariant cache hit.
[2023-03-18 21:28:00] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-18 21:28:00] [INFO ] Invariant cache hit.
[2023-03-18 21:28:01] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2023-03-18 21:28:01] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 21:28:01] [INFO ] Invariant cache hit.
[2023-03-18 21:28:01] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 960 ms. Remains : 402/402 places, 694/694 transitions.
Graph (trivial) has 197 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 194 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 685
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 193 edges and 392 vertex of which 6 / 392 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 389 transition count 676
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 191 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 665
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 651
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 637
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 623
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 609
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 595
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 334 transition count 581
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 163 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 326 transition count 567
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 160 edges and 322 vertex of which 8 / 322 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 18 rules applied. Total rules applied 186 place count 318 transition count 554
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 156 edges and 314 vertex of which 6 / 314 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 203 place count 311 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 153 edges and 308 vertex of which 6 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 16 rules applied. Total rules applied 219 place count 305 transition count 530
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 151 edges and 302 vertex of which 6 / 302 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 15 rules applied. Total rules applied 234 place count 299 transition count 519
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 149 edges and 296 vertex of which 8 / 296 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 249 place count 292 transition count 508
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 145 edges and 288 vertex of which 8 / 288 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 20 rules applied. Total rules applied 269 place count 284 transition count 493
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 280 vertex of which 8 / 280 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 288 place count 276 transition count 479
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 272 vertex of which 8 / 272 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 307 place count 268 transition count 465
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 264 vertex of which 8 / 264 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 326 place count 260 transition count 451
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 129 edges and 256 vertex of which 8 / 256 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 345 place count 252 transition count 437
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 248 vertex of which 8 / 248 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 364 place count 244 transition count 423
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 240 vertex of which 8 / 240 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 383 place count 236 transition count 409
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 117 edges and 232 vertex of which 8 / 232 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 402 place count 228 transition count 395
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 113 edges and 224 vertex of which 8 / 224 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 421 place count 220 transition count 381
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 109 edges and 216 vertex of which 8 / 216 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 440 place count 212 transition count 367
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 105 edges and 208 vertex of which 8 / 208 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 459 place count 204 transition count 353
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 101 edges and 200 vertex of which 8 / 200 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 478 place count 196 transition count 339
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 97 edges and 192 vertex of which 8 / 192 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 497 place count 188 transition count 325
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 93 edges and 184 vertex of which 8 / 184 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 516 place count 180 transition count 311
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 89 edges and 176 vertex of which 8 / 176 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 535 place count 172 transition count 297
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 85 edges and 168 vertex of which 8 / 168 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 554 place count 164 transition count 283
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 81 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 573 place count 156 transition count 269
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 77 edges and 152 vertex of which 6 / 152 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 592 place count 149 transition count 255
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 73 edges and 146 vertex of which 4 / 146 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 33 with 14 rules applied. Total rules applied 606 place count 144 transition count 245
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 70 edges and 142 vertex of which 2 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 34 with 9 rules applied. Total rules applied 615 place count 141 transition count 239
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 5 rules applied. Total rules applied 620 place count 140 transition count 235
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 3 Pre rules applied. Total rules applied 620 place count 140 transition count 232
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 628 place count 135 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 66 edges and 135 vertex of which 2 / 135 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 36 with 2 rules applied. Total rules applied 630 place count 134 transition count 231
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 632 place count 134 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 38 with 3 rules applied. Total rules applied 635 place count 132 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 639 place count 132 transition count 224
Applied a total of 639 rules in 69 ms. Remains 132 /402 variables (removed 270) and now considering 224/694 (removed 470) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 132 cols
[2023-03-18 21:28:01] [INFO ] Computed 66 place invariants in 0 ms
[2023-03-18 21:28:01] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:28:01] [INFO ] [Nat]Absence check using 66 positive place invariants in 6 ms returned sat
[2023-03-18 21:28:01] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:01] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 21:28:01] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Applied a total of 0 rules in 99 ms. Remains 1954 /1954 variables (removed 0) and now considering 1954/1954 (removed 0) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2023-03-18 21:28:02] [INFO ] Computed 201 place invariants in 17 ms
[2023-03-18 21:28:03] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-18 21:28:03] [INFO ] Invariant cache hit.
[2023-03-18 21:28:04] [INFO ] Implicit Places using invariants and state equation in 1956 ms returned []
Implicit Place search using SMT with State Equation took 2556 ms to find 0 implicit places.
[2023-03-18 21:28:04] [INFO ] Invariant cache hit.
[2023-03-18 21:28:06] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3739 ms. Remains : 1954/1954 places, 1954/1954 transitions.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 297 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:28:06] [INFO ] Invariant cache hit.
[2023-03-18 21:28:06] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:28:07] [INFO ] [Nat]Absence check using 201 positive place invariants in 80 ms returned sat
[2023-03-18 21:28:08] [INFO ] After 767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:08] [INFO ] Deduced a trap composed of 33 places in 476 ms of which 1 ms to minimize.
[2023-03-18 21:28:09] [INFO ] Deduced a trap composed of 45 places in 511 ms of which 1 ms to minimize.
[2023-03-18 21:28:09] [INFO ] Deduced a trap composed of 29 places in 450 ms of which 2 ms to minimize.
[2023-03-18 21:28:10] [INFO ] Deduced a trap composed of 22 places in 478 ms of which 1 ms to minimize.
[2023-03-18 21:28:10] [INFO ] Deduced a trap composed of 25 places in 447 ms of which 1 ms to minimize.
[2023-03-18 21:28:11] [INFO ] Deduced a trap composed of 52 places in 488 ms of which 1 ms to minimize.
[2023-03-18 21:28:11] [INFO ] Deduced a trap composed of 26 places in 456 ms of which 1 ms to minimize.
[2023-03-18 21:28:12] [INFO ] Deduced a trap composed of 53 places in 488 ms of which 2 ms to minimize.
[2023-03-18 21:28:13] [INFO ] Deduced a trap composed of 37 places in 457 ms of which 2 ms to minimize.
[2023-03-18 21:28:13] [INFO ] Deduced a trap composed of 33 places in 450 ms of which 1 ms to minimize.
[2023-03-18 21:28:14] [INFO ] Deduced a trap composed of 47 places in 442 ms of which 1 ms to minimize.
[2023-03-18 21:28:14] [INFO ] Deduced a trap composed of 28 places in 437 ms of which 1 ms to minimize.
[2023-03-18 21:28:15] [INFO ] Deduced a trap composed of 24 places in 429 ms of which 1 ms to minimize.
[2023-03-18 21:28:15] [INFO ] Deduced a trap composed of 32 places in 433 ms of which 4 ms to minimize.
[2023-03-18 21:28:16] [INFO ] Deduced a trap composed of 24 places in 442 ms of which 2 ms to minimize.
[2023-03-18 21:28:16] [INFO ] Deduced a trap composed of 21 places in 401 ms of which 1 ms to minimize.
[2023-03-18 21:28:17] [INFO ] Deduced a trap composed of 38 places in 392 ms of which 2 ms to minimize.
[2023-03-18 21:28:17] [INFO ] Deduced a trap composed of 42 places in 411 ms of which 2 ms to minimize.
[2023-03-18 21:28:18] [INFO ] Deduced a trap composed of 41 places in 420 ms of which 1 ms to minimize.
[2023-03-18 21:28:18] [INFO ] Deduced a trap composed of 44 places in 424 ms of which 1 ms to minimize.
[2023-03-18 21:28:19] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:28:19] [INFO ] Deduced a trap composed of 35 places in 380 ms of which 2 ms to minimize.
[2023-03-18 21:28:19] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:28:20] [INFO ] Deduced a trap composed of 36 places in 391 ms of which 1 ms to minimize.
[2023-03-18 21:28:20] [INFO ] Deduced a trap composed of 26 places in 378 ms of which 1 ms to minimize.
[2023-03-18 21:28:21] [INFO ] Deduced a trap composed of 27 places in 369 ms of which 1 ms to minimize.
[2023-03-18 21:28:21] [INFO ] Deduced a trap composed of 52 places in 373 ms of which 1 ms to minimize.
[2023-03-18 21:28:22] [INFO ] Deduced a trap composed of 51 places in 367 ms of which 1 ms to minimize.
[2023-03-18 21:28:22] [INFO ] Deduced a trap composed of 45 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:28:23] [INFO ] Deduced a trap composed of 71 places in 350 ms of which 1 ms to minimize.
[2023-03-18 21:28:23] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 1 ms to minimize.
[2023-03-18 21:28:23] [INFO ] Deduced a trap composed of 48 places in 347 ms of which 1 ms to minimize.
[2023-03-18 21:28:24] [INFO ] Deduced a trap composed of 67 places in 370 ms of which 1 ms to minimize.
[2023-03-18 21:28:24] [INFO ] Deduced a trap composed of 71 places in 327 ms of which 1 ms to minimize.
[2023-03-18 21:28:25] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 1 ms to minimize.
[2023-03-18 21:28:25] [INFO ] Deduced a trap composed of 76 places in 324 ms of which 1 ms to minimize.
[2023-03-18 21:28:25] [INFO ] Deduced a trap composed of 58 places in 314 ms of which 1 ms to minimize.
[2023-03-18 21:28:26] [INFO ] Deduced a trap composed of 61 places in 306 ms of which 1 ms to minimize.
[2023-03-18 21:28:26] [INFO ] Deduced a trap composed of 69 places in 294 ms of which 1 ms to minimize.
[2023-03-18 21:28:27] [INFO ] Deduced a trap composed of 60 places in 289 ms of which 1 ms to minimize.
[2023-03-18 21:28:27] [INFO ] Deduced a trap composed of 61 places in 284 ms of which 1 ms to minimize.
[2023-03-18 21:28:27] [INFO ] Deduced a trap composed of 45 places in 262 ms of which 0 ms to minimize.
[2023-03-18 21:28:28] [INFO ] Deduced a trap composed of 54 places in 268 ms of which 1 ms to minimize.
[2023-03-18 21:28:28] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 1 ms to minimize.
[2023-03-18 21:28:28] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 20334 ms
[2023-03-18 21:28:28] [INFO ] After 21166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-18 21:28:28] [INFO ] After 21663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Drop transitions removed 549 transitions
Trivial Post-agglo rules discarded 549 transitions
Performed 549 trivial Post agglomeration. Transition count delta: 549
Iterating post reduction 0 with 549 rules applied. Total rules applied 549 place count 1954 transition count 1405
Reduce places removed 549 places and 0 transitions.
Iterating post reduction 1 with 549 rules applied. Total rules applied 1098 place count 1405 transition count 1405
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 398 Pre rules applied. Total rules applied 1098 place count 1405 transition count 1007
Deduced a syphon composed of 398 places in 2 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 2 with 796 rules applied. Total rules applied 1894 place count 1007 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1895 place count 1006 transition count 1006
Iterating global reduction 2 with 1 rules applied. Total rules applied 1896 place count 1006 transition count 1006
Performed 452 Post agglomeration using F-continuation condition.Transition count delta: 452
Deduced a syphon composed of 452 places in 0 ms
Reduce places removed 452 places and 0 transitions.
Iterating global reduction 2 with 904 rules applied. Total rules applied 2800 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2801 place count 554 transition count 553
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2803 place count 553 transition count 552
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 3005 place count 452 transition count 652
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3099 place count 405 transition count 698
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3100 place count 405 transition count 697
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3101 place count 405 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3102 place count 404 transition count 696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3103 place count 404 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3104 place count 403 transition count 694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3105 place count 402 transition count 694
Applied a total of 3105 rules in 290 ms. Remains 402 /1954 variables (removed 1552) and now considering 694/1954 (removed 1260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 402/1954 places, 694/1954 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 373192 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 373192 steps, saw 240585 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 694 rows 402 cols
[2023-03-18 21:28:32] [INFO ] Computed 200 place invariants in 4 ms
[2023-03-18 21:28:32] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:28:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-18 21:28:32] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:32] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-18 21:28:32] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 694/694 transitions.
Applied a total of 0 rules in 9 ms. Remains 402 /402 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 402/402 places, 694/694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 694/694 transitions.
Applied a total of 0 rules in 9 ms. Remains 402 /402 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2023-03-18 21:28:32] [INFO ] Invariant cache hit.
[2023-03-18 21:28:32] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-18 21:28:32] [INFO ] Invariant cache hit.
[2023-03-18 21:28:33] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2023-03-18 21:28:33] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 21:28:33] [INFO ] Invariant cache hit.
[2023-03-18 21:28:33] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1074 ms. Remains : 402/402 places, 694/694 transitions.
Graph (trivial) has 197 edges and 402 vertex of which 4 / 402 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1382 edges and 400 vertex of which 398 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 194 edges and 396 vertex of which 4 / 396 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 394 transition count 685
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 193 edges and 392 vertex of which 6 / 392 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 389 transition count 676
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 191 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 382 transition count 665
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 187 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 374 transition count 651
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 183 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 366 transition count 637
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 179 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 358 transition count 623
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 175 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 350 transition count 609
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 171 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 342 transition count 595
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 167 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 334 transition count 581
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 163 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 326 transition count 567
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 160 edges and 322 vertex of which 8 / 322 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 18 rules applied. Total rules applied 186 place count 318 transition count 554
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 156 edges and 314 vertex of which 6 / 314 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 203 place count 311 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 153 edges and 308 vertex of which 6 / 308 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 16 rules applied. Total rules applied 219 place count 305 transition count 530
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 151 edges and 302 vertex of which 6 / 302 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 15 rules applied. Total rules applied 234 place count 299 transition count 519
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 149 edges and 296 vertex of which 8 / 296 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 249 place count 292 transition count 508
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 145 edges and 288 vertex of which 8 / 288 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 20 rules applied. Total rules applied 269 place count 284 transition count 493
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 280 vertex of which 8 / 280 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 288 place count 276 transition count 479
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 272 vertex of which 8 / 272 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 307 place count 268 transition count 465
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 264 vertex of which 8 / 264 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 326 place count 260 transition count 451
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 129 edges and 256 vertex of which 8 / 256 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 345 place count 252 transition count 437
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 248 vertex of which 8 / 248 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 364 place count 244 transition count 423
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 240 vertex of which 8 / 240 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 383 place count 236 transition count 409
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 117 edges and 232 vertex of which 8 / 232 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 402 place count 228 transition count 395
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 113 edges and 224 vertex of which 8 / 224 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 421 place count 220 transition count 381
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 109 edges and 216 vertex of which 8 / 216 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 440 place count 212 transition count 367
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 105 edges and 208 vertex of which 8 / 208 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 459 place count 204 transition count 353
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 101 edges and 200 vertex of which 8 / 200 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 478 place count 196 transition count 339
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 97 edges and 192 vertex of which 8 / 192 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 497 place count 188 transition count 325
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 93 edges and 184 vertex of which 8 / 184 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 516 place count 180 transition count 311
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 89 edges and 176 vertex of which 8 / 176 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 535 place count 172 transition count 297
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 85 edges and 168 vertex of which 8 / 168 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 554 place count 164 transition count 283
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 81 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 573 place count 156 transition count 269
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 77 edges and 152 vertex of which 6 / 152 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 592 place count 149 transition count 255
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 73 edges and 146 vertex of which 4 / 146 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 33 with 14 rules applied. Total rules applied 606 place count 144 transition count 245
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 70 edges and 142 vertex of which 2 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 34 with 9 rules applied. Total rules applied 615 place count 141 transition count 239
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 5 rules applied. Total rules applied 620 place count 140 transition count 235
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 3 Pre rules applied. Total rules applied 620 place count 140 transition count 232
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 628 place count 135 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 66 edges and 135 vertex of which 2 / 135 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 36 with 2 rules applied. Total rules applied 630 place count 134 transition count 231
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 632 place count 134 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 38 with 3 rules applied. Total rules applied 635 place count 132 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 639 place count 132 transition count 224
Applied a total of 639 rules in 81 ms. Remains 132 /402 variables (removed 270) and now considering 224/694 (removed 470) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 132 cols
[2023-03-18 21:28:33] [INFO ] Computed 66 place invariants in 1 ms
[2023-03-18 21:28:33] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:28:33] [INFO ] [Nat]Absence check using 66 positive place invariants in 12 ms returned sat
[2023-03-18 21:28:33] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:33] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 21:28:33] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 576 ms.
Product exploration explored 100000 steps with 1 reset in 632 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Performed 548 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 548 rules applied. Total rules applied 548 place count 1954 transition count 1954
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 199 Pre rules applied. Total rules applied 548 place count 1954 transition count 2154
Deduced a syphon composed of 747 places in 4 ms
Iterating global reduction 1 with 199 rules applied. Total rules applied 747 place count 1954 transition count 2154
Performed 601 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1348 places in 3 ms
Iterating global reduction 1 with 601 rules applied. Total rules applied 1348 place count 1954 transition count 2155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1349 place count 1954 transition count 2154
Renaming transitions due to excessive name length > 1024 char.
Discarding 401 places :
Symmetric choice reduction at 2 with 401 rule applications. Total rules 1750 place count 1553 transition count 1752
Deduced a syphon composed of 947 places in 2 ms
Iterating global reduction 2 with 401 rules applied. Total rules applied 2151 place count 1553 transition count 1752
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 948 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2152 place count 1553 transition count 1752
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2154 place count 1551 transition count 1750
Deduced a syphon composed of 946 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2156 place count 1551 transition count 1750
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1047 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2257 place count 1551 transition count 2482
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2358 place count 1450 transition count 2280
Deduced a syphon composed of 946 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2459 place count 1450 transition count 2280
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -694
Deduced a syphon composed of 1042 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2555 place count 1450 transition count 2974
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 2651 place count 1354 transition count 2782
Deduced a syphon composed of 946 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2747 place count 1354 transition count 2782
Deduced a syphon composed of 946 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2750 place count 1354 transition count 2779
Deduced a syphon composed of 946 places in 0 ms
Applied a total of 2750 rules in 1409 ms. Remains 1354 /1954 variables (removed 600) and now considering 2779/1954 (removed -825) transitions.
[2023-03-18 21:28:37] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 2779 rows 1354 cols
[2023-03-18 21:28:37] [INFO ] Computed 201 place invariants in 32 ms
[2023-03-18 21:28:38] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1354/1954 places, 2779/1954 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2675 ms. Remains : 1354/1954 places, 2779/1954 transitions.
Built C files in :
/tmp/ltsmin18300209958958777521
[2023-03-18 21:28:38] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18300209958958777521
Running compilation step : cd /tmp/ltsmin18300209958958777521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18300209958958777521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18300209958958777521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Applied a total of 0 rules in 133 ms. Remains 1954 /1954 variables (removed 0) and now considering 1954/1954 (removed 0) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2023-03-18 21:28:42] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-18 21:28:42] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-18 21:28:42] [INFO ] Invariant cache hit.
[2023-03-18 21:28:44] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2023-03-18 21:28:44] [INFO ] Invariant cache hit.
[2023-03-18 21:28:45] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3089 ms. Remains : 1954/1954 places, 1954/1954 transitions.
Built C files in :
/tmp/ltsmin15439051264595105931
[2023-03-18 21:28:45] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15439051264595105931
Running compilation step : cd /tmp/ltsmin15439051264595105931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15439051264595105931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15439051264595105931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 21:28:48] [INFO ] Flatten gal took : 54 ms
[2023-03-18 21:28:48] [INFO ] Flatten gal took : 47 ms
[2023-03-18 21:28:48] [INFO ] Time to serialize gal into /tmp/LTL4042855163237086817.gal : 13 ms
[2023-03-18 21:28:48] [INFO ] Time to serialize properties into /tmp/LTL335338835221205779.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/LTL4042855163237086817.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10032632076258428799.hoa' '-atoms' '/tmp/LTL335338835221205779.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL335338835221205779.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10032632076258428799.hoa
Detected timeout of ITS tools.
[2023-03-18 21:29:03] [INFO ] Flatten gal took : 41 ms
[2023-03-18 21:29:03] [INFO ] Flatten gal took : 41 ms
[2023-03-18 21:29:03] [INFO ] Time to serialize gal into /tmp/LTL9662847161233874030.gal : 8 ms
[2023-03-18 21:29:03] [INFO ] Time to serialize properties into /tmp/LTL13686252140757124720.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9662847161233874030.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13686252140757124720.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((F(G(!("((p2283==0)||(p1933==1))"))))U("((p866==0)||(p1921==1))")))))
Formula 0 simplified : XF(GF"((p2283==0)||(p1933==1))" R !"((p866==0)||(p1921==1))")
Detected timeout of ITS tools.
[2023-03-18 21:29:18] [INFO ] Flatten gal took : 73 ms
[2023-03-18 21:29:18] [INFO ] Applying decomposition
[2023-03-18 21:29:18] [INFO ] Flatten gal took : 55 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/graph5985941501667649289.txt' '-o' '/tmp/graph5985941501667649289.bin' '-w' '/tmp/graph5985941501667649289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5985941501667649289.bin' '-l' '-1' '-v' '-w' '/tmp/graph5985941501667649289.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:29:19] [INFO ] Decomposing Gal with order
[2023-03-18 21:29:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:29:19] [INFO ] Removed a total of 499 redundant transitions.
[2023-03-18 21:29:19] [INFO ] Flatten gal took : 182 ms
[2023-03-18 21:29:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2023-03-18 21:29:19] [INFO ] Time to serialize gal into /tmp/LTL16381179733760957442.gal : 32 ms
[2023-03-18 21:29:19] [INFO ] Time to serialize properties into /tmp/LTL12202357067811056613.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/LTL16381179733760957442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12202357067811056613.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((F(G(!("((i44.i2.u701.p2283==0)||(i40.i2.u596.p1933==1))"))))U("((i20.i3.u269.p866==0)||(i40.i1.u591.p1921==1))")))))
Formula 0 simplified : XF(GF"((i44.i2.u701.p2283==0)||(i40.i2.u596.p1933==1))" R !"((i20.i3.u269.p866==0)||(i40.i1.u591.p1921==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13362052730206885907
[2023-03-18 21:29:34] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13362052730206885907
Running compilation step : cd /tmp/ltsmin13362052730206885907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13362052730206885907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13362052730206885907;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVt-PT-050B-LTLCardinality-00 finished in 128827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 540 transitions
Trivial Post-agglo rules discarded 540 transitions
Performed 540 trivial Post agglomeration. Transition count delta: 540
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 1967 transition count 1427
Reduce places removed 540 places and 0 transitions.
Iterating post reduction 1 with 540 rules applied. Total rules applied 1080 place count 1427 transition count 1427
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1080 place count 1427 transition count 1033
Deduced a syphon composed of 394 places in 2 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 1868 place count 1033 transition count 1033
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1883 place count 1018 transition count 1018
Iterating global reduction 2 with 15 rules applied. Total rules applied 1898 place count 1018 transition count 1018
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1898 place count 1018 transition count 1004
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 1926 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2824 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2825 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2827 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3029 place count 453 transition count 652
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3125 place count 405 transition count 700
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3127 place count 403 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3128 place count 402 transition count 698
Applied a total of 3128 rules in 252 ms. Remains 402 /1968 variables (removed 1566) and now considering 698/1968 (removed 1270) transitions.
// Phase 1: matrix 698 rows 402 cols
[2023-03-18 21:29:38] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-18 21:29:38] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-18 21:29:38] [INFO ] Invariant cache hit.
[2023-03-18 21:29:39] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
[2023-03-18 21:29:39] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 21:29:39] [INFO ] Invariant cache hit.
[2023-03-18 21:29:39] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1968 places, 698/1968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1518 ms. Remains : 402/1968 places, 698/1968 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s394 0) (EQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-01 finished in 1578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (p1&&X(!p1))))))'
Support contains 3 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1952 transition count 1952
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1952 transition count 1952
Applied a total of 32 rules in 235 ms. Remains 1952 /1968 variables (removed 16) and now considering 1952/1968 (removed 16) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2023-03-18 21:29:39] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-18 21:29:40] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-18 21:29:40] [INFO ] Invariant cache hit.
[2023-03-18 21:29:41] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2023-03-18 21:29:41] [INFO ] Invariant cache hit.
[2023-03-18 21:29:42] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1968 places, 1952/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3116 ms. Remains : 1952/1968 places, 1952/1968 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, p1, p1, true, true, true]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(NEQ s1240 1), p0:(OR (EQ s1828 0) (EQ s651 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 924 steps with 0 reset in 15 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-04 finished in 3311 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' '!(((p0 U p1) U (p0&&X(p2))))'
Support contains 5 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1953 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1953 transition count 1953
Applied a total of 30 rules in 254 ms. Remains 1953 /1968 variables (removed 15) and now considering 1953/1968 (removed 15) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-18 21:29:42] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-18 21:29:43] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-18 21:29:43] [INFO ] Invariant cache hit.
[2023-03-18 21:29:44] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 1963 ms to find 0 implicit places.
[2023-03-18 21:29:44] [INFO ] Invariant cache hit.
[2023-03-18 21:29:45] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1968 places, 1953/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3229 ms. Remains : 1953/1968 places, 1953/1968 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p2)), true, (AND p0 (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s721 0) (EQ s606 1)), p1:(OR (EQ s275 0) (EQ s1129 1)), p2:(EQ s189 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 40903 steps with 0 reset in 212 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-06 finished in 3656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(G(p2)||p1)))))'
Support contains 6 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1953 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1953 transition count 1953
Applied a total of 30 rules in 243 ms. Remains 1953 /1968 variables (removed 15) and now considering 1953/1968 (removed 15) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-18 21:29:46] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-18 21:29:47] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-18 21:29:47] [INFO ] Invariant cache hit.
[2023-03-18 21:29:48] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
[2023-03-18 21:29:48] [INFO ] Invariant cache hit.
[2023-03-18 21:29:49] [INFO ] Dead Transitions using invariants and state equation in 995 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1968 places, 1953/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3432 ms. Remains : 1953/1968 places, 1953/1968 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s1370 0) (EQ s68 1)), p2:(AND (EQ s23 0) (EQ s357 1)), p0:(AND (EQ s1268 0) (EQ s1737 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 520 ms.
Stack based approach found an accepted trace after 1680 steps with 0 reset with depth 1681 and stack size 1681 in 22 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-10 finished in 4243 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 3 out of 1968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 539 transitions
Trivial Post-agglo rules discarded 539 transitions
Performed 539 trivial Post agglomeration. Transition count delta: 539
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 1967 transition count 1428
Reduce places removed 539 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 540 rules applied. Total rules applied 1079 place count 1428 transition count 1427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 1427 transition count 1427
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 1080 place count 1427 transition count 1033
Deduced a syphon composed of 394 places in 2 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 1868 place count 1033 transition count 1033
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1882 place count 1019 transition count 1019
Iterating global reduction 3 with 14 rules applied. Total rules applied 1896 place count 1019 transition count 1019
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1896 place count 1019 transition count 1006
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1922 place count 1006 transition count 1006
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 1 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 2822 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2823 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2825 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3027 place count 454 transition count 653
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3121 place count 407 transition count 699
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3123 place count 405 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3124 place count 404 transition count 697
Applied a total of 3124 rules in 239 ms. Remains 404 /1968 variables (removed 1564) and now considering 697/1968 (removed 1271) transitions.
// Phase 1: matrix 697 rows 404 cols
[2023-03-18 21:29:50] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-18 21:29:51] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-18 21:29:51] [INFO ] Invariant cache hit.
[2023-03-18 21:29:51] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-18 21:29:51] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 21:29:51] [INFO ] Invariant cache hit.
[2023-03-18 21:29:51] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/1968 places, 697/1968 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1312 ms. Remains : 404/1968 places, 697/1968 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s34 0) (EQ s271 1) (EQ s347 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 32 reset in 498 ms.
Product exploration explored 100000 steps with 31 reset in 601 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 5 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 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished probabilistic random walk after 74599 steps, run visited all 1 properties in 600 ms. (steps per millisecond=124 )
Probabilistic random walk after 74599 steps, saw 49883 distinct states, run finished after 600 ms. (steps per millisecond=124 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 697/697 transitions.
Applied a total of 0 rules in 18 ms. Remains 404 /404 variables (removed 0) and now considering 697/697 (removed 0) transitions.
[2023-03-18 21:29:54] [INFO ] Invariant cache hit.
[2023-03-18 21:29:54] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-18 21:29:54] [INFO ] Invariant cache hit.
[2023-03-18 21:29:55] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-18 21:29:55] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 21:29:55] [INFO ] Invariant cache hit.
[2023-03-18 21:29:55] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1043 ms. Remains : 404/404 places, 697/697 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 59 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Finished probabilistic random walk after 74599 steps, run visited all 1 properties in 650 ms. (steps per millisecond=114 )
Probabilistic random walk after 74599 steps, saw 49883 distinct states, run finished after 650 ms. (steps per millisecond=114 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 170 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 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 29 reset in 479 ms.
Product exploration explored 100000 steps with 32 reset in 771 ms.
Built C files in :
/tmp/ltsmin651186844483902544
[2023-03-18 21:29:58] [INFO ] Computing symmetric may disable matrix : 697 transitions.
[2023-03-18 21:29:58] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:29:58] [INFO ] Computing symmetric may enable matrix : 697 transitions.
[2023-03-18 21:29:58] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:29:58] [INFO ] Computing Do-Not-Accords matrix : 697 transitions.
[2023-03-18 21:29:58] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:29:58] [INFO ] Built C files in 189ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin651186844483902544
Running compilation step : cd /tmp/ltsmin651186844483902544;'/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 1961 ms.
Running link step : cd /tmp/ltsmin651186844483902544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin651186844483902544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17560080765900817702.hoa' '--buchi-type=spotba'
LTSmin run took 5403 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-050B-LTLCardinality-12 finished in 15099 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0 U (G(!p0)||(!p0&&G(p1)))))))'
Support contains 5 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1955 transition count 1955
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1955 transition count 1955
Applied a total of 26 rules in 177 ms. Remains 1955 /1968 variables (removed 13) and now considering 1955/1968 (removed 13) transitions.
// Phase 1: matrix 1955 rows 1955 cols
[2023-03-18 21:30:05] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-18 21:30:06] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-18 21:30:06] [INFO ] Invariant cache hit.
[2023-03-18 21:30:07] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
[2023-03-18 21:30:07] [INFO ] Invariant cache hit.
[2023-03-18 21:30:08] [INFO ] Dead Transitions using invariants and state equation in 914 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1955/1968 places, 1955/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2885 ms. Remains : 1955/1968 places, 1955/1968 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1), p0, p0]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(OR (EQ s1143 0) (EQ s1129 1)), p1:(AND (EQ s250 1) (NOT (OR (EQ s1657 0) (EQ s932 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-13 finished in 3122 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)&&F((G(p2)||G(p3)||p1)))))'
Support contains 6 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1953 transition count 1953
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1953 transition count 1953
Applied a total of 30 rules in 297 ms. Remains 1953 /1968 variables (removed 15) and now considering 1953/1968 (removed 15) transitions.
// Phase 1: matrix 1953 rows 1953 cols
[2023-03-18 21:30:09] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-18 21:30:09] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-18 21:30:09] [INFO ] Invariant cache hit.
[2023-03-18 21:30:11] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1959 ms to find 0 implicit places.
[2023-03-18 21:30:11] [INFO ] Invariant cache hit.
[2023-03-18 21:30:12] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1953/1968 places, 1953/1968 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3401 ms. Remains : 1953/1968 places, 1953/1968 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s737 0) (EQ s412 1)), p1:(OR (EQ s653 0) (EQ s1554 1)), p2:(OR (EQ s653 0) (EQ s1554 1)), p3:(OR (EQ s662 0) (EQ s499 1))], nbAcceptance=2, 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 50000 reset in 1242 ms.
Product exploration explored 100000 steps with 50000 reset in 943 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2 p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 139 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLCardinality-15 finished in 5981 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((F(G(!p0)) U p1))))'
Found a Lengthening insensitive property : ShieldRVt-PT-050B-LTLCardinality-00
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Support contains 4 out of 1968 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1968/1968 places, 1968/1968 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 539 transitions
Trivial Post-agglo rules discarded 539 transitions
Performed 539 trivial Post agglomeration. Transition count delta: 539
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 1967 transition count 1428
Reduce places removed 539 places and 0 transitions.
Iterating post reduction 1 with 539 rules applied. Total rules applied 1078 place count 1428 transition count 1428
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 393 Pre rules applied. Total rules applied 1078 place count 1428 transition count 1035
Deduced a syphon composed of 393 places in 2 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 2 with 786 rules applied. Total rules applied 1864 place count 1035 transition count 1035
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1878 place count 1021 transition count 1021
Iterating global reduction 2 with 14 rules applied. Total rules applied 1892 place count 1021 transition count 1021
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 1892 place count 1021 transition count 1007
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 1920 place count 1007 transition count 1007
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 1 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2818 place count 558 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2819 place count 558 transition count 557
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 2821 place count 557 transition count 556
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 3023 place count 456 transition count 656
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3117 place count 409 transition count 702
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3119 place count 407 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3120 place count 406 transition count 700
Applied a total of 3120 rules in 277 ms. Remains 406 /1968 variables (removed 1562) and now considering 700/1968 (removed 1268) transitions.
// Phase 1: matrix 700 rows 406 cols
[2023-03-18 21:30:15] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-18 21:30:15] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-18 21:30:15] [INFO ] Invariant cache hit.
[2023-03-18 21:30:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:30:16] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2023-03-18 21:30:16] [INFO ] Invariant cache hit.
[2023-03-18 21:30:16] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 406/1968 places, 700/1968 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1364 ms. Remains : 406/1968 places, 700/1968 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s134 0) (EQ s308 1)), p0:(OR (EQ s371 0) (EQ s311 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 437 ms.
Product exploration explored 100000 steps with 26 reset in 472 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 p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:30:17] [INFO ] Invariant cache hit.
[2023-03-18 21:30:18] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:30:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2023-03-18 21:30:18] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:30:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:30:18] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:30:18] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-18 21:30:18] [INFO ] After 394ms 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 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 700/700 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 406 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 405 transition count 698
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 5 place count 404 transition count 697
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 404 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 403 transition count 696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 403 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 402 transition count 694
Applied a total of 9 rules in 63 ms. Remains 402 /406 variables (removed 4) and now considering 694/700 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 402/406 places, 694/700 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 42492 steps, run visited all 1 properties in 404 ms. (steps per millisecond=105 )
Probabilistic random walk after 42492 steps, saw 31092 distinct states, run finished after 405 ms. (steps per millisecond=104 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Support contains 4 out of 406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 406/406 places, 700/700 transitions.
Applied a total of 0 rules in 14 ms. Remains 406 /406 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-18 21:30:19] [INFO ] Invariant cache hit.
[2023-03-18 21:30:19] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-18 21:30:19] [INFO ] Invariant cache hit.
[2023-03-18 21:30:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:30:20] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2023-03-18 21:30:20] [INFO ] Invariant cache hit.
[2023-03-18 21:30:20] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1183 ms. Remains : 406/406 places, 700/700 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 179 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:30:21] [INFO ] Invariant cache hit.
[2023-03-18 21:30:21] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:30:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2023-03-18 21:30:21] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:30:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:30:21] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:30:21] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 21:30:21] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 700/700 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 406 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 405 transition count 698
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 5 place count 404 transition count 697
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 404 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 403 transition count 696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 403 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 402 transition count 694
Applied a total of 9 rules in 42 ms. Remains 402 /406 variables (removed 4) and now considering 694/700 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 402/406 places, 694/700 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished probabilistic random walk after 42492 steps, run visited all 1 properties in 276 ms. (steps per millisecond=153 )
Probabilistic random walk after 42492 steps, saw 31092 distinct states, run finished after 277 ms. (steps per millisecond=153 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 277 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Product exploration explored 100000 steps with 20 reset in 569 ms.
Product exploration explored 100000 steps with 23 reset in 562 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Support contains 4 out of 406 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 406/406 places, 700/700 transitions.
Applied a total of 0 rules in 20 ms. Remains 406 /406 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2023-03-18 21:30:24] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-18 21:30:24] [INFO ] Invariant cache hit.
[2023-03-18 21:30:24] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 406/406 places, 700/700 transitions.
Built C files in :
/tmp/ltsmin12975986298893940520
[2023-03-18 21:30:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12975986298893940520
Running compilation step : cd /tmp/ltsmin12975986298893940520;'/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 1347 ms.
Running link step : cd /tmp/ltsmin12975986298893940520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin12975986298893940520;'/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/stateBased10418734898154692776.hoa' '--buchi-type=spotba'
LTSmin run took 1046 ms.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-00 finished in 12375 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-18 21:30:27] [INFO ] Flatten gal took : 52 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 229276 ms.

BK_STOP 1679175027494

--------------------
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-050B"
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-050B, 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-167905975100331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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