Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475400484.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DES-PT-50b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 127K Mar 5 18:22 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 DES-PT-50b-LTLFireability-00
FORMULA_NAME DES-PT-50b-LTLFireability-01
FORMULA_NAME DES-PT-50b-LTLFireability-02
FORMULA_NAME DES-PT-50b-LTLFireability-03
FORMULA_NAME DES-PT-50b-LTLFireability-04
FORMULA_NAME DES-PT-50b-LTLFireability-05
FORMULA_NAME DES-PT-50b-LTLFireability-06
FORMULA_NAME DES-PT-50b-LTLFireability-07
FORMULA_NAME DES-PT-50b-LTLFireability-08
FORMULA_NAME DES-PT-50b-LTLFireability-09
FORMULA_NAME DES-PT-50b-LTLFireability-10
FORMULA_NAME DES-PT-50b-LTLFireability-11
FORMULA_NAME DES-PT-50b-LTLFireability-12
FORMULA_NAME DES-PT-50b-LTLFireability-13
FORMULA_NAME DES-PT-50b-LTLFireability-14
FORMULA_NAME DES-PT-50b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678277981940

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 12:19:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 12:19:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:19:43] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-08 12:19:43] [INFO ] Transformed 479 places.
[2023-03-08 12:19:43] [INFO ] Transformed 430 transitions.
[2023-03-08 12:19:43] [INFO ] Found NUPN structural information;
[2023-03-08 12:19:43] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-50b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 430
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 452 transition count 406
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 452 transition count 406
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 439 transition count 393
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 439 transition count 393
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 88 place count 439 transition count 382
Applied a total of 88 rules in 95 ms. Remains 439 /479 variables (removed 40) and now considering 382/430 (removed 48) transitions.
// Phase 1: matrix 382 rows 439 cols
[2023-03-08 12:19:43] [INFO ] Computed 62 place invariants in 30 ms
[2023-03-08 12:19:44] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-08 12:19:44] [INFO ] Invariant cache hit.
[2023-03-08 12:19:44] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2023-03-08 12:19:44] [INFO ] Invariant cache hit.
[2023-03-08 12:19:44] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 439/479 places, 382/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1319 ms. Remains : 439/479 places, 382/430 transitions.
Support contains 44 out of 439 places after structural reductions.
[2023-03-08 12:19:45] [INFO ] Flatten gal took : 57 ms
[2023-03-08 12:19:45] [INFO ] Flatten gal took : 31 ms
[2023-03-08 12:19:45] [INFO ] Input system was already deterministic with 382 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-08 12:19:46] [INFO ] Invariant cache hit.
[2023-03-08 12:19:46] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2023-03-08 12:19:46] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 28 ms returned sat
[2023-03-08 12:19:46] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-08 12:19:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-08 12:19:46] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-08 12:19:47] [INFO ] After 671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-08 12:19:47] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 4 ms to minimize.
[2023-03-08 12:19:47] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2023-03-08 12:19:47] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-03-08 12:19:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 297 ms
[2023-03-08 12:19:48] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2023-03-08 12:19:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-08 12:19:48] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-08 12:19:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-08 12:19:48] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 0 ms to minimize.
[2023-03-08 12:19:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-08 12:19:48] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2023-03-08 12:19:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-08 12:19:49] [INFO ] After 2046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 540 ms.
[2023-03-08 12:19:49] [INFO ] After 2888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 1356 ms.
Support contains 15 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 432 transition count 364
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 420 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 420 transition count 351
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 407 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 405 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 405 transition count 349
Ensure Unique test 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 2 with 2 rules applied. Total rules applied 59 place count 405 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 404 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 403 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 403 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 403 transition count 344
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 208 place count 331 transition count 272
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 214 place count 328 transition count 280
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 215 place count 328 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 327 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 217 place count 326 transition count 278
Applied a total of 217 rules in 165 ms. Remains 326 /439 variables (removed 113) and now considering 278/382 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 326/439 places, 278/382 transitions.
Incomplete random walk after 10000 steps, including 387 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 643698 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 643698 steps, saw 98615 distinct states, run finished after 3005 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 278 rows 326 cols
[2023-03-08 12:19:54] [INFO ] Computed 61 place invariants in 6 ms
[2023-03-08 12:19:54] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-08 12:19:54] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 12:19:54] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-08 12:19:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-08 12:19:55] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 150 ms returned sat
[2023-03-08 12:19:56] [INFO ] After 1101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-08 12:19:56] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 12:19:56] [INFO ] After 642ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-08 12:19:57] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2023-03-08 12:19:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-08 12:19:57] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2023-03-08 12:19:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-08 12:19:58] [INFO ] After 1757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 770 ms.
[2023-03-08 12:19:58] [INFO ] After 4006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 437 ms.
Support contains 15 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 278/278 transitions.
Applied a total of 0 rules in 16 ms. Remains 326 /326 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 326/326 places, 278/278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 278/278 transitions.
Applied a total of 0 rules in 16 ms. Remains 326 /326 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-08 12:19:59] [INFO ] Invariant cache hit.
[2023-03-08 12:19:59] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 12:19:59] [INFO ] Invariant cache hit.
[2023-03-08 12:19:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-08 12:19:59] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2023-03-08 12:19:59] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 12:19:59] [INFO ] Invariant cache hit.
[2023-03-08 12:20:00] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 873 ms. Remains : 326/326 places, 278/278 transitions.
Graph (complete) has 1096 edges and 326 vertex of which 325 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 325 /326 variables (removed 1) and now considering 278/278 (removed 0) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 278 rows 325 cols
[2023-03-08 12:20:00] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 12:20:00] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 12:20:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 12:20:00] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-08 12:20:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-08 12:20:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 127 ms returned sat
[2023-03-08 12:20:01] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-08 12:20:01] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2023-03-08 12:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-08 12:20:01] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2023-03-08 12:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-08 12:20:01] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2023-03-08 12:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-08 12:20:01] [INFO ] After 1097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 299 ms.
[2023-03-08 12:20:02] [INFO ] After 1760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
FORMULA DES-PT-50b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 257 stabilizing places and 249 stable transitions
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 10 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 28 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 12:20:02] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 12:20:02] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-08 12:20:02] [INFO ] Invariant cache hit.
[2023-03-08 12:20:03] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2023-03-08 12:20:03] [INFO ] Invariant cache hit.
[2023-03-08 12:20:03] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1111 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s421 1) (EQ s431 1)), p1:(AND (EQ s317 1) (EQ s319 1) (EQ s321 1) (EQ s323 1) (EQ s325 1) (EQ s327 1) (EQ s329 1) (EQ s331 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 3 ms.
FORMULA DES-PT-50b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-01 finished in 1393 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 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 431 transition count 365
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 419 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 418 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 27 place count 418 transition count 351
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 53 place count 405 transition count 351
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 404 transition count 350
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 404 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 403 transition count 349
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 403 transition count 348
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 208 place count 328 transition count 273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 214 place count 325 transition count 288
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 222 place count 325 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 323 transition count 278
Applied a total of 224 rules in 125 ms. Remains 323 /439 variables (removed 116) and now considering 278/382 (removed 104) transitions.
// Phase 1: matrix 278 rows 323 cols
[2023-03-08 12:20:03] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 12:20:04] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-08 12:20:04] [INFO ] Invariant cache hit.
[2023-03-08 12:20:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:04] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-08 12:20:04] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 12:20:04] [INFO ] Invariant cache hit.
[2023-03-08 12:20:04] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/439 places, 278/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1000 ms. Remains : 323/439 places, 278/382 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s276 1) (OR (NEQ s206 1) (NEQ s232 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 5570 reset in 315 ms.
Product exploration explored 100000 steps with 5677 reset in 301 ms.
Computed a total of 216 stabilizing places and 217 stable transitions
Computed a total of 216 stabilizing places and 217 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 49 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 278/278 transitions.
Applied a total of 0 rules in 19 ms. Remains 323 /323 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-08 12:20:06] [INFO ] Invariant cache hit.
[2023-03-08 12:20:06] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 12:20:06] [INFO ] Invariant cache hit.
[2023-03-08 12:20:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:06] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-03-08 12:20:06] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 12:20:06] [INFO ] Invariant cache hit.
[2023-03-08 12:20:06] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 788 ms. Remains : 323/323 places, 278/278 transitions.
Computed a total of 216 stabilizing places and 217 stable transitions
Computed a total of 216 stabilizing places and 217 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 146 ms :[(NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5614 reset in 236 ms.
Product exploration explored 100000 steps with 5662 reset in 277 ms.
Built C files in :
/tmp/ltsmin18332255737955255885
[2023-03-08 12:20:07] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2023-03-08 12:20:07] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:20:07] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2023-03-08 12:20:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:20:07] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2023-03-08 12:20:07] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:20:07] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18332255737955255885
Running compilation step : cd /tmp/ltsmin18332255737955255885;'/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 686 ms.
Running link step : cd /tmp/ltsmin18332255737955255885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18332255737955255885;'/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/stateBased403753503917343259.hoa' '--buchi-type=spotba'
LTSmin run took 5045 ms.
FORMULA DES-PT-50b-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLFireability-03 finished in 10012 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 1 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 431 transition count 363
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 417 transition count 363
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 417 transition count 351
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 403 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test 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 2 with 2 rules applied. Total rules applied 59 place count 403 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 402 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 401 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 401 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 401 transition count 344
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 220 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 319 transition count 266
Applied a total of 226 rules in 70 ms. Remains 319 /439 variables (removed 120) and now considering 266/382 (removed 116) transitions.
// Phase 1: matrix 266 rows 319 cols
[2023-03-08 12:20:13] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 12:20:14] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-08 12:20:14] [INFO ] Invariant cache hit.
[2023-03-08 12:20:14] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2023-03-08 12:20:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:20:14] [INFO ] Invariant cache hit.
[2023-03-08 12:20:14] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 319/439 places, 266/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 872 ms. Remains : 319/439 places, 266/382 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s211 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 52 steps with 0 reset in 2 ms.
FORMULA DES-PT-50b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-04 finished in 929 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(G(p0))))'
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 39 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 12:20:14] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-08 12:20:14] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-08 12:20:14] [INFO ] Invariant cache hit.
[2023-03-08 12:20:15] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2023-03-08 12:20:15] [INFO ] Invariant cache hit.
[2023-03-08 12:20:15] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 921 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s275 1) (EQ s48 1) (EQ s289 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-05 finished in 1054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 24 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
[2023-03-08 12:20:15] [INFO ] Invariant cache hit.
[2023-03-08 12:20:15] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-08 12:20:15] [INFO ] Invariant cache hit.
[2023-03-08 12:20:16] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-08 12:20:16] [INFO ] Invariant cache hit.
[2023-03-08 12:20:16] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 962 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s318 1) (EQ s344 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-06 finished in 1053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 431 transition count 364
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 418 transition count 364
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 27 place count 418 transition count 350
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 55 place count 404 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 402 transition count 348
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 402 transition count 348
Ensure Unique test 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 2 with 2 rules applied. Total rules applied 61 place count 402 transition count 346
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 401 transition count 345
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 400 transition count 344
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 400 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 400 transition count 343
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 216 place count 325 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 222 place count 322 transition count 276
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 320 transition count 274
Applied a total of 224 rules in 59 ms. Remains 320 /439 variables (removed 119) and now considering 274/382 (removed 108) transitions.
// Phase 1: matrix 274 rows 320 cols
[2023-03-08 12:20:16] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 12:20:17] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-08 12:20:17] [INFO ] Invariant cache hit.
[2023-03-08 12:20:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:17] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-08 12:20:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:20:17] [INFO ] Invariant cache hit.
[2023-03-08 12:20:17] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/439 places, 274/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 887 ms. Remains : 320/439 places, 274/382 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s57 0) (EQ s315 0)), p1:(OR (EQ s66 0) (EQ s315 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5243 reset in 305 ms.
Product exploration explored 100000 steps with 5213 reset in 266 ms.
Computed a total of 217 stabilizing places and 218 stable transitions
Computed a total of 217 stabilizing places and 218 stable transitions
Detected a total of 217/320 stabilizing places and 218/274 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 422 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 506 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 107 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 897873 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 897873 steps, saw 125746 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 12:20:22] [INFO ] Invariant cache hit.
[2023-03-08 12:20:22] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 12:20:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-08 12:20:22] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 12:20:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:22] [INFO ] After 102ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-08 12:20:22] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-08 12:20:23] [INFO ] After 730ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 274/274 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 320 transition count 273
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 320 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 319 transition count 272
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 319 transition count 272
Applied a total of 4 rules in 21 ms. Remains 319 /320 variables (removed 1) and now considering 272/274 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 319/320 places, 272/274 transitions.
Incomplete random walk after 10000 steps, including 504 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1072588 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :{}
Probabilistic random walk after 1072588 steps, saw 149930 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 272 rows 319 cols
[2023-03-08 12:20:26] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 12:20:26] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 12:20:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 12:20:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 148 ms returned sat
[2023-03-08 12:20:27] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 12:20:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:27] [INFO ] After 73ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 12:20:27] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-08 12:20:27] [INFO ] After 904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 102 ms.
Support contains 3 out of 319 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 272/272 transitions.
Applied a total of 0 rules in 7 ms. Remains 319 /319 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 319/319 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 319/319 places, 272/272 transitions.
Applied a total of 0 rules in 6 ms. Remains 319 /319 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2023-03-08 12:20:27] [INFO ] Invariant cache hit.
[2023-03-08 12:20:27] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 12:20:27] [INFO ] Invariant cache hit.
[2023-03-08 12:20:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:28] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2023-03-08 12:20:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:20:28] [INFO ] Invariant cache hit.
[2023-03-08 12:20:28] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 835 ms. Remains : 319/319 places, 272/272 transitions.
Graph (complete) has 1132 edges and 319 vertex of which 318 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 318 transition count 272
Applied a total of 2 rules in 12 ms. Remains 318 /319 variables (removed 1) and now considering 272/272 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 272 rows 318 cols
[2023-03-08 12:20:28] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 12:20:28] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 12:20:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 12:20:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 104 ms returned sat
[2023-03-08 12:20:29] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 12:20:29] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2023-03-08 12:20:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-08 12:20:29] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-08 12:20:29] [INFO ] After 942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 12 factoid took 416 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLFireability-08 finished in 12947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0&&X((F(p1)||G(!p0))))))'
Support contains 2 out of 439 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 431 transition count 364
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 418 transition count 364
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 27 place count 418 transition count 351
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 403 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test 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 2 with 2 rules applied. Total rules applied 59 place count 403 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 402 transition count 347
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 401 transition count 346
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 401 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 401 transition count 345
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 211 place count 327 transition count 271
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 325 transition count 273
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 217 place count 323 transition count 271
Applied a total of 217 rules in 48 ms. Remains 323 /439 variables (removed 116) and now considering 271/382 (removed 111) transitions.
// Phase 1: matrix 271 rows 323 cols
[2023-03-08 12:20:29] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 12:20:30] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 12:20:30] [INFO ] Invariant cache hit.
[2023-03-08 12:20:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 12:20:30] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-08 12:20:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:20:30] [INFO ] Invariant cache hit.
[2023-03-08 12:20:30] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/439 places, 271/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 838 ms. Remains : 323/439 places, 271/382 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, p0]
Running random walk in product with property : DES-PT-50b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s113 1) (EQ s234 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4440 reset in 260 ms.
Product exploration explored 100000 steps with 4442 reset in 229 ms.
Computed a total of 218 stabilizing places and 215 stable transitions
Computed a total of 218 stabilizing places and 215 stable transitions
Detected a total of 218/323 stabilizing places and 215/271 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 199 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 35 ms :[true, p0]
Incomplete random walk after 10000 steps, including 451 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1565305 steps, run timeout after 3001 ms. (steps per millisecond=521 ) properties seen :{}
Probabilistic random walk after 1565305 steps, saw 205950 distinct states, run finished after 3001 ms. (steps per millisecond=521 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:20:34] [INFO ] Invariant cache hit.
[2023-03-08 12:20:34] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 12:20:34] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:20:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 90 ms returned sat
[2023-03-08 12:20:34] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:20:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 12:20:34] [INFO ] After 21ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:20:34] [INFO ] After 44ms 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-08 12:20:34] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 271/271 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 323 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 322 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 6 place count 321 transition count 274
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 321 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 320 transition count 273
Applied a total of 8 rules in 18 ms. Remains 320 /323 variables (removed 3) and now considering 273/271 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 320/323 places, 273/271 transitions.
Incomplete random walk after 10000 steps, including 497 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1529647 steps, run timeout after 3001 ms. (steps per millisecond=509 ) properties seen :{}
Probabilistic random walk after 1529647 steps, saw 206987 distinct states, run finished after 3001 ms. (steps per millisecond=509 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 320 cols
[2023-03-08 12:20:37] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 12:20:38] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 12:20:38] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:20:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 117 ms returned sat
[2023-03-08 12:20:38] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:20:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:38] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:20:38] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 12:20:38] [INFO ] After 532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 320/320 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2023-03-08 12:20:38] [INFO ] Invariant cache hit.
[2023-03-08 12:20:38] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-08 12:20:38] [INFO ] Invariant cache hit.
[2023-03-08 12:20:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:39] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2023-03-08 12:20:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:20:39] [INFO ] Invariant cache hit.
[2023-03-08 12:20:39] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 839 ms. Remains : 320/320 places, 273/273 transitions.
Graph (complete) has 1114 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 319 /320 variables (removed 1) and now considering 273/273 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 319 cols
[2023-03-08 12:20:39] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 12:20:39] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:39] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 12:20:39] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:20:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:39] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 37 ms returned sat
[2023-03-08 12:20:39] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:20:39] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 12:20:39] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 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 35 ms :[true, p0]
Stuttering acceptance computed with spot in 47 ms :[true, p0]
Support contains 2 out of 323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 271/271 transitions.
Applied a total of 0 rules in 10 ms. Remains 323 /323 variables (removed 0) and now considering 271/271 (removed 0) transitions.
// Phase 1: matrix 271 rows 323 cols
[2023-03-08 12:20:40] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 12:20:40] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-08 12:20:40] [INFO ] Invariant cache hit.
[2023-03-08 12:20:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 12:20:40] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2023-03-08 12:20:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:20:40] [INFO ] Invariant cache hit.
[2023-03-08 12:20:40] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 795 ms. Remains : 323/323 places, 271/271 transitions.
Computed a total of 218 stabilizing places and 215 stable transitions
Computed a total of 218 stabilizing places and 215 stable transitions
Detected a total of 218/323 stabilizing places and 215/271 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 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 36 ms :[true, p0]
Incomplete random walk after 10000 steps, including 460 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1577293 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :{}
Probabilistic random walk after 1577293 steps, saw 207631 distinct states, run finished after 3003 ms. (steps per millisecond=525 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 12:20:44] [INFO ] Invariant cache hit.
[2023-03-08 12:20:44] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 12:20:44] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:20:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:44] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 92 ms returned sat
[2023-03-08 12:20:44] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:20:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-08 12:20:44] [INFO ] After 19ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:20:44] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 12:20:44] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 271/271 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 323 transition count 269
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 322 transition count 268
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 6 place count 321 transition count 274
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 321 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 320 transition count 273
Applied a total of 8 rules in 17 ms. Remains 320 /323 variables (removed 3) and now considering 273/271 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 320/323 places, 273/271 transitions.
Incomplete random walk after 10000 steps, including 483 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1537054 steps, run timeout after 3001 ms. (steps per millisecond=512 ) properties seen :{}
Probabilistic random walk after 1537054 steps, saw 208122 distinct states, run finished after 3001 ms. (steps per millisecond=512 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 320 cols
[2023-03-08 12:20:47] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 12:20:47] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 12:20:47] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:20:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 117 ms returned sat
[2023-03-08 12:20:48] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:20:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:48] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 12:20:48] [INFO ] After 45ms 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-08 12:20:48] [INFO ] After 540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 320/320 places, 273/273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 273/273 transitions.
Applied a total of 0 rules in 5 ms. Remains 320 /320 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2023-03-08 12:20:48] [INFO ] Invariant cache hit.
[2023-03-08 12:20:48] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 12:20:48] [INFO ] Invariant cache hit.
[2023-03-08 12:20:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:48] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2023-03-08 12:20:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:20:48] [INFO ] Invariant cache hit.
[2023-03-08 12:20:49] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 753 ms. Remains : 320/320 places, 273/273 transitions.
Graph (complete) has 1114 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 319 /320 variables (removed 1) and now considering 273/273 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 273 rows 319 cols
[2023-03-08 12:20:49] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 12:20:49] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:49] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 12:20:49] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 12:20:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:20:49] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 41 ms returned sat
[2023-03-08 12:20:49] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 12:20:49] [INFO ] After 215ms 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-08 12:20:49] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 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 43 ms :[true, p0]
Stuttering acceptance computed with spot in 52 ms :[true, p0]
Stuttering acceptance computed with spot in 37 ms :[true, p0]
Product exploration explored 100000 steps with 4478 reset in 199 ms.
Product exploration explored 100000 steps with 4482 reset in 219 ms.
Built C files in :
/tmp/ltsmin1964547712813038029
[2023-03-08 12:20:50] [INFO ] Computing symmetric may disable matrix : 271 transitions.
[2023-03-08 12:20:50] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:20:50] [INFO ] Computing symmetric may enable matrix : 271 transitions.
[2023-03-08 12:20:50] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:20:50] [INFO ] Computing Do-Not-Accords matrix : 271 transitions.
[2023-03-08 12:20:50] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:20:50] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1964547712813038029
Running compilation step : cd /tmp/ltsmin1964547712813038029;'/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 579 ms.
Running link step : cd /tmp/ltsmin1964547712813038029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1964547712813038029;'/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/stateBased10942336426500241123.hoa' '--buchi-type=spotba'
LTSmin run took 6153 ms.
FORMULA DES-PT-50b-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLFireability-09 finished in 27375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(F(p2))))'
Support contains 5 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 24 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 12:20:57] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-08 12:20:57] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-08 12:20:57] [INFO ] Invariant cache hit.
[2023-03-08 12:20:57] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-03-08 12:20:57] [INFO ] Invariant cache hit.
[2023-03-08 12:20:58] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 981 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-50b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s413 1) (EQ s418 1)), p0:(AND (EQ s242 1) (EQ s262 1)), p2:(EQ s241 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 139 steps with 2 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-10 finished in 1218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 431 transition count 363
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 417 transition count 363
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 29 place count 417 transition count 350
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 55 place count 404 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 402 transition count 348
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 402 transition count 348
Ensure Unique test 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 2 with 2 rules applied. Total rules applied 61 place count 402 transition count 346
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 401 transition count 345
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 400 transition count 344
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 400 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 400 transition count 343
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 214 place count 326 transition count 269
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 220 place count 323 transition count 277
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 321 transition count 275
Applied a total of 222 rules in 47 ms. Remains 321 /439 variables (removed 118) and now considering 275/382 (removed 107) transitions.
// Phase 1: matrix 275 rows 321 cols
[2023-03-08 12:20:58] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 12:20:58] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-08 12:20:58] [INFO ] Invariant cache hit.
[2023-03-08 12:20:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:20:58] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-08 12:20:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:20:58] [INFO ] Invariant cache hit.
[2023-03-08 12:20:59] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/439 places, 275/382 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 711 ms. Remains : 321/439 places, 275/382 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s108 1) (EQ s232 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-11 finished in 758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (G(F((p2&&X((p2 U (!p3||G(p2)))))))&&p1)))))'
Support contains 6 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 436 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 436 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 434 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 434 transition count 376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 434 transition count 374
Applied a total of 13 rules in 20 ms. Remains 434 /439 variables (removed 5) and now considering 374/382 (removed 8) transitions.
// Phase 1: matrix 374 rows 434 cols
[2023-03-08 12:20:59] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-08 12:20:59] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 12:20:59] [INFO ] Invariant cache hit.
[2023-03-08 12:20:59] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2023-03-08 12:20:59] [INFO ] Invariant cache hit.
[2023-03-08 12:20:59] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/439 places, 374/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 848 ms. Remains : 434/439 places, 374/382 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (AND (NOT p2) p3)]
Running random walk in product with property : DES-PT-50b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=6 dest: 3}, { cond=(AND p2 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s98 1) (EQ s426 1)), p0:(EQ s251 1), p2:(NEQ s209 1), p3:(AND (EQ s174 1) (EQ s222 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-12 finished in 1136 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||X((!p1 U (p2||G(!p1))))))))'
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 435 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 435 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 433 transition count 375
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 433 transition count 375
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 433 transition count 373
Applied a total of 15 rules in 23 ms. Remains 433 /439 variables (removed 6) and now considering 373/382 (removed 9) transitions.
// Phase 1: matrix 373 rows 433 cols
[2023-03-08 12:21:00] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-08 12:21:00] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 12:21:00] [INFO ] Invariant cache hit.
[2023-03-08 12:21:00] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2023-03-08 12:21:00] [INFO ] Invariant cache hit.
[2023-03-08 12:21:01] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/439 places, 373/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 900 ms. Remains : 433/439 places, 373/382 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DES-PT-50b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s36 1) (EQ s289 1) (OR (EQ s30 0) (EQ s289 0))), p2:(AND (NOT (AND (EQ s36 1) (EQ s289 1))) (NOT (AND (EQ s30 1) (EQ s289 1)))), p1:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 870 reset in 223 ms.
Product exploration explored 100000 steps with 860 reset in 225 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 p2))), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 674 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 700584 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 700584 steps, saw 117408 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-08 12:21:05] [INFO ] Invariant cache hit.
[2023-03-08 12:21:05] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 12:21:05] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 31 ms returned sat
[2023-03-08 12:21:05] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 12:21:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 12:21:06] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 32 ms returned sat
[2023-03-08 12:21:06] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 12:21:06] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-08 12:21:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-08 12:21:06] [INFO ] After 591ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 142 ms.
[2023-03-08 12:21:06] [INFO ] After 899ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 158 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 410 transition count 340
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 399 transition count 340
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 213 place count 322 transition count 263
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 320 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 320 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 319 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 318 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 317 transition count 263
Applied a total of 222 rules in 36 ms. Remains 317 /433 variables (removed 116) and now considering 263/373 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 317/433 places, 263/373 transitions.
Incomplete random walk after 10000 steps, including 485 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 902933 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 902933 steps, saw 126791 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 317 cols
[2023-03-08 12:21:10] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 12:21:10] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 12:21:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 12:21:10] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 12:21:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 12:21:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2023-03-08 12:21:11] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 12:21:11] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2023-03-08 12:21:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-08 12:21:11] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-08 12:21:11] [INFO ] After 945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 165 ms.
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 317/317 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-08 12:21:11] [INFO ] Invariant cache hit.
[2023-03-08 12:21:11] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 12:21:11] [INFO ] Invariant cache hit.
[2023-03-08 12:21:11] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-08 12:21:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:21:11] [INFO ] Invariant cache hit.
[2023-03-08 12:21:12] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 317/317 places, 263/263 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 317 transition count 263
Applied a total of 1 rules in 8 ms. Remains 317 /317 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 263 rows 317 cols
[2023-03-08 12:21:12] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 12:21:12] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 12:21:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 12:21:12] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 12:21:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 12:21:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2023-03-08 12:21:12] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 12:21:12] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-08 12:21:12] [INFO ] After 803ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 p2))), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 541 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND p1 (NOT p2))]
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 426 transition count 354
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 411 transition count 354
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 411 transition count 343
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 400 transition count 343
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 207 place count 323 transition count 266
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 211 place count 321 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 319 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 318 transition count 266
Applied a total of 214 rules in 25 ms. Remains 318 /433 variables (removed 115) and now considering 266/373 (removed 107) transitions.
// Phase 1: matrix 266 rows 318 cols
[2023-03-08 12:21:13] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 12:21:13] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 12:21:13] [INFO ] Invariant cache hit.
[2023-03-08 12:21:14] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-08 12:21:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:21:14] [INFO ] Invariant cache hit.
[2023-03-08 12:21:14] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 318/433 places, 266/373 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 654 ms. Remains : 318/433 places, 266/373 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/318 stabilizing places and 210/266 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 232 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 540 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 985650 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :{}
Probabilistic random walk after 985650 steps, saw 138043 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 12:21:17] [INFO ] Invariant cache hit.
[2023-03-08 12:21:17] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:21:17] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 12:21:17] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 12:21:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 12:21:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-08 12:21:18] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 12:21:18] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 12:21:18] [INFO ] After 579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 266/266 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 318 transition count 265
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 318 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 317 transition count 264
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 317 transition count 264
Applied a total of 4 rules in 14 ms. Remains 317 /318 variables (removed 1) and now considering 264/266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 317/318 places, 264/266 transitions.
Incomplete random walk after 10000 steps, including 507 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1153251 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :{}
Probabilistic random walk after 1153251 steps, saw 160316 distinct states, run finished after 3001 ms. (steps per millisecond=384 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 264 rows 317 cols
[2023-03-08 12:21:21] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 12:21:21] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:21:21] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 12:21:21] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 12:21:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:21:21] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 45 ms returned sat
[2023-03-08 12:21:22] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 12:21:22] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-08 12:21:22] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 317/317 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 264/264 transitions.
Applied a total of 0 rules in 4 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2023-03-08 12:21:22] [INFO ] Invariant cache hit.
[2023-03-08 12:21:22] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 12:21:22] [INFO ] Invariant cache hit.
[2023-03-08 12:21:22] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-08 12:21:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:21:22] [INFO ] Invariant cache hit.
[2023-03-08 12:21:22] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 632 ms. Remains : 317/317 places, 264/264 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 317 transition count 264
Applied a total of 1 rules in 9 ms. Remains 317 /317 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 264 rows 317 cols
[2023-03-08 12:21:22] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 12:21:22] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:21:22] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 12:21:22] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 12:21:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 12:21:22] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 40 ms returned sat
[2023-03-08 12:21:23] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 12:21:23] [INFO ] After 320ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 12:21:23] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 292 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 25 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND p1 (NOT p2))]
Product exploration explored 100000 steps with 5424 reset in 196 ms.
Product exploration explored 100000 steps with 5445 reset in 218 ms.
Built C files in :
/tmp/ltsmin17519509215541034689
[2023-03-08 12:21:24] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2023-03-08 12:21:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:21:24] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2023-03-08 12:21:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:21:24] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2023-03-08 12:21:24] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:21:24] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17519509215541034689
Running compilation step : cd /tmp/ltsmin17519509215541034689;'/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 561 ms.
Running link step : cd /tmp/ltsmin17519509215541034689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17519509215541034689;'/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/stateBased17173794320498302212.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 266/266 (removed 0) transitions.
// Phase 1: matrix 266 rows 318 cols
[2023-03-08 12:21:39] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 12:21:39] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 12:21:39] [INFO ] Invariant cache hit.
[2023-03-08 12:21:39] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-08 12:21:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:21:39] [INFO ] Invariant cache hit.
[2023-03-08 12:21:40] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 671 ms. Remains : 318/318 places, 266/266 transitions.
Built C files in :
/tmp/ltsmin9185925975603889560
[2023-03-08 12:21:40] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2023-03-08 12:21:40] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:21:40] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2023-03-08 12:21:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:21:40] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2023-03-08 12:21:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:21:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9185925975603889560
Running compilation step : cd /tmp/ltsmin9185925975603889560;'/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 552 ms.
Running link step : cd /tmp/ltsmin9185925975603889560;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9185925975603889560;'/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/stateBased4400909259002437737.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 12:21:55] [INFO ] Flatten gal took : 18 ms
[2023-03-08 12:21:55] [INFO ] Flatten gal took : 18 ms
[2023-03-08 12:21:55] [INFO ] Time to serialize gal into /tmp/LTL12493355390587288948.gal : 5 ms
[2023-03-08 12:21:55] [INFO ] Time to serialize properties into /tmp/LTL13605298933114325513.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/LTL12493355390587288948.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8761304096338845962.hoa' '-atoms' '/tmp/LTL13605298933114325513.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13605298933114325513.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8761304096338845962.hoa
Detected timeout of ITS tools.
[2023-03-08 12:22:10] [INFO ] Flatten gal took : 17 ms
[2023-03-08 12:22:10] [INFO ] Flatten gal took : 16 ms
[2023-03-08 12:22:10] [INFO ] Time to serialize gal into /tmp/LTL4001879433984403397.gal : 2 ms
[2023-03-08 12:22:10] [INFO ] Time to serialize properties into /tmp/LTL4305765051828575863.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/LTL4001879433984403397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4305765051828575863.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G((X((!("((p31==1)&&(p330==1))"))U(("((!((p37==1)&&(p330==1)))&&(!((p31==1)&&(p330==1))))")||(G(!("((p31==1)&&(p330==1))"))))))||...209
Formula 0 simplified : GF(!"(((p37==1)&&(p330==1))&&((p31==0)||(p330==0)))" & X("((p31==1)&&(p330==1))" M !"((!((p37==1)&&(p330==1)))&&(!((p31==1)&&(p330==...163
Detected timeout of ITS tools.
[2023-03-08 12:22:25] [INFO ] Flatten gal took : 15 ms
[2023-03-08 12:22:25] [INFO ] Applying decomposition
[2023-03-08 12:22:25] [INFO ] Flatten gal took : 15 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/graph7060212882335689032.txt' '-o' '/tmp/graph7060212882335689032.bin' '-w' '/tmp/graph7060212882335689032.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7060212882335689032.bin' '-l' '-1' '-v' '-w' '/tmp/graph7060212882335689032.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:22:25] [INFO ] Decomposing Gal with order
[2023-03-08 12:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:22:25] [INFO ] Removed a total of 45 redundant transitions.
[2023-03-08 12:22:25] [INFO ] Flatten gal took : 47 ms
[2023-03-08 12:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 7 ms.
[2023-03-08 12:22:25] [INFO ] Time to serialize gal into /tmp/LTL7540607405946470814.gal : 9 ms
[2023-03-08 12:22:25] [INFO ] Time to serialize properties into /tmp/LTL6159486900236236636.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/LTL7540607405946470814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6159486900236236636.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G((X((!("((u10.p31==1)&&(u10.p330==1))"))U(("((!((u10.p37==1)&&(u10.p330==1)))&&(!((u10.p31==1)&&(u10.p330==1))))")||(G(!("((u10....257
Formula 0 simplified : GF(!"(((u10.p37==1)&&(u10.p330==1))&&((u10.p31==0)||(u10.p330==0)))" & X("((u10.p31==1)&&(u10.p330==1))" M !"((!((u10.p37==1)&&(u10....203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15847504044694186272
[2023-03-08 12:22:40] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15847504044694186272
Running compilation step : cd /tmp/ltsmin15847504044694186272;'/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 440 ms.
Running link step : cd /tmp/ltsmin15847504044694186272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15847504044694186272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50b-LTLFireability-13 finished in 115492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 2 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 436 transition count 379
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 436 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 436 transition count 378
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 435 transition count 377
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 435 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 435 transition count 376
Applied a total of 10 rules in 21 ms. Remains 435 /439 variables (removed 4) and now considering 376/382 (removed 6) transitions.
// Phase 1: matrix 376 rows 435 cols
[2023-03-08 12:22:55] [INFO ] Computed 62 place invariants in 8 ms
[2023-03-08 12:22:55] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-08 12:22:55] [INFO ] Invariant cache hit.
[2023-03-08 12:22:56] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2023-03-08 12:22:56] [INFO ] Invariant cache hit.
[2023-03-08 12:22:56] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 435/439 places, 376/382 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 920 ms. Remains : 435/439 places, 376/382 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s299 0), p1:(EQ s216 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA DES-PT-50b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLFireability-15 finished in 1067 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||X((!p1 U (p2||G(!p1))))))))'
Found a Lengthening insensitive property : DES-PT-50b-LTLFireability-13
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Support contains 3 out of 439 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 439/439 places, 382/382 transitions.
Graph (complete) has 1018 edges and 439 vertex of which 432 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 431 transition count 363
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 417 transition count 363
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 29 place count 417 transition count 351
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 53 place count 405 transition count 351
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 403 transition count 349
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 403 transition count 349
Ensure Unique test 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 2 with 2 rules applied. Total rules applied 59 place count 403 transition count 347
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 402 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 401 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 401 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 401 transition count 344
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 216 place count 325 transition count 268
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 222 place count 322 transition count 276
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 320 transition count 274
Applied a total of 224 rules in 48 ms. Remains 320 /439 variables (removed 119) and now considering 274/382 (removed 108) transitions.
// Phase 1: matrix 274 rows 320 cols
[2023-03-08 12:22:57] [INFO ] Computed 59 place invariants in 9 ms
[2023-03-08 12:22:57] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 12:22:57] [INFO ] Invariant cache hit.
[2023-03-08 12:22:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:22:57] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-08 12:22:57] [INFO ] Invariant cache hit.
[2023-03-08 12:22:57] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 320/439 places, 274/382 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 837 ms. Remains : 320/439 places, 274/382 transitions.
Running random walk in product with property : DES-PT-50b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s31 1) (EQ s233 1) (OR (EQ s25 0) (EQ s233 0))), p2:(AND (NOT (AND (EQ s31 1) (EQ s233 1))) (NOT (AND (EQ s25 1) (EQ s233 1)))), p1:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5410 reset in 271 ms.
Product exploration explored 100000 steps with 5447 reset in 286 ms.
Computed a total of 217 stabilizing places and 218 stable transitions
Computed a total of 217 stabilizing places and 218 stable transitions
Detected a total of 217/320 stabilizing places and 218/274 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 p2))), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 678 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 546 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 111 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 765676 steps, run timeout after 3001 ms. (steps per millisecond=255 ) properties seen :{}
Probabilistic random walk after 765676 steps, saw 107304 distinct states, run finished after 3001 ms. (steps per millisecond=255 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-08 12:23:02] [INFO ] Invariant cache hit.
[2023-03-08 12:23:02] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-08 12:23:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 12:23:02] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2023-03-08 12:23:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 12:23:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 83 ms returned sat
[2023-03-08 12:23:03] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 12:23:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:23:03] [INFO ] After 100ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-08 12:23:03] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-08 12:23:03] [INFO ] After 1003ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1421 steps, including 2 resets, run visited all 2 properties in 19 ms. (steps per millisecond=74 )
Parikh walk visited 4 properties in 62 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 p2))), (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) (NOT p2))))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))]
Knowledge based reduction with 16 factoid took 621 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 34 ms :[(AND p1 (NOT p2))]
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 274/274 transitions.
Applied a total of 0 rules in 5 ms. Remains 320 /320 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-08 12:23:04] [INFO ] Invariant cache hit.
[2023-03-08 12:23:04] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 12:23:04] [INFO ] Invariant cache hit.
[2023-03-08 12:23:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:23:05] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 627 ms to find 0 implicit places.
[2023-03-08 12:23:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 12:23:05] [INFO ] Invariant cache hit.
[2023-03-08 12:23:05] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 766 ms. Remains : 320/320 places, 274/274 transitions.
Computed a total of 217 stabilizing places and 218 stable transitions
Computed a total of 217 stabilizing places and 218 stable transitions
Detected a total of 217/320 stabilizing places and 218/274 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 242 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 550 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 951553 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 951553 steps, saw 132907 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 12:23:08] [INFO ] Invariant cache hit.
[2023-03-08 12:23:08] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 12:23:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 12:23:08] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 12:23:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-08 12:23:09] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 111 ms returned sat
[2023-03-08 12:23:09] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 12:23:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:23:09] [INFO ] After 55ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 12:23:09] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-08 12:23:09] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1333 steps, including 2 resets, run visited all 2 properties in 12 ms. (steps per millisecond=111 )
Parikh walk visited 2 properties in 13 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND p1 (NOT p2))]
Product exploration explored 100000 steps with 5499 reset in 209 ms.
Product exploration explored 100000 steps with 5449 reset in 229 ms.
Built C files in :
/tmp/ltsmin2468235441209389433
[2023-03-08 12:23:10] [INFO ] Computing symmetric may disable matrix : 274 transitions.
[2023-03-08 12:23:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:23:10] [INFO ] Computing symmetric may enable matrix : 274 transitions.
[2023-03-08 12:23:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:23:10] [INFO ] Computing Do-Not-Accords matrix : 274 transitions.
[2023-03-08 12:23:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:23:10] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2468235441209389433
Running compilation step : cd /tmp/ltsmin2468235441209389433;'/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 580 ms.
Running link step : cd /tmp/ltsmin2468235441209389433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2468235441209389433;'/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/stateBased13437882683419163813.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 274/274 transitions.
Applied a total of 0 rules in 6 ms. Remains 320 /320 variables (removed 0) and now considering 274/274 (removed 0) transitions.
[2023-03-08 12:23:25] [INFO ] Invariant cache hit.
[2023-03-08 12:23:25] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-08 12:23:25] [INFO ] Invariant cache hit.
[2023-03-08 12:23:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 12:23:26] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2023-03-08 12:23:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 12:23:26] [INFO ] Invariant cache hit.
[2023-03-08 12:23:26] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 826 ms. Remains : 320/320 places, 274/274 transitions.
Built C files in :
/tmp/ltsmin17783521813615233574
[2023-03-08 12:23:26] [INFO ] Computing symmetric may disable matrix : 274 transitions.
[2023-03-08 12:23:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:23:26] [INFO ] Computing symmetric may enable matrix : 274 transitions.
[2023-03-08 12:23:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:23:26] [INFO ] Computing Do-Not-Accords matrix : 274 transitions.
[2023-03-08 12:23:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:23:26] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17783521813615233574
Running compilation step : cd /tmp/ltsmin17783521813615233574;'/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 584 ms.
Running link step : cd /tmp/ltsmin17783521813615233574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17783521813615233574;'/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/stateBased15643733350687292112.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 12:23:41] [INFO ] Flatten gal took : 16 ms
[2023-03-08 12:23:41] [INFO ] Flatten gal took : 14 ms
[2023-03-08 12:23:41] [INFO ] Time to serialize gal into /tmp/LTL17589728998836899827.gal : 3 ms
[2023-03-08 12:23:41] [INFO ] Time to serialize properties into /tmp/LTL10650880625619868869.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17589728998836899827.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6207053164893070146.hoa' '-atoms' '/tmp/LTL10650880625619868869.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10650880625619868869.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6207053164893070146.hoa
Detected timeout of ITS tools.
[2023-03-08 12:23:56] [INFO ] Flatten gal took : 13 ms
[2023-03-08 12:23:56] [INFO ] Flatten gal took : 12 ms
[2023-03-08 12:23:56] [INFO ] Time to serialize gal into /tmp/LTL11559862417037377347.gal : 2 ms
[2023-03-08 12:23:56] [INFO ] Time to serialize properties into /tmp/LTL11917695668021904682.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11559862417037377347.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11917695668021904682.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((X((!("((p31==1)&&(p330==1))"))U(("((!((p37==1)&&(p330==1)))&&(!((p31==1)&&(p330==1))))")||(G(!("((p31==1)&&(p330==1))"))))))||...209
Formula 0 simplified : GF(!"(((p37==1)&&(p330==1))&&((p31==0)||(p330==0)))" & X("((p31==1)&&(p330==1))" M !"((!((p37==1)&&(p330==1)))&&(!((p31==1)&&(p330==...163
Detected timeout of ITS tools.
[2023-03-08 12:24:11] [INFO ] Flatten gal took : 12 ms
[2023-03-08 12:24:11] [INFO ] Applying decomposition
[2023-03-08 12:24:11] [INFO ] Flatten gal took : 11 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/graph90375393776413247.txt' '-o' '/tmp/graph90375393776413247.bin' '-w' '/tmp/graph90375393776413247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph90375393776413247.bin' '-l' '-1' '-v' '-w' '/tmp/graph90375393776413247.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:24:11] [INFO ] Decomposing Gal with order
[2023-03-08 12:24:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:24:11] [INFO ] Removed a total of 48 redundant transitions.
[2023-03-08 12:24:11] [INFO ] Flatten gal took : 17 ms
[2023-03-08 12:24:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 3 ms.
[2023-03-08 12:24:11] [INFO ] Time to serialize gal into /tmp/LTL14455014506994367844.gal : 3 ms
[2023-03-08 12:24:11] [INFO ] Time to serialize properties into /tmp/LTL14281939163901520093.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/LTL14455014506994367844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14281939163901520093.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 : !((F(G((X((!("((u8.p31==1)&&(u8.p330==1))"))U(("((!((u8.p37==1)&&(u8.p330==1)))&&(!((u8.p31==1)&&(u8.p330==1))))")||(G(!("((u8.p31==1)...245
Formula 0 simplified : GF(!"(((u8.p37==1)&&(u8.p330==1))&&((u8.p31==0)||(u8.p330==0)))" & X("((u8.p31==1)&&(u8.p330==1))" M !"((!((u8.p37==1)&&(u8.p330==1)...193
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10915811110266726283
[2023-03-08 12:24:26] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10915811110266726283
Running compilation step : cd /tmp/ltsmin10915811110266726283;'/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 462 ms.
Running link step : cd /tmp/ltsmin10915811110266726283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10915811110266726283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X((!(LTLAPp0==true) U ((LTLAPp1==true)||[](!(LTLAPp0==true)))))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50b-LTLFireability-13 finished in 105007 ms.
[2023-03-08 12:24:41] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12414221768013335163
[2023-03-08 12:24:41] [INFO ] Computing symmetric may disable matrix : 382 transitions.
[2023-03-08 12:24:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:24:41] [INFO ] Computing symmetric may enable matrix : 382 transitions.
[2023-03-08 12:24:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:24:41] [INFO ] Applying decomposition
[2023-03-08 12:24:41] [INFO ] Flatten gal took : 12 ms
[2023-03-08 12:24:41] [INFO ] Computing Do-Not-Accords matrix : 382 transitions.
[2023-03-08 12:24:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 12:24:41] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12414221768013335163
Running compilation step : cd /tmp/ltsmin12414221768013335163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph6079515236566048729.txt' '-o' '/tmp/graph6079515236566048729.bin' '-w' '/tmp/graph6079515236566048729.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6079515236566048729.bin' '-l' '-1' '-v' '-w' '/tmp/graph6079515236566048729.weights' '-q' '0' '-e' '0.001'
[2023-03-08 12:24:41] [INFO ] Decomposing Gal with order
[2023-03-08 12:24:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:24:41] [INFO ] Removed a total of 16 redundant transitions.
[2023-03-08 12:24:41] [INFO ] Flatten gal took : 41 ms
[2023-03-08 12:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2023-03-08 12:24:41] [INFO ] Time to serialize gal into /tmp/LTLFireability1098762052770903618.gal : 10 ms
[2023-03-08 12:24:41] [INFO ] Time to serialize properties into /tmp/LTLFireability13373464082581053782.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1098762052770903618.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13373464082581053782.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((i6.u35.p37==1)&&(i6.u35.p330==1))&&((i6.u35.p31==0)||(i6.u35.p330==0)))")||(X((!("((i6.u35.p31==1)&&(i6.u35.p330==1))"))U(...293
Formula 0 simplified : GF(!"(((i6.u35.p37==1)&&(i6.u35.p330==1))&&((i6.u35.p31==0)||(i6.u35.p330==0)))" & X("((i6.u35.p31==1)&&(i6.u35.p330==1))" M !"((!((...233
Compilation finished in 798 ms.
Running link step : cd /tmp/ltsmin12414221768013335163;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12414221768013335163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t117, t124, t284, t343, t344, t376, u32.t79, u8.t235, u8.t236, u8.t237, u8.t238, u8....1219
Computing Next relation with stutter on 3.82821e+08 deadlock states
Detected timeout of ITS tools.
[2023-03-08 12:46:21] [INFO ] Applying decomposition
[2023-03-08 12:46:21] [INFO ] Flatten gal took : 32 ms
[2023-03-08 12:46:21] [INFO ] Decomposing Gal with order
[2023-03-08 12:46:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:46:21] [INFO ] Removed a total of 205 redundant transitions.
[2023-03-08 12:46:21] [INFO ] Flatten gal took : 92 ms
[2023-03-08 12:46:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 686 labels/synchronizations in 42 ms.
[2023-03-08 12:46:21] [INFO ] Time to serialize gal into /tmp/LTLFireability1587611490759141335.gal : 5 ms
[2023-03-08 12:46:21] [INFO ] Time to serialize properties into /tmp/LTLFireability8748007363812122016.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1587611490759141335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8748007363812122016.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((i0.i0.i0.u4.p37==1)&&(i1.i1.i0.i0.u137.p330==1))&&((i0.i0.i0.u4.p31==0)||(i1.i1.i0.i0.u137.p330==0)))")||(X((!("((i0.i0.i0...383
Formula 0 simplified : GF(!"(((i0.i0.i0.u4.p37==1)&&(i1.i1.i0.i0.u137.p330==1))&&((i0.i0.i0.u4.p31==0)||(i1.i1.i0.i0.u137.p330==0)))" & X("((i0.i0.i0.u4.p3...308
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: LTL layer: formula: <>([](((LTLAPp0==true)||X((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.011: "<>([](((LTLAPp0==true)||X((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.011: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.096: There are 386 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.096: State length is 440, there are 390 groups
pins2lts-mc-linux64( 0/ 8), 0.096: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.096: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.096: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.096: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.141: [Blue] ~89 levels ~960 states ~3136 transitions
pins2lts-mc-linux64( 4/ 8), 0.166: [Blue] ~91 levels ~1920 states ~6088 transitions
pins2lts-mc-linux64( 1/ 8), 0.206: [Blue] ~87 levels ~3840 states ~12432 transitions
pins2lts-mc-linux64( 1/ 8), 0.259: [Blue] ~87 levels ~7680 states ~27720 transitions
pins2lts-mc-linux64( 1/ 8), 0.387: [Blue] ~88 levels ~15360 states ~57904 transitions
pins2lts-mc-linux64( 1/ 8), 0.673: [Blue] ~88 levels ~30720 states ~132688 transitions
pins2lts-mc-linux64( 1/ 8), 1.102: [Blue] ~88 levels ~61440 states ~285272 transitions
pins2lts-mc-linux64( 2/ 8), 1.904: [Blue] ~292 levels ~122880 states ~538960 transitions
pins2lts-mc-linux64( 2/ 8), 8.070: [Blue] ~292 levels ~245760 states ~1153416 transitions
pins2lts-mc-linux64( 2/ 8), 17.029: [Blue] ~295 levels ~491520 states ~2307408 transitions
pins2lts-mc-linux64( 1/ 8), 37.575: [Blue] ~90 levels ~983040 states ~5772992 transitions
pins2lts-mc-linux64( 2/ 8), 61.204: [Blue] ~403 levels ~1966080 states ~10049064 transitions
pins2lts-mc-linux64( 2/ 8), 86.349: [Blue] ~403 levels ~3932160 states ~22300768 transitions
pins2lts-mc-linux64( 2/ 8), 128.215: [Blue] ~403 levels ~7864320 states ~49091232 transitions
pins2lts-mc-linux64( 1/ 8), 206.364: [Blue] ~135 levels ~15728640 states ~108366760 transitions
pins2lts-mc-linux64( 1/ 8), 362.450: [Blue] ~135 levels ~31457280 states ~209036744 transitions
pins2lts-mc-linux64( 1/ 8), 680.805: [Blue] ~135 levels ~62914560 states ~437951704 transitions
pins2lts-mc-linux64( 1/ 8), 1331.104: [Blue] ~135 levels ~125829120 states ~913326968 transitions
pins2lts-mc-linux64( 0/ 8), 1501.600: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1501.627:
pins2lts-mc-linux64( 0/ 8), 1501.627: Explored 134729386 states 1102727494 transitions, fanout: 8.185
pins2lts-mc-linux64( 0/ 8), 1501.627: Total exploration time 1501.500 sec (1501.480 sec minimum, 1501.490 sec on average)
pins2lts-mc-linux64( 0/ 8), 1501.627: States per second: 89730, Transitions per second: 734417
pins2lts-mc-linux64( 0/ 8), 1501.627:
pins2lts-mc-linux64( 0/ 8), 1501.627: State space has 134216928 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1501.627: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1501.627: blue states: 134729386 (100.38%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1501.627: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1501.627: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1501.627:
pins2lts-mc-linux64( 0/ 8), 1501.627: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1501.627:
pins2lts-mc-linux64( 0/ 8), 1501.627: Queue width: 8B, total height: 2235, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1501.627: Tree memory: 1144.4MB, 8.9 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1501.627: Tree fill ratio (roots/leafs): 99.0%/47.0%
pins2lts-mc-linux64( 0/ 8), 1501.627: Stored 403 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1501.627: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1501.627: Est. total memory use: 1144.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12414221768013335163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12414221768013335163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)||X((!(LTLAPp1==true) U ((LTLAPp2==true)||[](!(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-08 13:08:01] [INFO ] Flatten gal took : 13 ms
[2023-03-08 13:08:01] [INFO ] Input system was already deterministic with 382 transitions.
[2023-03-08 13:08:01] [INFO ] Transformed 439 places.
[2023-03-08 13:08:01] [INFO ] Transformed 382 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-08 13:08:01] [INFO ] Time to serialize gal into /tmp/LTLFireability3519715430869417498.gal : 13 ms
[2023-03-08 13:08:01] [INFO ] Time to serialize properties into /tmp/LTLFireability840975013893441972.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3519715430869417498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability840975013893441972.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(((p37==1)&&(p330==1))&&((p31==0)||(p330==0)))")||(X((!("((p31==1)&&(p330==1))"))U(("((!((p37==1)&&(p330==1)))&&(!((p31==1)&&...209
Formula 0 simplified : GF(!"(((p37==1)&&(p330==1))&&((p31==0)||(p330==0)))" & X("((p31==1)&&(p330==1))" M !"((!((p37==1)&&(p330==1)))&&(!((p31==1)&&(p330==...163
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11289564 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16034976 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-50b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475400484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;