Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679186665168

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=ShieldIIPt-PT-020B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 00:44:27] [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-19 00:44:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:44:27] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-19 00:44:28] [INFO ] Transformed 1403 places.
[2023-03-19 00:44:28] [INFO ] Transformed 1303 transitions.
[2023-03-19 00:44:28] [INFO ] Found NUPN structural information;
[2023-03-19 00:44:28] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 405 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 2 formulas.
FORMULA ShieldIIPt-PT-020B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 211 places :
Symmetric choice reduction at 0 with 211 rule applications. Total rules 211 place count 1192 transition count 1092
Iterating global reduction 0 with 211 rules applied. Total rules applied 422 place count 1192 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 423 place count 1191 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 424 place count 1191 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 425 place count 1190 transition count 1090
Iterating global reduction 0 with 1 rules applied. Total rules applied 426 place count 1190 transition count 1090
Applied a total of 426 rules in 434 ms. Remains 1190 /1403 variables (removed 213) and now considering 1090/1303 (removed 213) transitions.
// Phase 1: matrix 1090 rows 1190 cols
[2023-03-19 00:44:28] [INFO ] Computed 181 place invariants in 33 ms
[2023-03-19 00:44:29] [INFO ] Implicit Places using invariants in 852 ms returned []
[2023-03-19 00:44:29] [INFO ] Invariant cache hit.
[2023-03-19 00:44:31] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 2708 ms to find 0 implicit places.
[2023-03-19 00:44:31] [INFO ] Invariant cache hit.
[2023-03-19 00:44:32] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1190/1403 places, 1090/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4283 ms. Remains : 1190/1403 places, 1090/1303 transitions.
Support contains 40 out of 1190 places after structural reductions.
[2023-03-19 00:44:32] [INFO ] Flatten gal took : 110 ms
[2023-03-19 00:44:33] [INFO ] Flatten gal took : 45 ms
[2023-03-19 00:44:33] [INFO ] Input system was already deterministic with 1090 transitions.
Support contains 37 out of 1190 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 30) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-19 00:44:34] [INFO ] Invariant cache hit.
[2023-03-19 00:44:34] [INFO ] [Real]Absence check using 181 positive place invariants in 76 ms returned sat
[2023-03-19 00:44:34] [INFO ] After 862ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-19 00:44:35] [INFO ] [Nat]Absence check using 181 positive place invariants in 111 ms returned sat
[2023-03-19 00:44:38] [INFO ] After 1785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-19 00:44:38] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 31 ms to minimize.
[2023-03-19 00:44:38] [INFO ] Deduced a trap composed of 30 places in 311 ms of which 1 ms to minimize.
[2023-03-19 00:44:39] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 1 ms to minimize.
[2023-03-19 00:44:39] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 1 ms to minimize.
[2023-03-19 00:44:39] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 1 ms to minimize.
[2023-03-19 00:44:39] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 0 ms to minimize.
[2023-03-19 00:44:40] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 0 ms to minimize.
[2023-03-19 00:44:40] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 1 ms to minimize.
[2023-03-19 00:44:40] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 1 ms to minimize.
[2023-03-19 00:44:40] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 1 ms to minimize.
[2023-03-19 00:44:41] [INFO ] Deduced a trap composed of 34 places in 333 ms of which 2 ms to minimize.
[2023-03-19 00:44:41] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 1 ms to minimize.
[2023-03-19 00:44:41] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 0 ms to minimize.
[2023-03-19 00:44:41] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 0 ms to minimize.
[2023-03-19 00:44:42] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 1 ms to minimize.
[2023-03-19 00:44:42] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 0 ms to minimize.
[2023-03-19 00:44:42] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 0 ms to minimize.
[2023-03-19 00:44:42] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 1 ms to minimize.
[2023-03-19 00:44:42] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2023-03-19 00:44:43] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 1 ms to minimize.
[2023-03-19 00:44:43] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 0 ms to minimize.
[2023-03-19 00:44:43] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 3 ms to minimize.
[2023-03-19 00:44:43] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 0 ms to minimize.
[2023-03-19 00:44:44] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 1 ms to minimize.
[2023-03-19 00:44:44] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 0 ms to minimize.
[2023-03-19 00:44:44] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2023-03-19 00:44:44] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6493 ms
[2023-03-19 00:44:45] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 1 ms to minimize.
[2023-03-19 00:44:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2023-03-19 00:44:45] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2023-03-19 00:44:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-19 00:44:46] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2023-03-19 00:44:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-19 00:44:46] [INFO ] After 10524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1012 ms.
[2023-03-19 00:44:47] [INFO ] After 12863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 807 ms.
Support contains 21 out of 1190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 1190 transition count 864
Reduce places removed 226 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 230 rules applied. Total rules applied 456 place count 964 transition count 860
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 460 place count 960 transition count 860
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 460 place count 960 transition count 710
Deduced a syphon composed of 150 places in 5 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 760 place count 810 transition count 710
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 763 place count 807 transition count 707
Iterating global reduction 3 with 3 rules applied. Total rules applied 766 place count 807 transition count 707
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 766 place count 807 transition count 704
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 772 place count 804 transition count 704
Performed 343 Post agglomeration using F-continuation condition.Transition count delta: 343
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 3 with 686 rules applied. Total rules applied 1458 place count 461 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1459 place count 461 transition count 360
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1461 place count 460 transition count 359
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 1565 place count 408 transition count 388
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1566 place count 408 transition count 387
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1568 place count 408 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1570 place count 406 transition count 385
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 1590 place count 406 transition count 385
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1591 place count 405 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1593 place count 403 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1593 place count 403 transition count 383
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1595 place count 402 transition count 383
Applied a total of 1595 rules in 204 ms. Remains 402 /1190 variables (removed 788) and now considering 383/1090 (removed 707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 402/1190 places, 383/1090 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 383 rows 402 cols
[2023-03-19 00:44:49] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-19 00:44:49] [INFO ] [Real]Absence check using 179 positive place invariants in 35 ms returned sat
[2023-03-19 00:44:50] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 00:44:50] [INFO ] [Nat]Absence check using 179 positive place invariants in 45 ms returned sat
[2023-03-19 00:44:50] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 00:44:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:44:51] [INFO ] After 195ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 00:44:51] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 1 ms to minimize.
[2023-03-19 00:44:51] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 3 ms to minimize.
[2023-03-19 00:44:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2023-03-19 00:44:51] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-19 00:44:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-19 00:44:51] [INFO ] After 981ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-19 00:44:52] [INFO ] After 1838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 123 ms.
Support contains 11 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 383/383 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 401 transition count 382
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 401 transition count 377
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 396 transition count 377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 395 transition count 376
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 392 transition count 380
Applied a total of 20 rules in 58 ms. Remains 392 /402 variables (removed 10) and now considering 380/383 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 392/402 places, 380/383 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 380 rows 392 cols
[2023-03-19 00:44:52] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-19 00:44:52] [INFO ] [Real]Absence check using 179 positive place invariants in 20 ms returned sat
[2023-03-19 00:44:53] [INFO ] After 195ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-19 00:44:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:44:53] [INFO ] After 30ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:44:53] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:44:53] [INFO ] [Nat]Absence check using 179 positive place invariants in 28 ms returned sat
[2023-03-19 00:44:53] [INFO ] After 295ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 00:44:53] [INFO ] After 104ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 00:44:53] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-19 00:44:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-19 00:44:53] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2023-03-19 00:44:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-19 00:44:53] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-19 00:44:54] [INFO ] After 1047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 6 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 380/380 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 392 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 391 transition count 379
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 391 transition count 377
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 6 place count 389 transition count 377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 388 transition count 376
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 386 transition count 377
Applied a total of 12 rules in 52 ms. Remains 386 /392 variables (removed 6) and now considering 377/380 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 386/392 places, 377/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 180832 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180832 steps, saw 116432 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 377 rows 386 cols
[2023-03-19 00:44:57] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-19 00:44:57] [INFO ] [Real]Absence check using 179 positive place invariants in 35 ms returned sat
[2023-03-19 00:44:57] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:44:58] [INFO ] [Nat]Absence check using 179 positive place invariants in 31 ms returned sat
[2023-03-19 00:44:58] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 00:44:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 00:44:58] [INFO ] After 96ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 00:44:58] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-19 00:44:58] [INFO ] After 768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 6 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 377/377 transitions.
Applied a total of 0 rules in 21 ms. Remains 386 /386 variables (removed 0) and now considering 377/377 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 386/386 places, 377/377 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 377/377 transitions.
Applied a total of 0 rules in 17 ms. Remains 386 /386 variables (removed 0) and now considering 377/377 (removed 0) transitions.
[2023-03-19 00:44:58] [INFO ] Invariant cache hit.
[2023-03-19 00:44:59] [INFO ] Implicit Places using invariants in 504 ms returned [375]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 505 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 385/386 places, 377/377 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 384 transition count 376
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 384 transition count 376
Applied a total of 2 rules in 25 ms. Remains 384 /385 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 384 cols
[2023-03-19 00:44:59] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:44:59] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-19 00:44:59] [INFO ] Invariant cache hit.
[2023-03-19 00:44:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:45:00] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 384/386 places, 376/377 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1430 ms. Remains : 384/386 places, 376/377 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 182826 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182826 steps, saw 117783 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 00:45:03] [INFO ] Invariant cache hit.
[2023-03-19 00:45:03] [INFO ] [Real]Absence check using 178 positive place invariants in 21 ms returned sat
[2023-03-19 00:45:04] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:45:04] [INFO ] [Nat]Absence check using 178 positive place invariants in 47 ms returned sat
[2023-03-19 00:45:04] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 00:45:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:45:04] [INFO ] After 68ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 00:45:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2023-03-19 00:45:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-19 00:45:04] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-19 00:45:04] [INFO ] After 919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 6 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 376/376 transitions.
Applied a total of 0 rules in 14 ms. Remains 384 /384 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 384/384 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 376/376 transitions.
Applied a total of 0 rules in 11 ms. Remains 384 /384 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-19 00:45:05] [INFO ] Invariant cache hit.
[2023-03-19 00:45:05] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-19 00:45:05] [INFO ] Invariant cache hit.
[2023-03-19 00:45:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:45:05] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-19 00:45:05] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-19 00:45:05] [INFO ] Invariant cache hit.
[2023-03-19 00:45:06] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1021 ms. Remains : 384/384 places, 376/376 transitions.
Partial Free-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 384 transition count 376
Applied a total of 38 rules in 18 ms. Remains 384 /384 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 376 rows 384 cols
[2023-03-19 00:45:06] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:45:06] [INFO ] [Real]Absence check using 178 positive place invariants in 29 ms returned sat
[2023-03-19 00:45:06] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:45:06] [INFO ] [Nat]Absence check using 178 positive place invariants in 32 ms returned sat
[2023-03-19 00:45:06] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 00:45:06] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-19 00:45:07] [INFO ] After 188ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 00:45:07] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-19 00:45:07] [INFO ] After 972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA ShieldIIPt-PT-020B-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 319 stabilizing places and 319 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F((p1||G(p2))))))))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1189 transition count 851
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 951 transition count 850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 478 place count 950 transition count 850
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 478 place count 950 transition count 696
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 786 place count 796 transition count 696
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 791 place count 791 transition count 691
Iterating global reduction 3 with 5 rules applied. Total rules applied 796 place count 791 transition count 691
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 796 place count 791 transition count 686
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 806 place count 786 transition count 686
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 1486 place count 446 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1487 place count 446 transition count 345
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1489 place count 445 transition count 344
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1603 place count 388 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1605 place count 386 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1607 place count 384 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1607 place count 384 transition count 377
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1609 place count 383 transition count 377
Applied a total of 1609 rules in 156 ms. Remains 383 /1190 variables (removed 807) and now considering 377/1090 (removed 713) transitions.
// Phase 1: matrix 377 rows 383 cols
[2023-03-19 00:45:08] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-19 00:45:08] [INFO ] Implicit Places using invariants in 258 ms returned [372]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 268 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 382/1190 places, 377/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 381 transition count 376
Applied a total of 2 rules in 37 ms. Remains 381 /382 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 381 cols
[2023-03-19 00:45:08] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:45:08] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-19 00:45:08] [INFO ] Invariant cache hit.
[2023-03-19 00:45:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:45:09] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 381/1190 places, 376/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1291 ms. Remains : 381/1190 places, 376/1090 transitions.
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s269 1), p1:(EQ s292 1), p2:(EQ s60 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-00 finished in 1737 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(X(p0)) U p1)&&F(X((X(p0) U p2))))))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1189 transition count 848
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 948 transition count 848
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 482 place count 948 transition count 693
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 792 place count 793 transition count 693
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 795 place count 790 transition count 690
Iterating global reduction 2 with 3 rules applied. Total rules applied 798 place count 790 transition count 690
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 798 place count 790 transition count 687
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 804 place count 787 transition count 687
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1486 place count 446 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1487 place count 446 transition count 345
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1489 place count 445 transition count 344
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1607 place count 386 transition count 383
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1609 place count 384 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1611 place count 382 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1611 place count 382 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1613 place count 381 transition count 380
Applied a total of 1613 rules in 190 ms. Remains 381 /1190 variables (removed 809) and now considering 380/1090 (removed 710) transitions.
// Phase 1: matrix 380 rows 381 cols
[2023-03-19 00:45:09] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-19 00:45:10] [INFO ] Implicit Places using invariants in 266 ms returned [369]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 267 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1190 places, 380/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 379
Applied a total of 2 rules in 16 ms. Remains 379 /380 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 379 cols
[2023-03-19 00:45:10] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-19 00:45:10] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-19 00:45:10] [INFO ] Invariant cache hit.
[2023-03-19 00:45:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:45:10] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1190 places, 379/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1218 ms. Remains : 379/1190 places, 379/1090 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s374 1), p2:(EQ s262 1), p0:(EQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-01 finished in 1579 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)))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 115 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-19 00:45:11] [INFO ] Computed 181 place invariants in 20 ms
[2023-03-19 00:45:11] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-19 00:45:11] [INFO ] Invariant cache hit.
[2023-03-19 00:45:13] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2162 ms to find 0 implicit places.
[2023-03-19 00:45:13] [INFO ] Invariant cache hit.
[2023-03-19 00:45:14] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2903 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s878 1), p1:(EQ s234 1)], 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 0 reset in 576 ms.
Stack based approach found an accepted trace after 558 steps with 0 reset with depth 559 and stack size 559 in 4 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-02 finished in 3633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 98 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-19 00:45:15] [INFO ] Computed 181 place invariants in 16 ms
[2023-03-19 00:45:15] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-19 00:45:15] [INFO ] Invariant cache hit.
[2023-03-19 00:45:17] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2328 ms to find 0 implicit places.
[2023-03-19 00:45:17] [INFO ] Invariant cache hit.
[2023-03-19 00:45:17] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3046 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-04 finished in 3181 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((X(p1)&&p0))||F(p2)))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 99 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-19 00:45:18] [INFO ] Computed 181 place invariants in 9 ms
[2023-03-19 00:45:18] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-19 00:45:18] [INFO ] Invariant cache hit.
[2023-03-19 00:45:20] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
[2023-03-19 00:45:20] [INFO ] Invariant cache hit.
[2023-03-19 00:45:21] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2929 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s304 1) (EQ s501 1)), p2:(EQ s304 1), p1:(EQ s338 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 308 reset in 376 ms.
Product exploration explored 100000 steps with 316 reset in 395 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1182 stabilizing places and 318/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 461 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (NOT p2)]
Finished random walk after 260 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 8 factoid took 553 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p2)]
[2023-03-19 00:45:23] [INFO ] Invariant cache hit.
[2023-03-19 00:45:23] [INFO ] [Real]Absence check using 181 positive place invariants in 116 ms returned sat
[2023-03-19 00:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:27] [INFO ] [Real]Absence check using state equation in 3825 ms returned sat
[2023-03-19 00:45:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:45:28] [INFO ] [Nat]Absence check using 181 positive place invariants in 121 ms returned sat
[2023-03-19 00:45:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:31] [INFO ] [Nat]Absence check using state equation in 3097 ms returned sat
[2023-03-19 00:45:31] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2023-03-19 00:45:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-19 00:45:31] [INFO ] Computed and/alt/rep : 1081/1622/1081 causal constraints (skipped 0 transitions) in 83 ms.
1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
[2023-03-19 00:45:43] [INFO ] Deduced a trap composed of 16 places in 531 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:45:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 1 out of 1182 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 : 1182/1182 places, 1082/1082 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1181 transition count 844
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 944 transition count 844
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 474 place count 944 transition count 683
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 796 place count 783 transition count 683
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1470 place count 446 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1471 place count 446 transition count 345
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1473 place count 445 transition count 344
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1591 place count 386 transition count 383
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1593 place count 384 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1595 place count 382 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1595 place count 382 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1597 place count 381 transition count 380
Applied a total of 1597 rules in 88 ms. Remains 381 /1182 variables (removed 801) and now considering 380/1082 (removed 702) transitions.
// Phase 1: matrix 380 rows 381 cols
[2023-03-19 00:45:43] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-19 00:45:43] [INFO ] Implicit Places using invariants in 217 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 219 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1182 places, 380/1082 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 379
Applied a total of 2 rules in 9 ms. Remains 379 /380 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 379 cols
[2023-03-19 00:45:43] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-19 00:45:43] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-19 00:45:43] [INFO ] Invariant cache hit.
[2023-03-19 00:45:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:45:44] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1182 places, 379/1082 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1273 ms. Remains : 379/1182 places, 379/1082 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/379 stabilizing places and 2/379 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p2)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 249 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
[2023-03-19 00:45:45] [INFO ] Invariant cache hit.
[2023-03-19 00:45:45] [INFO ] [Real]Absence check using 178 positive place invariants in 51 ms returned sat
[2023-03-19 00:45:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:45] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2023-03-19 00:45:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:45:46] [INFO ] [Nat]Absence check using 178 positive place invariants in 48 ms returned sat
[2023-03-19 00:45:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:45:46] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2023-03-19 00:45:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 00:45:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 8 ms returned sat
[2023-03-19 00:45:46] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-03-19 00:45:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-19 00:45:46] [INFO ] Computed and/alt/rep : 374/579/374 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-19 00:45:49] [INFO ] Added : 287 causal constraints over 58 iterations in 2760 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 56 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-05 finished in 31300 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 U (p1||G(p0))))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 126 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-19 00:45:49] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-19 00:45:49] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-19 00:45:49] [INFO ] Invariant cache hit.
[2023-03-19 00:45:50] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
[2023-03-19 00:45:50] [INFO ] Invariant cache hit.
[2023-03-19 00:45:51] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2229 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s77 1) (NEQ s536 1)), p0:(NEQ s536 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 534 ms.
Product exploration explored 100000 steps with 1 reset in 678 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1182 stabilizing places and 319/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 371 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 222 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 419 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 74 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2023-03-19 00:45:54] [INFO ] Invariant cache hit.
[2023-03-19 00:45:54] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-19 00:45:54] [INFO ] Invariant cache hit.
[2023-03-19 00:45:55] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2023-03-19 00:45:55] [INFO ] Invariant cache hit.
[2023-03-19 00:45:56] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2278 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1182 stabilizing places and 319/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 226 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 375 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 449 ms.
Product exploration explored 100000 steps with 1 reset in 591 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1182 transition count 1082
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 82 Pre rules applied. Total rules applied 237 place count 1182 transition count 1144
Deduced a syphon composed of 319 places in 1 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 319 place count 1182 transition count 1144
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 718 places in 1 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 718 place count 1182 transition count 1144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 719 place count 1182 transition count 1143
Renaming transitions due to excessive name length > 1024 char.
Discarding 158 places :
Symmetric choice reduction at 2 with 158 rule applications. Total rules 877 place count 1024 transition count 985
Deduced a syphon composed of 560 places in 1 ms
Iterating global reduction 2 with 158 rules applied. Total rules applied 1035 place count 1024 transition count 985
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 561 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1036 place count 1024 transition count 985
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1038 place count 1022 transition count 983
Deduced a syphon composed of 559 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1040 place count 1022 transition count 983
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 637 places in 14 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1118 place count 1022 transition count 1398
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1196 place count 944 transition count 1242
Deduced a syphon composed of 559 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1274 place count 944 transition count 1242
Deduced a syphon composed of 559 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1283 place count 944 transition count 1233
Deduced a syphon composed of 559 places in 1 ms
Applied a total of 1283 rules in 700 ms. Remains 944 /1182 variables (removed 238) and now considering 1233/1082 (removed -151) transitions.
[2023-03-19 00:45:59] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 1233 rows 944 cols
[2023-03-19 00:45:59] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-19 00:46:00] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 944/1182 places, 1233/1082 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1334 ms. Remains : 944/1182 places, 1233/1082 transitions.
Built C files in :
/tmp/ltsmin81885949897171540
[2023-03-19 00:46:00] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin81885949897171540
Running compilation step : cd /tmp/ltsmin81885949897171540;'/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 1838 ms.
Running link step : cd /tmp/ltsmin81885949897171540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin81885949897171540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7653049566400133334.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 46 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-19 00:46:15] [INFO ] Computed 181 place invariants in 3 ms
[2023-03-19 00:46:16] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-19 00:46:16] [INFO ] Invariant cache hit.
[2023-03-19 00:46:16] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
[2023-03-19 00:46:16] [INFO ] Invariant cache hit.
[2023-03-19 00:46:17] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2350 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Built C files in :
/tmp/ltsmin12597027296304884035
[2023-03-19 00:46:17] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12597027296304884035
Running compilation step : cd /tmp/ltsmin12597027296304884035;'/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 1874 ms.
Running link step : cd /tmp/ltsmin12597027296304884035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12597027296304884035;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11770835852323169185.hoa' '--buchi-type=spotba'
LTSmin run took 957 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-020B-LTLFireability-06 finished in 31520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1 U p2)))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1181 transition count 1081
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1181 transition count 1081
Applied a total of 18 rules in 98 ms. Remains 1181 /1190 variables (removed 9) and now considering 1081/1090 (removed 9) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-19 00:46:20] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-19 00:46:21] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-19 00:46:21] [INFO ] Invariant cache hit.
[2023-03-19 00:46:22] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
[2023-03-19 00:46:22] [INFO ] Invariant cache hit.
[2023-03-19 00:46:23] [INFO ] Dead Transitions using invariants and state equation in 1254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1190 places, 1081/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2847 ms. Remains : 1181/1190 places, 1081/1090 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(NEQ s251 1), p2:(AND (EQ s1116 1) (NEQ s251 1)), p1:(EQ s1116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1004 ms.
Product exploration explored 100000 steps with 50000 reset in 891 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1181 stabilizing places and 318/1081 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020B-LTLFireability-07 finished in 5158 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((!X(p0) U p1))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1181 transition count 1081
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1181 transition count 1081
Applied a total of 18 rules in 145 ms. Remains 1181 /1190 variables (removed 9) and now considering 1081/1090 (removed 9) transitions.
[2023-03-19 00:46:26] [INFO ] Invariant cache hit.
[2023-03-19 00:46:26] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-19 00:46:26] [INFO ] Invariant cache hit.
[2023-03-19 00:46:28] [INFO ] Implicit Places using invariants and state equation in 1857 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
[2023-03-19 00:46:28] [INFO ] Invariant cache hit.
[2023-03-19 00:46:29] [INFO ] Dead Transitions using invariants and state equation in 1330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1190 places, 1081/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3818 ms. Remains : 1181/1190 places, 1081/1090 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1078 1) (EQ s1102 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]]
Product exploration explored 100000 steps with 156 reset in 413 ms.
Stack based approach found an accepted trace after 1542 steps with 2 reset with depth 518 and stack size 518 in 6 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-08 finished in 4345 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)||X(X(X(X(G(p1))))))))'
Support contains 4 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1181 transition count 1081
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1181 transition count 1081
Applied a total of 18 rules in 79 ms. Remains 1181 /1190 variables (removed 9) and now considering 1081/1090 (removed 9) transitions.
[2023-03-19 00:46:30] [INFO ] Invariant cache hit.
[2023-03-19 00:46:31] [INFO ] Implicit Places using invariants in 693 ms returned []
[2023-03-19 00:46:31] [INFO ] Invariant cache hit.
[2023-03-19 00:46:32] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
[2023-03-19 00:46:32] [INFO ] Invariant cache hit.
[2023-03-19 00:46:32] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1190 places, 1081/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2477 ms. Remains : 1181/1190 places, 1081/1090 transitions.
Stuttering acceptance computed with spot in 400 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}]], initial=1, aps=[p0:(OR (EQ s507 0) (EQ s518 0) (EQ s544 0)), p1:(NEQ s1069 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 978 ms.
Product exploration explored 100000 steps with 50000 reset in 953 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1181 stabilizing places and 318/1081 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020B-LTLFireability-10 finished in 5048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1189 transition count 850
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 950 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 949 transition count 849
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 480 place count 949 transition count 694
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 790 place count 794 transition count 694
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 795 place count 789 transition count 689
Iterating global reduction 3 with 5 rules applied. Total rules applied 800 place count 789 transition count 689
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 800 place count 789 transition count 684
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 810 place count 784 transition count 684
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 1488 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1489 place count 445 transition count 344
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1491 place count 444 transition count 343
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1607 place count 386 transition count 381
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1609 place count 384 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1611 place count 382 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1611 place count 382 transition count 378
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1613 place count 381 transition count 378
Applied a total of 1613 rules in 147 ms. Remains 381 /1190 variables (removed 809) and now considering 378/1090 (removed 712) transitions.
// Phase 1: matrix 378 rows 381 cols
[2023-03-19 00:46:35] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-19 00:46:35] [INFO ] Implicit Places using invariants in 245 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 248 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1190 places, 378/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 377
Applied a total of 2 rules in 9 ms. Remains 379 /380 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 379 cols
[2023-03-19 00:46:35] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:46:36] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-19 00:46:36] [INFO ] Invariant cache hit.
[2023-03-19 00:46:36] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1190 places, 377/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1177 ms. Remains : 379/1190 places, 377/1090 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s271 1), p1:(EQ s210 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-11 finished in 1360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(!p0)))))'
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 108 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-19 00:46:36] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-19 00:46:37] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-19 00:46:37] [INFO ] Invariant cache hit.
[2023-03-19 00:46:38] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1570 ms to find 0 implicit places.
[2023-03-19 00:46:38] [INFO ] Invariant cache hit.
[2023-03-19 00:46:39] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2420 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 130 ms :[p0, p0, true, p0]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s165 1)], 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]]
Product exploration explored 100000 steps with 0 reset in 462 ms.
Product exploration explored 100000 steps with 0 reset in 590 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 255 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 285413 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 285413 steps, saw 145446 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:46:43] [INFO ] Invariant cache hit.
[2023-03-19 00:46:44] [INFO ] [Real]Absence check using 181 positive place invariants in 75 ms returned sat
[2023-03-19 00:46:44] [INFO ] After 605ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:46:45] [INFO ] Deduced a trap composed of 16 places in 440 ms of which 1 ms to minimize.
[2023-03-19 00:46:45] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 0 ms to minimize.
[2023-03-19 00:46:45] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 3 ms to minimize.
[2023-03-19 00:46:46] [INFO ] Deduced a trap composed of 20 places in 216 ms of which 1 ms to minimize.
[2023-03-19 00:46:46] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 0 ms to minimize.
[2023-03-19 00:46:46] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 0 ms to minimize.
[2023-03-19 00:46:47] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 0 ms to minimize.
[2023-03-19 00:46:47] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 0 ms to minimize.
[2023-03-19 00:46:47] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 1 ms to minimize.
[2023-03-19 00:46:47] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 0 ms to minimize.
[2023-03-19 00:46:48] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 1 ms to minimize.
[2023-03-19 00:46:48] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 1 ms to minimize.
[2023-03-19 00:46:48] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 9 ms to minimize.
[2023-03-19 00:46:48] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2023-03-19 00:46:48] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2023-03-19 00:46:49] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 1 ms to minimize.
[2023-03-19 00:46:49] [INFO ] Deduced a trap composed of 31 places in 298 ms of which 1 ms to minimize.
[2023-03-19 00:46:49] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 0 ms to minimize.
[2023-03-19 00:46:49] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 0 ms to minimize.
[2023-03-19 00:46:50] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2023-03-19 00:46:50] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 1 ms to minimize.
[2023-03-19 00:46:50] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 14 ms to minimize.
[2023-03-19 00:46:50] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 4 ms to minimize.
[2023-03-19 00:46:50] [INFO ] Deduced a trap composed of 35 places in 177 ms of which 1 ms to minimize.
[2023-03-19 00:46:51] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6069 ms
[2023-03-19 00:46:51] [INFO ] After 6749ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:46:51] [INFO ] After 7183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:46:51] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned sat
[2023-03-19 00:46:52] [INFO ] After 746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:46:52] [INFO ] Deduced a trap composed of 16 places in 345 ms of which 2 ms to minimize.
[2023-03-19 00:46:52] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 1 ms to minimize.
[2023-03-19 00:46:52] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 1 ms to minimize.
[2023-03-19 00:46:53] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 0 ms to minimize.
[2023-03-19 00:46:53] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 1 ms to minimize.
[2023-03-19 00:46:53] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 0 ms to minimize.
[2023-03-19 00:46:54] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 1 ms to minimize.
[2023-03-19 00:46:54] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 0 ms to minimize.
[2023-03-19 00:46:54] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 1 ms to minimize.
[2023-03-19 00:46:54] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 1 ms to minimize.
[2023-03-19 00:46:54] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 1 ms to minimize.
[2023-03-19 00:46:55] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 1 ms to minimize.
[2023-03-19 00:46:55] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 1 ms to minimize.
[2023-03-19 00:46:55] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 0 ms to minimize.
[2023-03-19 00:46:55] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 1 ms to minimize.
[2023-03-19 00:46:56] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 1 ms to minimize.
[2023-03-19 00:46:56] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 1 ms to minimize.
[2023-03-19 00:46:56] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 1 ms to minimize.
[2023-03-19 00:46:56] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 0 ms to minimize.
[2023-03-19 00:46:57] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 1 ms to minimize.
[2023-03-19 00:46:57] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 0 ms to minimize.
[2023-03-19 00:46:57] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 0 ms to minimize.
[2023-03-19 00:46:57] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2023-03-19 00:46:57] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 0 ms to minimize.
[2023-03-19 00:46:58] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2023-03-19 00:46:58] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 1 ms to minimize.
[2023-03-19 00:46:58] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6303 ms
[2023-03-19 00:46:58] [INFO ] After 7128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-19 00:46:58] [INFO ] After 7410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1182 transition count 843
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 943 transition count 843
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 478 place count 943 transition count 683
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 798 place count 783 transition count 683
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1480 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1481 place count 442 transition count 341
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1483 place count 441 transition count 340
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1599 place count 383 transition count 378
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 383 transition count 377
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1601 place count 383 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1602 place count 382 transition count 376
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1622 place count 382 transition count 376
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1623 place count 381 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1625 place count 379 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1625 place count 379 transition count 374
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1627 place count 378 transition count 374
Applied a total of 1627 rules in 88 ms. Remains 378 /1182 variables (removed 804) and now considering 374/1082 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 378/1182 places, 374/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 504278 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 504278 steps, saw 323624 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 378 cols
[2023-03-19 00:47:01] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-19 00:47:01] [INFO ] [Real]Absence check using 179 positive place invariants in 37 ms returned sat
[2023-03-19 00:47:02] [INFO ] After 212ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:47:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:47:02] [INFO ] After 39ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:02] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:02] [INFO ] [Nat]Absence check using 179 positive place invariants in 47 ms returned sat
[2023-03-19 00:47:02] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:02] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:02] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 00:47:02] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 15 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 378/378 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 11 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2023-03-19 00:47:02] [INFO ] Invariant cache hit.
[2023-03-19 00:47:02] [INFO ] Implicit Places using invariants in 283 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 298 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 374/374 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 373
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 373
Applied a total of 2 rules in 9 ms. Remains 376 /377 variables (removed 1) and now considering 373/374 (removed 1) transitions.
// Phase 1: matrix 373 rows 376 cols
[2023-03-19 00:47:02] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-19 00:47:03] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-19 00:47:03] [INFO ] Invariant cache hit.
[2023-03-19 00:47:03] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 376/378 places, 373/374 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1166 ms. Remains : 376/378 places, 373/374 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 466826 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :{}
Probabilistic random walk after 466826 steps, saw 300324 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:47:06] [INFO ] Invariant cache hit.
[2023-03-19 00:47:07] [INFO ] [Real]Absence check using 178 positive place invariants in 39 ms returned sat
[2023-03-19 00:47:07] [INFO ] After 153ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:47:07] [INFO ] After 179ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-19 00:47:07] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 373/373 transitions.
Applied a total of 0 rules in 12 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 376/376 places, 373/373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 373/373 transitions.
Applied a total of 0 rules in 14 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2023-03-19 00:47:07] [INFO ] Invariant cache hit.
[2023-03-19 00:47:07] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-19 00:47:07] [INFO ] Invariant cache hit.
[2023-03-19 00:47:10] [INFO ] Implicit Places using invariants and state equation in 3197 ms returned []
Implicit Place search using SMT with State Equation took 3466 ms to find 0 implicit places.
[2023-03-19 00:47:10] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 00:47:10] [INFO ] Invariant cache hit.
[2023-03-19 00:47:11] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3847 ms. Remains : 376/376 places, 373/373 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 376 transition count 373
Applied a total of 39 rules in 9 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 376 cols
[2023-03-19 00:47:11] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-19 00:47:11] [INFO ] [Real]Absence check using 178 positive place invariants in 30 ms returned sat
[2023-03-19 00:47:11] [INFO ] After 162ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:47:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 00:47:11] [INFO ] After 51ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:11] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:11] [INFO ] [Nat]Absence check using 178 positive place invariants in 76 ms returned sat
[2023-03-19 00:47:11] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:11] [INFO ] After 29ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:11] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 00:47:11] [INFO ] After 436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 71 ms :[true, p0, p0]
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 77 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-19 00:47:12] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-19 00:47:12] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-19 00:47:12] [INFO ] Invariant cache hit.
[2023-03-19 00:47:13] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
[2023-03-19 00:47:13] [INFO ] Invariant cache hit.
[2023-03-19 00:47:14] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2415 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 280285 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280285 steps, saw 143053 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:47:17] [INFO ] Invariant cache hit.
[2023-03-19 00:47:18] [INFO ] [Real]Absence check using 181 positive place invariants in 274 ms returned sat
[2023-03-19 00:47:19] [INFO ] After 716ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:47:19] [INFO ] Deduced a trap composed of 16 places in 456 ms of which 0 ms to minimize.
[2023-03-19 00:47:19] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 1 ms to minimize.
[2023-03-19 00:47:20] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 1 ms to minimize.
[2023-03-19 00:47:20] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 0 ms to minimize.
[2023-03-19 00:47:20] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 0 ms to minimize.
[2023-03-19 00:47:20] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 1 ms to minimize.
[2023-03-19 00:47:21] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 0 ms to minimize.
[2023-03-19 00:47:21] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 1 ms to minimize.
[2023-03-19 00:47:21] [INFO ] Deduced a trap composed of 21 places in 249 ms of which 0 ms to minimize.
[2023-03-19 00:47:22] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 0 ms to minimize.
[2023-03-19 00:47:22] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 1 ms to minimize.
[2023-03-19 00:47:22] [INFO ] Deduced a trap composed of 32 places in 224 ms of which 0 ms to minimize.
[2023-03-19 00:47:22] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 0 ms to minimize.
[2023-03-19 00:47:22] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 0 ms to minimize.
[2023-03-19 00:47:23] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 0 ms to minimize.
[2023-03-19 00:47:23] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 1 ms to minimize.
[2023-03-19 00:47:23] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 1 ms to minimize.
[2023-03-19 00:47:23] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 1 ms to minimize.
[2023-03-19 00:47:24] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 0 ms to minimize.
[2023-03-19 00:47:24] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2023-03-19 00:47:24] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2023-03-19 00:47:24] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 1 ms to minimize.
[2023-03-19 00:47:25] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 0 ms to minimize.
[2023-03-19 00:47:25] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2023-03-19 00:47:25] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6102 ms
[2023-03-19 00:47:25] [INFO ] After 6866ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:25] [INFO ] After 7366ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:25] [INFO ] [Nat]Absence check using 181 positive place invariants in 106 ms returned sat
[2023-03-19 00:47:26] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:26] [INFO ] Deduced a trap composed of 16 places in 355 ms of which 5 ms to minimize.
[2023-03-19 00:47:27] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 0 ms to minimize.
[2023-03-19 00:47:27] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 1 ms to minimize.
[2023-03-19 00:47:27] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 4 ms to minimize.
[2023-03-19 00:47:27] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 0 ms to minimize.
[2023-03-19 00:47:28] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 1 ms to minimize.
[2023-03-19 00:47:28] [INFO ] Deduced a trap composed of 34 places in 355 ms of which 0 ms to minimize.
[2023-03-19 00:47:28] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 0 ms to minimize.
[2023-03-19 00:47:28] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 1 ms to minimize.
[2023-03-19 00:47:29] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 1 ms to minimize.
[2023-03-19 00:47:29] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 0 ms to minimize.
[2023-03-19 00:47:29] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2023-03-19 00:47:29] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 1 ms to minimize.
[2023-03-19 00:47:30] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 0 ms to minimize.
[2023-03-19 00:47:30] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 0 ms to minimize.
[2023-03-19 00:47:30] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2023-03-19 00:47:30] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2023-03-19 00:47:30] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 0 ms to minimize.
[2023-03-19 00:47:31] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 1 ms to minimize.
[2023-03-19 00:47:31] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 14 ms to minimize.
[2023-03-19 00:47:31] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 0 ms to minimize.
[2023-03-19 00:47:31] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 0 ms to minimize.
[2023-03-19 00:47:31] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2023-03-19 00:47:32] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2023-03-19 00:47:32] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 0 ms to minimize.
[2023-03-19 00:47:32] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2023-03-19 00:47:32] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6124 ms
[2023-03-19 00:47:32] [INFO ] After 6798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-19 00:47:32] [INFO ] After 7203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1182 transition count 843
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 943 transition count 843
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 478 place count 943 transition count 683
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 798 place count 783 transition count 683
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1480 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1481 place count 442 transition count 341
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1483 place count 441 transition count 340
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1599 place count 383 transition count 378
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 383 transition count 377
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1601 place count 383 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1602 place count 382 transition count 376
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1622 place count 382 transition count 376
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1623 place count 381 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1625 place count 379 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1625 place count 379 transition count 374
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1627 place count 378 transition count 374
Applied a total of 1627 rules in 78 ms. Remains 378 /1182 variables (removed 804) and now considering 374/1082 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 378/1182 places, 374/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 553399 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 553399 steps, saw 355314 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 378 cols
[2023-03-19 00:47:35] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-19 00:47:35] [INFO ] [Real]Absence check using 179 positive place invariants in 24 ms returned sat
[2023-03-19 00:47:36] [INFO ] After 241ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:47:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 00:47:36] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:36] [INFO ] After 423ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:36] [INFO ] [Nat]Absence check using 179 positive place invariants in 90 ms returned sat
[2023-03-19 00:47:36] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:36] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:36] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-19 00:47:36] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 7 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 378/378 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 6 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2023-03-19 00:47:36] [INFO ] Invariant cache hit.
[2023-03-19 00:47:36] [INFO ] Implicit Places using invariants in 240 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 241 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 374/374 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 373
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 373
Applied a total of 2 rules in 7 ms. Remains 376 /377 variables (removed 1) and now considering 373/374 (removed 1) transitions.
// Phase 1: matrix 373 rows 376 cols
[2023-03-19 00:47:36] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-19 00:47:37] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-19 00:47:37] [INFO ] Invariant cache hit.
[2023-03-19 00:47:37] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 376/378 places, 373/374 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 991 ms. Remains : 376/378 places, 373/374 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 547566 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 547566 steps, saw 352760 distinct states, run finished after 3002 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:47:40] [INFO ] Invariant cache hit.
[2023-03-19 00:47:40] [INFO ] [Real]Absence check using 178 positive place invariants in 61 ms returned sat
[2023-03-19 00:47:40] [INFO ] After 151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:47:40] [INFO ] After 172ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 00:47:40] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 373/373 transitions.
Applied a total of 0 rules in 6 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 376/376 places, 373/373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 373/373 transitions.
Applied a total of 0 rules in 5 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2023-03-19 00:47:40] [INFO ] Invariant cache hit.
[2023-03-19 00:47:41] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-19 00:47:41] [INFO ] Invariant cache hit.
[2023-03-19 00:47:41] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2023-03-19 00:47:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 00:47:41] [INFO ] Invariant cache hit.
[2023-03-19 00:47:41] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 855 ms. Remains : 376/376 places, 373/373 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 376 transition count 373
Applied a total of 39 rules in 8 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 376 cols
[2023-03-19 00:47:41] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:47:41] [INFO ] [Real]Absence check using 178 positive place invariants in 30 ms returned sat
[2023-03-19 00:47:42] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:47:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-19 00:47:42] [INFO ] After 19ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:42] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:47:42] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2023-03-19 00:47:42] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:42] [INFO ] After 25ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 00:47:42] [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 12 ms.
[2023-03-19 00:47:42] [INFO ] After 262ms 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)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 128 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 116 ms :[true, p0, p0]
Product exploration explored 100000 steps with 0 reset in 494 ms.
Product exploration explored 100000 steps with 0 reset in 529 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 105 ms :[true, p0, p0]
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1182 transition count 1082
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 239 place count 1182 transition count 1144
Deduced a syphon composed of 320 places in 2 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 320 place count 1182 transition count 1144
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 720 places in 0 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 720 place count 1182 transition count 1144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 721 place count 1182 transition count 1143
Renaming transitions due to excessive name length > 1024 char.
Discarding 160 places :
Symmetric choice reduction at 2 with 160 rule applications. Total rules 881 place count 1022 transition count 983
Deduced a syphon composed of 560 places in 1 ms
Iterating global reduction 2 with 160 rules applied. Total rules applied 1041 place count 1022 transition count 983
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 561 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1042 place count 1022 transition count 983
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1044 place count 1020 transition count 981
Deduced a syphon composed of 559 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1046 place count 1020 transition count 981
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -418
Deduced a syphon composed of 637 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1124 place count 1020 transition count 1399
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1202 place count 942 transition count 1243
Deduced a syphon composed of 559 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1280 place count 942 transition count 1243
Deduced a syphon composed of 559 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1289 place count 942 transition count 1234
Deduced a syphon composed of 559 places in 1 ms
Applied a total of 1289 rules in 342 ms. Remains 942 /1182 variables (removed 240) and now considering 1234/1082 (removed -152) transitions.
[2023-03-19 00:47:44] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1234 rows 942 cols
[2023-03-19 00:47:44] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-19 00:47:45] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 942/1182 places, 1234/1082 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1102 ms. Remains : 942/1182 places, 1234/1082 transitions.
Built C files in :
/tmp/ltsmin13509835523555418703
[2023-03-19 00:47:45] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13509835523555418703
Running compilation step : cd /tmp/ltsmin13509835523555418703;'/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 1902 ms.
Running link step : cd /tmp/ltsmin13509835523555418703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13509835523555418703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6937254292219007204.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 40 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-19 00:48:00] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-19 00:48:00] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-19 00:48:00] [INFO ] Invariant cache hit.
[2023-03-19 00:48:01] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
[2023-03-19 00:48:01] [INFO ] Invariant cache hit.
[2023-03-19 00:48:02] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2137 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Built C files in :
/tmp/ltsmin11702872797691725017
[2023-03-19 00:48:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11702872797691725017
Running compilation step : cd /tmp/ltsmin11702872797691725017;'/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 1891 ms.
Running link step : cd /tmp/ltsmin11702872797691725017;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11702872797691725017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4970768259234935707.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 00:48:17] [INFO ] Flatten gal took : 39 ms
[2023-03-19 00:48:17] [INFO ] Flatten gal took : 38 ms
[2023-03-19 00:48:17] [INFO ] Time to serialize gal into /tmp/LTL14170335604907574486.gal : 8 ms
[2023-03-19 00:48:17] [INFO ] Time to serialize properties into /tmp/LTL12382343947344358341.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/LTL14170335604907574486.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10521292655132701964.hoa' '-atoms' '/tmp/LTL12382343947344358341.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12382343947344358341.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10521292655132701964.hoa
Detected timeout of ITS tools.
[2023-03-19 00:48:32] [INFO ] Flatten gal took : 37 ms
[2023-03-19 00:48:32] [INFO ] Flatten gal took : 34 ms
[2023-03-19 00:48:32] [INFO ] Time to serialize gal into /tmp/LTL3549063175960265408.gal : 6 ms
[2023-03-19 00:48:32] [INFO ] Time to serialize properties into /tmp/LTL3961546845841295082.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3549063175960265408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3961546845841295082.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 : !((X(("(p187==1)")U(X(G("(p187!=1)"))))))
Formula 0 simplified : X(!"(p187==1)" R XF!"(p187!=1)")
Detected timeout of ITS tools.
[2023-03-19 00:48:48] [INFO ] Flatten gal took : 71 ms
[2023-03-19 00:48:48] [INFO ] Applying decomposition
[2023-03-19 00:48:48] [INFO ] Flatten gal took : 36 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/graph14631182064080373191.txt' '-o' '/tmp/graph14631182064080373191.bin' '-w' '/tmp/graph14631182064080373191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14631182064080373191.bin' '-l' '-1' '-v' '-w' '/tmp/graph14631182064080373191.weights' '-q' '0' '-e' '0.001'
[2023-03-19 00:48:48] [INFO ] Decomposing Gal with order
[2023-03-19 00:48:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 00:48:48] [INFO ] Removed a total of 202 redundant transitions.
[2023-03-19 00:48:48] [INFO ] Flatten gal took : 105 ms
[2023-03-19 00:48:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2023-03-19 00:48:48] [INFO ] Time to serialize gal into /tmp/LTL4846164315382572959.gal : 16 ms
[2023-03-19 00:48:48] [INFO ] Time to serialize properties into /tmp/LTL5651775021922063988.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/LTL4846164315382572959.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5651775021922063988.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(("(i3.i1.i2.u64.p187==1)")U(X(G("(i3.i1.i2.u64.p187!=1)"))))))
Formula 0 simplified : X(!"(i3.i1.i2.u64.p187==1)" R XF!"(i3.i1.i2.u64.p187!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9712765447851550854
[2023-03-19 00:49:03] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9712765447851550854
Running compilation step : cd /tmp/ltsmin9712765447851550854;'/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 1878 ms.
Running link step : cd /tmp/ltsmin9712765447851550854;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9712765447851550854;'/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 X([](!(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-020B-LTLFireability-12 finished in 162117 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&&G(p1)))&&X(X(F(p2))))))'
Support contains 5 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 98 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-19 00:49:19] [INFO ] Computed 181 place invariants in 9 ms
[2023-03-19 00:49:19] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-19 00:49:19] [INFO ] Invariant cache hit.
[2023-03-19 00:49:20] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2023-03-19 00:49:20] [INFO ] Invariant cache hit.
[2023-03-19 00:49:21] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2528 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s972 0) (EQ s983 0) (EQ s1009 0)), p1:(EQ s298 0), p2:(EQ s1179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 512 ms.
Stack based approach found an accepted trace after 22243 steps with 0 reset with depth 22244 and stack size 21634 in 127 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-14 finished in 3605 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 U p1))))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1189 transition count 850
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 950 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 949 transition count 849
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 480 place count 949 transition count 695
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 788 place count 795 transition count 695
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 793 place count 790 transition count 690
Iterating global reduction 3 with 5 rules applied. Total rules applied 798 place count 790 transition count 690
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 798 place count 790 transition count 685
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 808 place count 785 transition count 685
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 0 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 3 with 684 rules applied. Total rules applied 1492 place count 443 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1493 place count 443 transition count 342
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1495 place count 442 transition count 341
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1611 place count 384 transition count 378
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1613 place count 382 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1615 place count 380 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1615 place count 380 transition count 375
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1617 place count 379 transition count 375
Applied a total of 1617 rules in 126 ms. Remains 379 /1190 variables (removed 811) and now considering 375/1090 (removed 715) transitions.
// Phase 1: matrix 375 rows 379 cols
[2023-03-19 00:49:22] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-19 00:49:22] [INFO ] Implicit Places using invariants in 261 ms returned [368]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 275 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/1190 places, 375/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 377 transition count 374
Applied a total of 2 rules in 9 ms. Remains 377 /378 variables (removed 1) and now considering 374/375 (removed 1) transitions.
// Phase 1: matrix 374 rows 377 cols
[2023-03-19 00:49:22] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:49:23] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-19 00:49:23] [INFO ] Invariant cache hit.
[2023-03-19 00:49:23] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/1190 places, 374/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 931 ms. Remains : 377/1190 places, 374/1090 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s179 1) (EQ s181 1)), p0:(EQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-15 finished in 1073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(!p0)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-020B-LTLFireability-12
Stuttering acceptance computed with spot in 228 ms :[p0, p0, true, p0]
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1189 transition count 849
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 949 transition count 849
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 480 place count 949 transition count 694
Deduced a syphon composed of 155 places in 2 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 790 place count 794 transition count 694
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 795 place count 789 transition count 689
Iterating global reduction 2 with 5 rules applied. Total rules applied 800 place count 789 transition count 689
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 800 place count 789 transition count 684
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 810 place count 784 transition count 684
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1492 place count 443 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1493 place count 443 transition count 342
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1495 place count 442 transition count 341
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1611 place count 384 transition count 379
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1613 place count 382 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1615 place count 380 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1615 place count 380 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1617 place count 379 transition count 376
Applied a total of 1617 rules in 139 ms. Remains 379 /1190 variables (removed 811) and now considering 376/1090 (removed 714) transitions.
// Phase 1: matrix 376 rows 379 cols
[2023-03-19 00:49:24] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-19 00:49:24] [INFO ] Implicit Places using invariants in 328 ms returned [368]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 329 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 378/1190 places, 376/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 377 transition count 375
Applied a total of 2 rules in 11 ms. Remains 377 /378 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 377 cols
[2023-03-19 00:49:24] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-19 00:49:24] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-19 00:49:24] [INFO ] Invariant cache hit.
[2023-03-19 00:49:25] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 377/1190 places, 375/1090 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1150 ms. Remains : 377/1190 places, 375/1090 transitions.
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 486 ms.
Entered a terminal (fully accepting) state of product in 30963 steps with 0 reset in 166 ms.
Treatment of property ShieldIIPt-PT-020B-LTLFireability-12 finished in 2174 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-12 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-19 00:49:25] [INFO ] Flatten gal took : 28 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 298139 ms.

BK_STOP 1679186966024

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ShieldIIPt-PT-020B"
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 ShieldIIPt-PT-020B, 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 r389-oct2-167903713400284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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