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.r393-oct2-167903717300691.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 ltsminxred
Input is ShieldPPPt-PT-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300691
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 9.4K Feb 25 21:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 21:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 21:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:13 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.6K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 21:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 21:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 21:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 685K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679471084624

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:44:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 07:44:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:44:47] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2023-03-22 07:44:47] [INFO ] Transformed 2503 places.
[2023-03-22 07:44:47] [INFO ] Transformed 1803 transitions.
[2023-03-22 07:44:47] [INFO ] Found NUPN structural information;
[2023-03-22 07:44:47] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 219 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-22 07:44:48] [INFO ] Computed 1101 place invariants in 19 ms
[2023-03-22 07:44:50] [INFO ] Implicit Places using invariants in 1910 ms returned []
[2023-03-22 07:44:50] [INFO ] Invariant cache hit.
[2023-03-22 07:44:52] [INFO ] Implicit Places using invariants and state equation in 2450 ms returned []
Implicit Place search using SMT with State Equation took 4406 ms to find 0 implicit places.
[2023-03-22 07:44:52] [INFO ] Invariant cache hit.
[2023-03-22 07:44:54] [INFO ] Dead Transitions using invariants and state equation in 2017 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6650 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Support contains 28 out of 2503 places after structural reductions.
[2023-03-22 07:44:55] [INFO ] Flatten gal took : 344 ms
[2023-03-22 07:44:55] [INFO ] Flatten gal took : 181 ms
[2023-03-22 07:44:55] [INFO ] Input system was already deterministic with 1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-22 07:44:58] [INFO ] Invariant cache hit.
[2023-03-22 07:45:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 522 ms returned sat
[2023-03-22 07:45:04] [INFO ] After 5643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 07:45:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 408 ms returned sat
[2023-03-22 07:45:08] [INFO ] After 2009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-22 07:45:09] [INFO ] After 3537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1215 ms.
[2023-03-22 07:45:11] [INFO ] After 6660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1248 ms.
Support contains 24 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 391 times.
Drop transitions removed 391 transitions
Iterating global reduction 0 with 391 rules applied. Total rules applied 395 place count 2501 transition count 1800
Applied a total of 395 rules in 644 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 93459 steps, run timeout after 6002 ms. (steps per millisecond=15 ) properties seen :{8=1}
Probabilistic random walk after 93459 steps, saw 89518 distinct states, run finished after 6004 ms. (steps per millisecond=15 ) properties seen :1
Running SMT prover for 11 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-22 07:45:21] [INFO ] Computed 1101 place invariants in 20 ms
[2023-03-22 07:45:22] [INFO ] [Real]Absence check using 1101 positive place invariants in 303 ms returned sat
[2023-03-22 07:45:26] [INFO ] After 4617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 07:45:27] [INFO ] [Nat]Absence check using 1101 positive place invariants in 312 ms returned sat
[2023-03-22 07:45:29] [INFO ] After 1841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 07:45:29] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:45:31] [INFO ] After 1482ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 07:45:31] [INFO ] Deduced a trap composed of 7 places in 574 ms of which 2 ms to minimize.
[2023-03-22 07:45:32] [INFO ] Deduced a trap composed of 7 places in 458 ms of which 14 ms to minimize.
[2023-03-22 07:45:33] [INFO ] Deduced a trap composed of 6 places in 527 ms of which 1 ms to minimize.
[2023-03-22 07:45:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1936 ms
[2023-03-22 07:45:34] [INFO ] Deduced a trap composed of 6 places in 629 ms of which 2 ms to minimize.
[2023-03-22 07:45:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 792 ms
[2023-03-22 07:45:35] [INFO ] After 5749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1101 ms.
[2023-03-22 07:45:36] [INFO ] After 10365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 531 ms.
Support contains 22 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2501 transition count 1800
Applied a total of 1 rules in 197 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 105834 steps, run timeout after 6002 ms. (steps per millisecond=17 ) properties seen :{}
Probabilistic random walk after 105834 steps, saw 101545 distinct states, run finished after 6003 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-22 07:45:46] [INFO ] Computed 1101 place invariants in 9 ms
[2023-03-22 07:45:47] [INFO ] [Real]Absence check using 1101 positive place invariants in 397 ms returned sat
[2023-03-22 07:45:50] [INFO ] After 4823ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 07:45:52] [INFO ] [Nat]Absence check using 1101 positive place invariants in 366 ms returned sat
[2023-03-22 07:45:55] [INFO ] After 2558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 07:45:55] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:45:57] [INFO ] After 1708ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 07:45:58] [INFO ] Deduced a trap composed of 7 places in 374 ms of which 3 ms to minimize.
[2023-03-22 07:45:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 565 ms
[2023-03-22 07:45:59] [INFO ] After 4532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1250 ms.
[2023-03-22 07:46:01] [INFO ] After 10292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 422 ms.
Support contains 22 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 121 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 105 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-22 07:46:01] [INFO ] Invariant cache hit.
[2023-03-22 07:46:03] [INFO ] Implicit Places using invariants in 1717 ms returned []
[2023-03-22 07:46:03] [INFO ] Invariant cache hit.
[2023-03-22 07:46:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:46:15] [INFO ] Implicit Places using invariants and state equation in 11775 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13529 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 197 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-22 07:46:15] [INFO ] Computed 1100 place invariants in 5 ms
[2023-03-22 07:46:18] [INFO ] Implicit Places using invariants in 2427 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2429 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 352 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-22 07:46:18] [INFO ] Computed 1098 place invariants in 16 ms
[2023-03-22 07:46:20] [INFO ] Implicit Places using invariants in 2246 ms returned []
[2023-03-22 07:46:20] [INFO ] Invariant cache hit.
[2023-03-22 07:46:22] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 3769 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 20381 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 123205 steps, run timeout after 6001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 123205 steps, saw 117809 distinct states, run finished after 6002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-22 07:46:30] [INFO ] Invariant cache hit.
[2023-03-22 07:46:31] [INFO ] [Real]Absence check using 1098 positive place invariants in 363 ms returned sat
[2023-03-22 07:46:35] [INFO ] After 4903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 07:46:36] [INFO ] [Nat]Absence check using 1098 positive place invariants in 382 ms returned sat
[2023-03-22 07:46:42] [INFO ] After 5685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 07:46:42] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-22 07:46:45] [INFO ] After 2958ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 07:46:48] [INFO ] After 5542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1809 ms.
[2023-03-22 07:46:49] [INFO ] After 14705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Finished Parikh walk after 2900 steps, including 2 resets, run visited all 1 properties in 46 ms. (steps per millisecond=63 )
Parikh walk visited 11 properties in 1024 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldPPPt-PT-100A-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 262 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-22 07:46:51] [INFO ] Computed 1101 place invariants in 13 ms
[2023-03-22 07:46:53] [INFO ] Implicit Places using invariants in 2037 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2039 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 1800/1802 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 141 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-22 07:46:53] [INFO ] Computed 1100 place invariants in 5 ms
[2023-03-22 07:46:56] [INFO ] Implicit Places using invariants in 2490 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2508 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/2503 places, 1798/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 343 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-22 07:46:56] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-22 07:46:57] [INFO ] Implicit Places using invariants in 1368 ms returned []
[2023-03-22 07:46:57] [INFO ] Invariant cache hit.
[2023-03-22 07:47:02] [INFO ] Implicit Places using invariants and state equation in 5032 ms returned []
Implicit Place search using SMT with State Equation took 6428 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 2494/2503 places, 1796/1802 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 11721 ms. Remains : 2494/2503 places, 1796/1802 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-00 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2003 0) (EQ s163 1)), p1:(AND (EQ s1628 0) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 1398 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-00 finished in 13636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 85 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-22 07:47:04] [INFO ] Computed 1101 place invariants in 9 ms
[2023-03-22 07:47:07] [INFO ] Implicit Places using invariants in 2184 ms returned []
[2023-03-22 07:47:07] [INFO ] Invariant cache hit.
[2023-03-22 07:47:11] [INFO ] Implicit Places using invariants and state equation in 4607 ms returned []
Implicit Place search using SMT with State Equation took 6803 ms to find 0 implicit places.
[2023-03-22 07:47:11] [INFO ] Invariant cache hit.
[2023-03-22 07:47:12] [INFO ] Dead Transitions using invariants and state equation in 1145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8034 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1318 0) (EQ s290 1)), p0:(OR (EQ s381 0) (EQ s2353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1348 ms.
Product exploration explored 100000 steps with 0 reset in 1785 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 600 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 409 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 75400 steps, run timeout after 3016 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75400 steps, saw 74538 distinct states, run finished after 3016 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 07:47:20] [INFO ] Invariant cache hit.
[2023-03-22 07:47:21] [INFO ] [Real]Absence check using 1101 positive place invariants in 387 ms returned sat
[2023-03-22 07:47:23] [INFO ] After 1435ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-22 07:47:24] [INFO ] After 1935ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:47:24] [INFO ] After 3098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:47:24] [INFO ] [Nat]Absence check using 1101 positive place invariants in 245 ms returned sat
[2023-03-22 07:47:27] [INFO ] After 2174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:47:28] [INFO ] After 3088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 537 ms.
[2023-03-22 07:47:28] [INFO ] After 4556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1848 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 406 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 67525 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67525 steps, saw 64224 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-22 07:47:35] [INFO ] Computed 1101 place invariants in 5 ms
[2023-03-22 07:47:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 220 ms returned sat
[2023-03-22 07:47:37] [INFO ] After 2322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:47:38] [INFO ] [Nat]Absence check using 1101 positive place invariants in 295 ms returned sat
[2023-03-22 07:47:42] [INFO ] After 4328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:47:42] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-22 07:47:46] [INFO ] After 3842ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 07:47:49] [INFO ] After 6903ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12049 ms.
[2023-03-22 07:48:01] [INFO ] After 24352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6730 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 106 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 100 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-22 07:48:08] [INFO ] Invariant cache hit.
[2023-03-22 07:48:11] [INFO ] Implicit Places using invariants in 2559 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2576 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 138 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-22 07:48:11] [INFO ] Computed 1100 place invariants in 4 ms
[2023-03-22 07:48:15] [INFO ] Implicit Places using invariants in 3741 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3744 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 230 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-22 07:48:15] [INFO ] Computed 1098 place invariants in 12 ms
[2023-03-22 07:48:16] [INFO ] Implicit Places using invariants in 1531 ms returned []
[2023-03-22 07:48:16] [INFO ] Invariant cache hit.
[2023-03-22 07:48:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:48:29] [INFO ] Implicit Places using invariants and state equation in 12838 ms returned []
Implicit Place search using SMT with State Equation took 14392 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 21191 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69940 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69940 steps, saw 66566 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 07:48:33] [INFO ] Invariant cache hit.
[2023-03-22 07:48:34] [INFO ] [Real]Absence check using 1098 positive place invariants in 284 ms returned sat
[2023-03-22 07:48:36] [INFO ] After 2699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:48:37] [INFO ] [Nat]Absence check using 1098 positive place invariants in 246 ms returned sat
[2023-03-22 07:48:41] [INFO ] After 3527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:48:41] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:48:44] [INFO ] After 3559ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 07:48:46] [INFO ] After 5020ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1067 ms.
[2023-03-22 07:48:47] [INFO ] After 10624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 3582 steps, including 2 resets, run visited all 2 properties in 91 ms. (steps per millisecond=39 )
Parikh walk visited 4 properties in 901 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 763 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 158 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-22 07:48:49] [INFO ] Computed 1101 place invariants in 8 ms
[2023-03-22 07:48:50] [INFO ] Implicit Places using invariants in 1595 ms returned []
[2023-03-22 07:48:50] [INFO ] Invariant cache hit.
[2023-03-22 07:48:55] [INFO ] Implicit Places using invariants and state equation in 4318 ms returned []
Implicit Place search using SMT with State Equation took 5915 ms to find 0 implicit places.
[2023-03-22 07:48:55] [INFO ] Invariant cache hit.
[2023-03-22 07:48:56] [INFO ] Dead Transitions using invariants and state equation in 1676 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7750 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 744 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 85723 steps, run timeout after 3006 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85723 steps, saw 84814 distinct states, run finished after 3007 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 07:49:01] [INFO ] Invariant cache hit.
[2023-03-22 07:49:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 244 ms returned sat
[2023-03-22 07:49:04] [INFO ] After 1496ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-22 07:49:04] [INFO ] After 2002ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:49:04] [INFO ] After 2861ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:49:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 259 ms returned sat
[2023-03-22 07:49:07] [INFO ] After 2245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:49:08] [INFO ] After 3068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 524 ms.
[2023-03-22 07:49:09] [INFO ] After 4547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1955 ms.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 402 place count 2501 transition count 1800
Applied a total of 402 rules in 288 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 62912 steps, run timeout after 3002 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62912 steps, saw 59742 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-22 07:49:15] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-22 07:49:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 582 ms returned sat
[2023-03-22 07:49:18] [INFO ] After 2950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:49:19] [INFO ] [Nat]Absence check using 1101 positive place invariants in 606 ms returned sat
[2023-03-22 07:49:24] [INFO ] After 4309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:49:24] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-22 07:49:28] [INFO ] After 4022ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 07:49:31] [INFO ] After 7438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11691 ms.
[2023-03-22 07:49:43] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7150 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 93 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 98 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2023-03-22 07:49:50] [INFO ] Invariant cache hit.
[2023-03-22 07:49:52] [INFO ] Implicit Places using invariants in 1781 ms returned []
[2023-03-22 07:49:52] [INFO ] Invariant cache hit.
[2023-03-22 07:49:54] [INFO ] State equation strengthened by 102 read => feed constraints.
[2023-03-22 07:50:02] [INFO ] Implicit Places using invariants and state equation in 10515 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12328 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 116 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-22 07:50:03] [INFO ] Computed 1100 place invariants in 4 ms
[2023-03-22 07:50:05] [INFO ] Implicit Places using invariants in 2712 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2718 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 246 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-22 07:50:06] [INFO ] Computed 1098 place invariants in 16 ms
[2023-03-22 07:50:08] [INFO ] Implicit Places using invariants in 2368 ms returned []
[2023-03-22 07:50:08] [INFO ] Invariant cache hit.
[2023-03-22 07:50:09] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:50:14] [INFO ] Implicit Places using invariants and state equation in 5541 ms returned []
Implicit Place search using SMT with State Equation took 7914 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 23421 ms. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 59080 steps, run timeout after 3002 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59080 steps, saw 56024 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 07:50:18] [INFO ] Invariant cache hit.
[2023-03-22 07:50:18] [INFO ] [Real]Absence check using 1098 positive place invariants in 255 ms returned sat
[2023-03-22 07:50:20] [INFO ] After 2425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:50:21] [INFO ] [Nat]Absence check using 1098 positive place invariants in 239 ms returned sat
[2023-03-22 07:50:24] [INFO ] After 3607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:50:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:50:28] [INFO ] After 3988ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 07:50:30] [INFO ] After 5344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1134 ms.
[2023-03-22 07:50:31] [INFO ] After 10951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 2406 steps, including 0 resets, run visited all 2 properties in 63 ms. (steps per millisecond=38 )
Parikh walk visited 4 properties in 784 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 713 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 1607 ms.
Product exploration explored 100000 steps with 0 reset in 1932 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 1802
Deduced a syphon composed of 2 places in 4 ms
Applied a total of 2 rules in 599 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-22 07:50:38] [INFO ] Redundant transitions in 196 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-22 07:50:38] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-22 07:50:39] [INFO ] Dead Transitions using invariants and state equation in 1718 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 1802/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2534 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 129 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-22 07:50:39] [INFO ] Computed 1101 place invariants in 4 ms
[2023-03-22 07:50:42] [INFO ] Implicit Places using invariants in 2555 ms returned []
[2023-03-22 07:50:42] [INFO ] Invariant cache hit.
[2023-03-22 07:50:47] [INFO ] Implicit Places using invariants and state equation in 4914 ms returned []
Implicit Place search using SMT with State Equation took 7496 ms to find 0 implicit places.
[2023-03-22 07:50:47] [INFO ] Invariant cache hit.
[2023-03-22 07:50:49] [INFO ] Dead Transitions using invariants and state equation in 1657 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9294 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-03 finished in 224623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 1800
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2498 transition count 1798
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 2497 transition count 1797
Applied a total of 9 rules in 352 ms. Remains 2497 /2503 variables (removed 6) and now considering 1797/1802 (removed 5) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2023-03-22 07:50:49] [INFO ] Computed 1100 place invariants in 3 ms
[2023-03-22 07:50:51] [INFO ] Implicit Places using invariants in 2056 ms returned [2480, 2484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2061 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2495/2503 places, 1797/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2493 transition count 1795
Applied a total of 4 rules in 199 ms. Remains 2493 /2495 variables (removed 2) and now considering 1795/1797 (removed 2) transitions.
// Phase 1: matrix 1795 rows 2493 cols
[2023-03-22 07:50:52] [INFO ] Computed 1098 place invariants in 7 ms
[2023-03-22 07:50:53] [INFO ] Implicit Places using invariants in 1663 ms returned []
[2023-03-22 07:50:53] [INFO ] Invariant cache hit.
[2023-03-22 07:50:59] [INFO ] Implicit Places using invariants and state equation in 5718 ms returned []
Implicit Place search using SMT with State Equation took 7384 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2493/2503 places, 1795/1802 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9996 ms. Remains : 2493/2503 places, 1795/1802 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1686 0) (NEQ s1257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1347 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-05 finished in 11431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 106 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2023-03-22 07:51:01] [INFO ] Computed 1101 place invariants in 5 ms
[2023-03-22 07:51:02] [INFO ] Implicit Places using invariants in 1560 ms returned []
[2023-03-22 07:51:02] [INFO ] Invariant cache hit.
[2023-03-22 07:51:07] [INFO ] Implicit Places using invariants and state equation in 5179 ms returned []
Implicit Place search using SMT with State Equation took 6744 ms to find 0 implicit places.
[2023-03-22 07:51:07] [INFO ] Invariant cache hit.
[2023-03-22 07:51:09] [INFO ] Dead Transitions using invariants and state equation in 2013 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8877 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s2324 0) (NEQ s1528 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 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-07 finished in 9062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((!p1 U (G(!p1)||(!p1&&G(!p2)))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 92 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-22 07:51:10] [INFO ] Invariant cache hit.
[2023-03-22 07:51:11] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2023-03-22 07:51:11] [INFO ] Invariant cache hit.
[2023-03-22 07:51:15] [INFO ] Implicit Places using invariants and state equation in 4556 ms returned []
Implicit Place search using SMT with State Equation took 5965 ms to find 0 implicit places.
[2023-03-22 07:51:15] [INFO ] Invariant cache hit.
[2023-03-22 07:51:18] [INFO ] Dead Transitions using invariants and state equation in 2161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8221 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) p1), (NOT p0), p1, true, (AND p1 p2), p2]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1873 1), p2:(OR (EQ s795 0) (EQ s530 1)), p1:(OR (EQ s172 0) (EQ s338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-08 finished in 8569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 96 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-22 07:51:18] [INFO ] Invariant cache hit.
[2023-03-22 07:51:21] [INFO ] Implicit Places using invariants in 2764 ms returned []
[2023-03-22 07:51:21] [INFO ] Invariant cache hit.
[2023-03-22 07:51:27] [INFO ] Implicit Places using invariants and state equation in 5956 ms returned []
Implicit Place search using SMT with State Equation took 8727 ms to find 0 implicit places.
[2023-03-22 07:51:27] [INFO ] Invariant cache hit.
[2023-03-22 07:51:29] [INFO ] Dead Transitions using invariants and state equation in 1703 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10530 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s917 0) (EQ s1024 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 50000 reset in 6614 ms.
Product exploration explored 100000 steps with 50000 reset in 7004 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100A-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-12 finished in 24473 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)))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 95 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-22 07:51:43] [INFO ] Invariant cache hit.
[2023-03-22 07:51:44] [INFO ] Implicit Places using invariants in 1603 ms returned []
[2023-03-22 07:51:44] [INFO ] Invariant cache hit.
[2023-03-22 07:51:49] [INFO ] Implicit Places using invariants and state equation in 4472 ms returned []
Implicit Place search using SMT with State Equation took 6077 ms to find 0 implicit places.
[2023-03-22 07:51:49] [INFO ] Invariant cache hit.
[2023-03-22 07:51:51] [INFO ] Dead Transitions using invariants and state equation in 1907 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8085 ms. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s858 0) (EQ s1171 1) (EQ s772 1)), p0:(EQ s1496 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6623 ms.
Product exploration explored 100000 steps with 50000 reset in 6800 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100A-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-15 finished in 21832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-100A-LTLCardinality-03
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 230 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2023-03-22 07:52:05] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-22 07:52:06] [INFO ] Implicit Places using invariants in 1684 ms returned []
[2023-03-22 07:52:06] [INFO ] Invariant cache hit.
[2023-03-22 07:52:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 07:52:12] [INFO ] Implicit Places using invariants and state equation in 5065 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6766 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/2503 places, 1800/1802 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 122 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2023-03-22 07:52:12] [INFO ] Computed 1100 place invariants in 9 ms
[2023-03-22 07:52:14] [INFO ] Implicit Places using invariants in 2233 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2235 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 2496/2503 places, 1798/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 194 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-22 07:52:14] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-22 07:52:17] [INFO ] Implicit Places using invariants in 2873 ms returned []
[2023-03-22 07:52:17] [INFO ] Invariant cache hit.
[2023-03-22 07:52:21] [INFO ] Implicit Places using invariants and state equation in 4424 ms returned []
Implicit Place search using SMT with State Equation took 7315 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 2494/2503 places, 1796/1802 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 16865 ms. Remains : 2494/2503 places, 1796/1802 transitions.
Running random walk in product with property : ShieldPPPt-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1318 0) (EQ s290 1)), p0:(OR (EQ s381 0) (EQ s2353 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1448 ms.
Product exploration explored 100000 steps with 0 reset in 1973 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 721 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 76827 steps, run timeout after 3007 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76827 steps, saw 75934 distinct states, run finished after 3007 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 07:52:30] [INFO ] Invariant cache hit.
[2023-03-22 07:52:30] [INFO ] [Real]Absence check using 1098 positive place invariants in 259 ms returned sat
[2023-03-22 07:52:33] [INFO ] After 2271ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-22 07:52:33] [INFO ] After 2675ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:52:33] [INFO ] After 3586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:52:34] [INFO ] [Nat]Absence check using 1098 positive place invariants in 397 ms returned sat
[2023-03-22 07:52:37] [INFO ] After 3041ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:52:38] [INFO ] After 4107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 925 ms.
[2023-03-22 07:52:39] [INFO ] After 6162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1710 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 396 times.
Drop transitions removed 396 transitions
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2494 transition count 1796
Applied a total of 396 rules in 192 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 54019 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 54019 steps, saw 50977 distinct states, run finished after 3002 ms. (steps per millisecond=17 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-22 07:52:46] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-22 07:52:47] [INFO ] [Real]Absence check using 1098 positive place invariants in 557 ms returned sat
[2023-03-22 07:52:49] [INFO ] After 3298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:52:50] [INFO ] [Nat]Absence check using 1098 positive place invariants in 261 ms returned sat
[2023-03-22 07:52:53] [INFO ] After 3040ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:52:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:52:57] [INFO ] After 4216ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 07:52:58] [INFO ] Deduced a trap composed of 7 places in 324 ms of which 1 ms to minimize.
[2023-03-22 07:52:58] [INFO ] Deduced a trap composed of 6 places in 340 ms of which 1 ms to minimize.
[2023-03-22 07:52:59] [INFO ] Deduced a trap composed of 8 places in 386 ms of which 1 ms to minimize.
[2023-03-22 07:52:59] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2023-03-22 07:53:00] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-22 07:53:00] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 12 ms to minimize.
[2023-03-22 07:53:00] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 1 ms to minimize.
[2023-03-22 07:53:01] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 1 ms to minimize.
[2023-03-22 07:53:01] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2023-03-22 07:53:01] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 1 ms to minimize.
[2023-03-22 07:53:02] [INFO ] Deduced a trap composed of 6 places in 366 ms of which 1 ms to minimize.
[2023-03-22 07:53:02] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 0 ms to minimize.
[2023-03-22 07:53:03] [INFO ] Deduced a trap composed of 6 places in 343 ms of which 1 ms to minimize.
[2023-03-22 07:53:03] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 0 ms to minimize.
[2023-03-22 07:53:03] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2023-03-22 07:53:04] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 0 ms to minimize.
[2023-03-22 07:53:04] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2023-03-22 07:53:04] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 1 ms to minimize.
[2023-03-22 07:53:05] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 1 ms to minimize.
[2023-03-22 07:53:05] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2023-03-22 07:53:05] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 1 ms to minimize.
[2023-03-22 07:53:06] [INFO ] Deduced a trap composed of 6 places in 354 ms of which 1 ms to minimize.
[2023-03-22 07:53:06] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-22 07:53:07] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 8 ms to minimize.
[2023-03-22 07:53:07] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2023-03-22 07:53:07] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 0 ms to minimize.
[2023-03-22 07:53:07] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 15 ms to minimize.
[2023-03-22 07:53:08] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 0 ms to minimize.
[2023-03-22 07:53:08] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2023-03-22 07:53:08] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 1 ms to minimize.
[2023-03-22 07:53:09] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 0 ms to minimize.
[2023-03-22 07:53:09] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 1 ms to minimize.
[2023-03-22 07:53:10] [INFO ] Deduced a trap composed of 7 places in 391 ms of which 0 ms to minimize.
[2023-03-22 07:53:11] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 2 ms to minimize.
[2023-03-22 07:53:11] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 1 ms to minimize.
[2023-03-22 07:53:12] [INFO ] Deduced a trap composed of 6 places in 347 ms of which 1 ms to minimize.
[2023-03-22 07:53:12] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-22 07:53:12] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 3 ms to minimize.
[2023-03-22 07:53:13] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 0 ms to minimize.
[2023-03-22 07:53:13] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 23 ms to minimize.
[2023-03-22 07:53:13] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 1 ms to minimize.
[2023-03-22 07:53:14] [INFO ] Deduced a trap composed of 6 places in 920 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-22 07:53:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:53:14] [INFO ] After 25636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 3949 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 87 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 92 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-22 07:53:19] [INFO ] Invariant cache hit.
[2023-03-22 07:53:21] [INFO ] Implicit Places using invariants in 1995 ms returned []
[2023-03-22 07:53:21] [INFO ] Invariant cache hit.
[2023-03-22 07:53:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:53:30] [INFO ] Implicit Places using invariants and state equation in 9085 ms returned []
Implicit Place search using SMT with State Equation took 11091 ms to find 0 implicit places.
[2023-03-22 07:53:30] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-22 07:53:30] [INFO ] Invariant cache hit.
[2023-03-22 07:53:34] [INFO ] Dead Transitions using invariants and state equation in 3835 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15071 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 2494 transition count 1796
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2494 transition count 1697
Applied a total of 198 rules in 356 ms. Remains 2494 /2494 variables (removed 0) and now considering 1697/1796 (removed 99) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1697 rows 2494 cols
[2023-03-22 07:53:34] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-22 07:53:35] [INFO ] [Real]Absence check using 1098 positive place invariants in 262 ms returned sat
[2023-03-22 07:53:36] [INFO ] After 2427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:53:37] [INFO ] [Nat]Absence check using 1098 positive place invariants in 277 ms returned sat
[2023-03-22 07:53:41] [INFO ] After 3441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:53:42] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2023-03-22 07:53:43] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2023-03-22 07:53:43] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 1 ms to minimize.
[2023-03-22 07:53:43] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 1 ms to minimize.
[2023-03-22 07:53:44] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2023-03-22 07:53:44] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 14 ms to minimize.
[2023-03-22 07:53:44] [INFO ] Deduced a trap composed of 6 places in 396 ms of which 15 ms to minimize.
[2023-03-22 07:53:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2246 ms
[2023-03-22 07:53:47] [INFO ] After 9890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1460 ms.
[2023-03-22 07:53:49] [INFO ] After 12334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 598 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 102 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-22 07:53:50] [INFO ] Computed 1098 place invariants in 4 ms
[2023-03-22 07:53:53] [INFO ] Implicit Places using invariants in 2883 ms returned []
[2023-03-22 07:53:53] [INFO ] Invariant cache hit.
[2023-03-22 07:54:00] [INFO ] Implicit Places using invariants and state equation in 7118 ms returned []
Implicit Place search using SMT with State Equation took 10027 ms to find 0 implicit places.
[2023-03-22 07:54:00] [INFO ] Invariant cache hit.
[2023-03-22 07:54:02] [INFO ] Dead Transitions using invariants and state equation in 2053 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12199 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 485 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 61854 steps, run timeout after 3008 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61854 steps, saw 61036 distinct states, run finished after 3009 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 07:54:06] [INFO ] Invariant cache hit.
[2023-03-22 07:54:07] [INFO ] [Real]Absence check using 1098 positive place invariants in 275 ms returned sat
[2023-03-22 07:54:11] [INFO ] After 3260ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-22 07:54:11] [INFO ] After 3742ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:54:11] [INFO ] After 4773ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:54:12] [INFO ] [Nat]Absence check using 1098 positive place invariants in 252 ms returned sat
[2023-03-22 07:54:16] [INFO ] After 3735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:54:17] [INFO ] After 4727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 805 ms.
[2023-03-22 07:54:18] [INFO ] After 6626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2138 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 396 times.
Drop transitions removed 396 transitions
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2494 transition count 1796
Applied a total of 396 rules in 208 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 62264 steps, run timeout after 3009 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62264 steps, saw 58984 distinct states, run finished after 3010 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-22 07:54:24] [INFO ] Computed 1098 place invariants in 3 ms
[2023-03-22 07:54:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 374 ms returned sat
[2023-03-22 07:54:27] [INFO ] After 3061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:54:28] [INFO ] [Nat]Absence check using 1098 positive place invariants in 245 ms returned sat
[2023-03-22 07:54:32] [INFO ] After 3774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:54:32] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:54:36] [INFO ] After 4045ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 07:54:37] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 1 ms to minimize.
[2023-03-22 07:54:39] [INFO ] Deduced a trap composed of 6 places in 1954 ms of which 4 ms to minimize.
[2023-03-22 07:54:39] [INFO ] Deduced a trap composed of 8 places in 304 ms of which 1 ms to minimize.
[2023-03-22 07:54:40] [INFO ] Deduced a trap composed of 6 places in 448 ms of which 1 ms to minimize.
[2023-03-22 07:54:40] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 0 ms to minimize.
[2023-03-22 07:54:41] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2023-03-22 07:54:41] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 1 ms to minimize.
[2023-03-22 07:54:42] [INFO ] Deduced a trap composed of 7 places in 413 ms of which 0 ms to minimize.
[2023-03-22 07:54:42] [INFO ] Deduced a trap composed of 6 places in 330 ms of which 1 ms to minimize.
[2023-03-22 07:54:42] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 2 ms to minimize.
[2023-03-22 07:54:43] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-22 07:54:43] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 2 ms to minimize.
[2023-03-22 07:54:44] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 0 ms to minimize.
[2023-03-22 07:54:44] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2023-03-22 07:54:45] [INFO ] Deduced a trap composed of 6 places in 841 ms of which 1 ms to minimize.
[2023-03-22 07:54:45] [INFO ] Deduced a trap composed of 7 places in 408 ms of which 1 ms to minimize.
[2023-03-22 07:54:46] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 1 ms to minimize.
[2023-03-22 07:54:46] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2023-03-22 07:54:47] [INFO ] Deduced a trap composed of 7 places in 398 ms of which 1 ms to minimize.
[2023-03-22 07:54:47] [INFO ] Deduced a trap composed of 6 places in 335 ms of which 0 ms to minimize.
[2023-03-22 07:54:48] [INFO ] Deduced a trap composed of 8 places in 456 ms of which 1 ms to minimize.
[2023-03-22 07:54:48] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-22 07:54:49] [INFO ] Deduced a trap composed of 6 places in 343 ms of which 0 ms to minimize.
[2023-03-22 07:54:49] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 0 ms to minimize.
[2023-03-22 07:54:49] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 1 ms to minimize.
[2023-03-22 07:54:50] [INFO ] Deduced a trap composed of 7 places in 302 ms of which 1 ms to minimize.
[2023-03-22 07:54:50] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2023-03-22 07:54:50] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 1 ms to minimize.
[2023-03-22 07:54:51] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-22 07:54:51] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 0 ms to minimize.
[2023-03-22 07:54:52] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 7 ms to minimize.
[2023-03-22 07:54:52] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2023-03-22 07:54:52] [INFO ] Trap strengthening (SAT) tested/added 32/32 trap constraints in 15754 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-22 07:54:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:54:52] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 4198 ms.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 92 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 106 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-22 07:54:57] [INFO ] Invariant cache hit.
[2023-03-22 07:55:00] [INFO ] Implicit Places using invariants in 3025 ms returned []
[2023-03-22 07:55:00] [INFO ] Invariant cache hit.
[2023-03-22 07:55:02] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-22 07:55:10] [INFO ] Implicit Places using invariants and state equation in 9925 ms returned []
Implicit Place search using SMT with State Equation took 12960 ms to find 0 implicit places.
[2023-03-22 07:55:10] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-22 07:55:10] [INFO ] Invariant cache hit.
[2023-03-22 07:55:12] [INFO ] Dead Transitions using invariants and state equation in 1834 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15006 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 2494 transition count 1796
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 2494 transition count 1697
Applied a total of 198 rules in 323 ms. Remains 2494 /2494 variables (removed 0) and now considering 1697/1796 (removed 99) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1697 rows 2494 cols
[2023-03-22 07:55:12] [INFO ] Computed 1098 place invariants in 9 ms
[2023-03-22 07:55:13] [INFO ] [Real]Absence check using 1098 positive place invariants in 371 ms returned sat
[2023-03-22 07:55:15] [INFO ] After 3284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 07:55:17] [INFO ] [Nat]Absence check using 1098 positive place invariants in 977 ms returned sat
[2023-03-22 07:55:22] [INFO ] After 5193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 07:55:24] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-22 07:55:24] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-22 07:55:24] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2023-03-22 07:55:25] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 1 ms to minimize.
[2023-03-22 07:55:25] [INFO ] Deduced a trap composed of 6 places in 318 ms of which 1 ms to minimize.
[2023-03-22 07:55:25] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-22 07:55:26] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 1 ms to minimize.
[2023-03-22 07:55:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2316 ms
[2023-03-22 07:55:29] [INFO ] After 11773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1734 ms.
[2023-03-22 07:55:31] [INFO ] After 15297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 487 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 1503 ms.
Product exploration explored 100000 steps with 0 reset in 1881 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), true]
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 113 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-22 07:55:35] [INFO ] Redundant transitions in 92 ms returned []
// Phase 1: matrix 1796 rows 2494 cols
[2023-03-22 07:55:35] [INFO ] Computed 1098 place invariants in 5 ms
[2023-03-22 07:55:39] [INFO ] Dead Transitions using invariants and state equation in 4058 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4276 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Support contains 4 out of 2494 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2494/2494 places, 1796/1796 transitions.
Applied a total of 0 rules in 92 ms. Remains 2494 /2494 variables (removed 0) and now considering 1796/1796 (removed 0) transitions.
[2023-03-22 07:55:39] [INFO ] Invariant cache hit.
[2023-03-22 07:55:42] [INFO ] Implicit Places using invariants in 2805 ms returned []
[2023-03-22 07:55:42] [INFO ] Invariant cache hit.
[2023-03-22 07:55:48] [INFO ] Implicit Places using invariants and state equation in 5963 ms returned []
Implicit Place search using SMT with State Equation took 8779 ms to find 0 implicit places.
[2023-03-22 07:55:48] [INFO ] Invariant cache hit.
[2023-03-22 07:55:50] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10691 ms. Remains : 2494/2494 places, 1796/1796 transitions.
Treatment of property ShieldPPPt-PT-100A-LTLCardinality-03 finished in 225974 ms.
[2023-03-22 07:55:50] [INFO ] Flatten gal took : 158 ms
[2023-03-22 07:55:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 07:55:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2503 places, 1802 transitions and 7204 arcs took 16 ms.
Total runtime 663699 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1691/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-100A-LTLCardinality-03

BK_STOP 1679471752447

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPt-PT-100A-LTLCardinality-03
ltl formula formula --ltl=/tmp/1691/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 1802 transitions and 7204 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.130 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1691/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1691/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1691/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1691/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-100A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPt-PT-100A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717300691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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