Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025000299.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000299
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 7.6K Apr 29 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 512K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652959995816

Running Version 202205111006
[2022-05-19 11:33:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 11:33:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 11:33:17] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2022-05-19 11:33:17] [INFO ] Transformed 2103 places.
[2022-05-19 11:33:17] [INFO ] Transformed 1953 transitions.
[2022-05-19 11:33:17] [INFO ] Found NUPN structural information;
[2022-05-19 11:33:17] [INFO ] Parsed PT model containing 2103 places and 1953 transitions in 325 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 324 places :
Symmetric choice reduction at 0 with 324 rule applications. Total rules 324 place count 1779 transition count 1629
Iterating global reduction 0 with 324 rules applied. Total rules applied 648 place count 1779 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 649 place count 1778 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 650 place count 1778 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 651 place count 1777 transition count 1627
Iterating global reduction 0 with 1 rules applied. Total rules applied 652 place count 1777 transition count 1627
Applied a total of 652 rules in 901 ms. Remains 1777 /2103 variables (removed 326) and now considering 1627/1953 (removed 326) transitions.
// Phase 1: matrix 1627 rows 1777 cols
[2022-05-19 11:33:18] [INFO ] Computed 271 place invariants in 22 ms
[2022-05-19 11:33:19] [INFO ] Implicit Places using invariants in 701 ms returned []
// Phase 1: matrix 1627 rows 1777 cols
[2022-05-19 11:33:19] [INFO ] Computed 271 place invariants in 7 ms
[2022-05-19 11:33:20] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 2254 ms to find 0 implicit places.
// Phase 1: matrix 1627 rows 1777 cols
[2022-05-19 11:33:20] [INFO ] Computed 271 place invariants in 14 ms
[2022-05-19 11:33:21] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1777/2103 places, 1627/1953 transitions.
Finished structural reductions, in 1 iterations. Remains : 1777/2103 places, 1627/1953 transitions.
Support contains 37 out of 1777 places after structural reductions.
[2022-05-19 11:33:21] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 11:33:21] [INFO ] Flatten gal took : 191 ms
FORMULA ShieldIIPt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 11:33:21] [INFO ] Flatten gal took : 79 ms
[2022-05-19 11:33:22] [INFO ] Input system was already deterministic with 1627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 22) seen :7
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 1627 rows 1777 cols
[2022-05-19 11:33:22] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 11:33:23] [INFO ] After 710ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2022-05-19 11:33:24] [INFO ] [Nat]Absence check using 271 positive place invariants in 86 ms returned sat
[2022-05-19 11:33:26] [INFO ] After 1443ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :12
[2022-05-19 11:33:26] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 5 ms to minimize.
[2022-05-19 11:33:26] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 1 ms to minimize.
[2022-05-19 11:33:27] [INFO ] Deduced a trap composed of 23 places in 302 ms of which 1 ms to minimize.
[2022-05-19 11:33:27] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 3 ms to minimize.
[2022-05-19 11:33:27] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 1 ms to minimize.
[2022-05-19 11:33:28] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 1 ms to minimize.
[2022-05-19 11:33:28] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2022-05-19 11:33:28] [INFO ] Deduced a trap composed of 22 places in 250 ms of which 1 ms to minimize.
[2022-05-19 11:33:29] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 2 ms to minimize.
[2022-05-19 11:33:29] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 1 ms to minimize.
[2022-05-19 11:33:29] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 1 ms to minimize.
[2022-05-19 11:33:30] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 1 ms to minimize.
[2022-05-19 11:33:30] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 1 ms to minimize.
[2022-05-19 11:33:30] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 1 ms to minimize.
[2022-05-19 11:33:30] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 1 ms to minimize.
[2022-05-19 11:33:31] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 1 ms to minimize.
[2022-05-19 11:33:31] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 0 ms to minimize.
[2022-05-19 11:33:31] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 1 ms to minimize.
[2022-05-19 11:33:32] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 0 ms to minimize.
[2022-05-19 11:33:32] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 1 ms to minimize.
[2022-05-19 11:33:32] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 1 ms to minimize.
[2022-05-19 11:33:32] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 1 ms to minimize.
[2022-05-19 11:33:33] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 0 ms to minimize.
[2022-05-19 11:33:33] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 1 ms to minimize.
[2022-05-19 11:33:33] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 1 ms to minimize.
[2022-05-19 11:33:33] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 1 ms to minimize.
[2022-05-19 11:33:34] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 0 ms to minimize.
[2022-05-19 11:33:34] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 1 ms to minimize.
[2022-05-19 11:33:34] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 1 ms to minimize.
[2022-05-19 11:33:34] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 0 ms to minimize.
[2022-05-19 11:33:34] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 1 ms to minimize.
[2022-05-19 11:33:35] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 0 ms to minimize.
[2022-05-19 11:33:35] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 0 ms to minimize.
[2022-05-19 11:33:35] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 4 ms to minimize.
[2022-05-19 11:33:35] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 0 ms to minimize.
[2022-05-19 11:33:35] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 9817 ms
[2022-05-19 11:33:36] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 0 ms to minimize.
[2022-05-19 11:33:36] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 0 ms to minimize.
[2022-05-19 11:33:36] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 0 ms to minimize.
[2022-05-19 11:33:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 673 ms
[2022-05-19 11:33:36] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2022-05-19 11:33:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2022-05-19 11:33:37] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2022-05-19 11:33:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2022-05-19 11:33:37] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2022-05-19 11:33:37] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 0 ms to minimize.
[2022-05-19 11:33:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2022-05-19 11:33:38] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 1 ms to minimize.
[2022-05-19 11:33:38] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 1 ms to minimize.
[2022-05-19 11:33:38] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 0 ms to minimize.
[2022-05-19 11:33:38] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 0 ms to minimize.
[2022-05-19 11:33:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 911 ms
[2022-05-19 11:33:39] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2022-05-19 11:33:39] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2022-05-19 11:33:39] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2022-05-19 11:33:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 724 ms
[2022-05-19 11:33:40] [INFO ] After 15446ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :12
Attempting to minimize the solution found.
Minimization took 771 ms.
[2022-05-19 11:33:40] [INFO ] After 17289ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :12
Fused 15 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 853 ms.
Support contains 22 out of 1777 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Drop transitions removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 345 place count 1777 transition count 1282
Reduce places removed 345 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 349 rules applied. Total rules applied 694 place count 1432 transition count 1278
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 698 place count 1428 transition count 1278
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 698 place count 1428 transition count 1046
Deduced a syphon composed of 232 places in 1 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 3 with 464 rules applied. Total rules applied 1162 place count 1196 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1165 place count 1193 transition count 1043
Iterating global reduction 3 with 3 rules applied. Total rules applied 1168 place count 1193 transition count 1043
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1168 place count 1193 transition count 1040
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1174 place count 1190 transition count 1040
Performed 502 Post agglomeration using F-continuation condition.Transition count delta: 502
Deduced a syphon composed of 502 places in 1 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 3 with 1004 rules applied. Total rules applied 2178 place count 688 transition count 538
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2179 place count 688 transition count 537
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2181 place count 687 transition count 536
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2349 place count 603 transition count 589
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2350 place count 603 transition count 588
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 5 with 29 rules applied. Total rules applied 2379 place count 603 transition count 588
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2380 place count 602 transition count 587
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2382 place count 600 transition count 587
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2382 place count 600 transition count 586
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2384 place count 599 transition count 586
Applied a total of 2384 rules in 439 ms. Remains 599 /1777 variables (removed 1178) and now considering 586/1627 (removed 1041) transitions.
Finished structural reductions, in 1 iterations. Remains : 599/1777 places, 586/1627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 92174 steps, run timeout after 3029 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92174 steps, saw 61101 distinct states, run finished after 3031 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 586 rows 599 cols
[2022-05-19 11:33:46] [INFO ] Computed 269 place invariants in 2 ms
[2022-05-19 11:33:46] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-19 11:33:46] [INFO ] [Nat]Absence check using 269 positive place invariants in 28 ms returned sat
[2022-05-19 11:33:47] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-19 11:33:47] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 11:33:47] [INFO ] After 261ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-19 11:33:48] [INFO ] After 670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 263 ms.
[2022-05-19 11:33:48] [INFO ] After 1669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 21 out of 599 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 599/599 places, 586/586 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 599 transition count 585
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 598 transition count 585
Applied a total of 2 rules in 20 ms. Remains 598 /599 variables (removed 1) and now considering 585/586 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 598/599 places, 585/586 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 115057 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115057 steps, saw 75662 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 585 rows 598 cols
[2022-05-19 11:33:52] [INFO ] Computed 269 place invariants in 2 ms
[2022-05-19 11:33:52] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-05-19 11:33:53] [INFO ] [Nat]Absence check using 269 positive place invariants in 35 ms returned sat
[2022-05-19 11:33:53] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2022-05-19 11:33:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-19 11:33:53] [INFO ] After 276ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2022-05-19 11:33:54] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2022-05-19 11:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-19 11:33:54] [INFO ] After 796ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 274 ms.
[2022-05-19 11:33:54] [INFO ] After 1825ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 125 ms.
Support contains 21 out of 598 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 598/598 places, 585/585 transitions.
Applied a total of 0 rules in 30 ms. Remains 598 /598 variables (removed 0) and now considering 585/585 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 598/598 places, 585/585 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 598/598 places, 585/585 transitions.
Applied a total of 0 rules in 13 ms. Remains 598 /598 variables (removed 0) and now considering 585/585 (removed 0) transitions.
// Phase 1: matrix 585 rows 598 cols
[2022-05-19 11:33:54] [INFO ] Computed 269 place invariants in 2 ms
[2022-05-19 11:33:55] [INFO ] Implicit Places using invariants in 366 ms returned [587]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 368 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 597/598 places, 585/585 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 596 transition count 584
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 596 transition count 584
Applied a total of 2 rules in 19 ms. Remains 596 /597 variables (removed 1) and now considering 584/585 (removed 1) transitions.
// Phase 1: matrix 584 rows 596 cols
[2022-05-19 11:33:55] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:33:55] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 584 rows 596 cols
[2022-05-19 11:33:55] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:33:55] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-19 11:33:56] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 596/598 places, 584/585 transitions.
Finished structural reductions, in 2 iterations. Remains : 596/598 places, 584/585 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 114892 steps, run timeout after 3017 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 114892 steps, saw 74906 distinct states, run finished after 3020 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 584 rows 596 cols
[2022-05-19 11:34:00] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:34:00] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-19 11:34:00] [INFO ] [Nat]Absence check using 268 positive place invariants in 35 ms returned sat
[2022-05-19 11:34:01] [INFO ] After 413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2022-05-19 11:34:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-19 11:34:01] [INFO ] After 255ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2022-05-19 11:34:01] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2022-05-19 11:34:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-19 11:34:01] [INFO ] After 761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 244 ms.
[2022-05-19 11:34:02] [INFO ] After 1695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 157 ms.
Support contains 19 out of 596 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 596/596 places, 584/584 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 596 transition count 583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 595 transition count 583
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 595 transition count 582
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 594 transition count 582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 593 transition count 583
Applied a total of 6 rules in 33 ms. Remains 593 /596 variables (removed 3) and now considering 583/584 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 593/596 places, 583/584 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 583 rows 593 cols
[2022-05-19 11:34:03] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:34:03] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:34:03] [INFO ] [Nat]Absence check using 268 positive place invariants in 34 ms returned sat
[2022-05-19 11:34:03] [INFO ] After 350ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:34:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-19 11:34:03] [INFO ] After 172ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:34:04] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2022-05-19 11:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-19 11:34:04] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 179 ms.
[2022-05-19 11:34:04] [INFO ] After 1283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 162 ms.
Support contains 15 out of 593 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 593/593 places, 583/583 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 593 transition count 581
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 591 transition count 581
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 591 transition count 580
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 590 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 588 transition count 578
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 587 transition count 577
Applied a total of 11 rules in 35 ms. Remains 587 /593 variables (removed 6) and now considering 577/583 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 587/593 places, 577/583 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 143310 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143310 steps, saw 93347 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 577 rows 587 cols
[2022-05-19 11:34:08] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:34:08] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:34:08] [INFO ] [Nat]Absence check using 268 positive place invariants in 34 ms returned sat
[2022-05-19 11:34:09] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:34:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-19 11:34:09] [INFO ] After 168ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:34:09] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2022-05-19 11:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2022-05-19 11:34:09] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 170 ms.
[2022-05-19 11:34:09] [INFO ] After 1262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 110 ms.
Support contains 15 out of 587 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 577/577 transitions.
Applied a total of 0 rules in 11 ms. Remains 587 /587 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 577/577 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 587/587 places, 577/577 transitions.
Applied a total of 0 rules in 10 ms. Remains 587 /587 variables (removed 0) and now considering 577/577 (removed 0) transitions.
// Phase 1: matrix 577 rows 587 cols
[2022-05-19 11:34:09] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:34:10] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 577 rows 587 cols
[2022-05-19 11:34:10] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:34:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-19 11:34:10] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2022-05-19 11:34:10] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 577 rows 587 cols
[2022-05-19 11:34:10] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:34:11] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 587/587 places, 577/577 transitions.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 587 transition count 577
Applied a total of 62 rules in 31 ms. Remains 587 /587 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 577 rows 587 cols
[2022-05-19 11:34:11] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:34:11] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:34:11] [INFO ] [Nat]Absence check using 268 positive place invariants in 36 ms returned sat
[2022-05-19 11:34:11] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:34:11] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-05-19 11:34:12] [INFO ] After 233ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:34:12] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2022-05-19 11:34:12] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2022-05-19 11:34:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2022-05-19 11:34:12] [INFO ] After 751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 204 ms.
[2022-05-19 11:34:12] [INFO ] After 1539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:34:12] [INFO ] Flatten gal took : 33 ms
[2022-05-19 11:34:12] [INFO ] Flatten gal took : 51 ms
[2022-05-19 11:34:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5528770621596743497.gal : 24 ms
[2022-05-19 11:34:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15183310918379014636.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16409277742969463442;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5528770621596743497.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15183310918379014636.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality15183310918379014636.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :18 after 54
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :54 after 1998
Reachability property AtomicPropp8 is true.
Reachability property AtomicPropp5 is true.
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1998 after 2837
Reachability property AtomicPropp1 is true.
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2837 after 2994
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2994 after 3379
Reachability property AtomicPropp10 is true.
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3379 after 11742
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :11742 after 37913
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :37913 after 213890
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :213890 after 1.60135e+07
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.60135e+07 after 1.32854e+08
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1.32854e+08 after 1.18148e+11
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.18148e+11 after 9.47127e+13
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :9.47127e+13 after 7.66524e+19
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :7.66524e+19 after 1.38804e+26
Detected timeout of ITS tools.
[2022-05-19 11:34:28] [INFO ] Flatten gal took : 28 ms
[2022-05-19 11:34:28] [INFO ] Applying decomposition
[2022-05-19 11:34:28] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8402410597277198854.txt' '-o' '/tmp/graph8402410597277198854.bin' '-w' '/tmp/graph8402410597277198854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8402410597277198854.bin' '-l' '-1' '-v' '-w' '/tmp/graph8402410597277198854.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:34:28] [INFO ] Decomposing Gal with order
[2022-05-19 11:34:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:34:28] [INFO ] Removed a total of 327 redundant transitions.
[2022-05-19 11:34:28] [INFO ] Flatten gal took : 84 ms
[2022-05-19 11:34:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 15 ms.
[2022-05-19 11:34:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality652686186217460846.gal : 10 ms
[2022-05-19 11:34:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1906005197015240013.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16409277742969463442;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality652686186217460846.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1906005197015240013.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/ReachabilityCardinality1906005197015240013.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :6 after 54
Reachability property AtomicPropp7 is true.
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3.31776e+06 after 5.48631e+19
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.48631e+19 after 9.23142e+24
Reachability property AtomicPropp18 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.74775e+57,12.2215,258036,1422,206,418306,2923,862,1.32632e+06,153,41359,0
Total reachable state count : 1.74774949333192815820379475170186361965e+57

Verifying 3 reachability properties.
Reachability property AtomicPropp6 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp6,1.90898e+53,12.2403,258036,297,98,418306,2923,872,1.32632e+06,158,41359,0
Reachability property AtomicPropp7 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,2.53808e+54,12.2411,258036,308,102,418306,2923,882,1.32632e+06,162,41359,0
Reachability property AtomicPropp18 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp18,7.22865e+44,12.242,258036,254,85,418306,2923,904,1.32632e+06,168,41359,0
FORMULA ShieldIIPt-PT-030B-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 480 stabilizing places and 480 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U (X(p1)&&p0)))'
Support contains 3 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1771 transition count 1621
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1771 transition count 1621
Applied a total of 12 rules in 150 ms. Remains 1771 /1777 variables (removed 6) and now considering 1621/1627 (removed 6) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:34:41] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 11:34:41] [INFO ] Implicit Places using invariants in 623 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:34:41] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 11:34:43] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:34:43] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:34:44] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1777 places, 1621/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1777 places, 1621/1627 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s82 1), p1:(OR (EQ s78 0) (EQ s649 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 11 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-00 finished in 3450 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(G(G(G(p0))))||p1))))'
Support contains 2 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1772 transition count 1622
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1772 transition count 1622
Applied a total of 10 rules in 135 ms. Remains 1772 /1777 variables (removed 5) and now considering 1622/1627 (removed 5) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:34:44] [INFO ] Computed 271 place invariants in 16 ms
[2022-05-19 11:34:45] [INFO ] Implicit Places using invariants in 489 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:34:45] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:34:46] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:34:46] [INFO ] Computed 271 place invariants in 13 ms
[2022-05-19 11:34:47] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1777 places, 1622/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1772/1777 places, 1622/1627 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (NEQ s592 0) (NEQ s606 1)), p1:(AND (EQ s606 0) (EQ s592 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-01 finished in 3032 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1777 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1776 transition count 1268
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 1418 transition count 1268
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 716 place count 1418 transition count 1031
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1190 place count 1181 transition count 1031
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1195 place count 1176 transition count 1026
Iterating global reduction 2 with 5 rules applied. Total rules applied 1200 place count 1176 transition count 1026
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1200 place count 1176 transition count 1021
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1210 place count 1171 transition count 1021
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 1 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 2 with 1012 rules applied. Total rules applied 2222 place count 665 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2223 place count 665 transition count 514
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2225 place count 664 transition count 513
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2403 place count 575 transition count 572
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2404 place count 575 transition count 572
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2406 place count 573 transition count 570
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2408 place count 571 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2408 place count 571 transition count 569
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2410 place count 570 transition count 569
Applied a total of 2410 rules in 369 ms. Remains 570 /1777 variables (removed 1207) and now considering 569/1627 (removed 1058) transitions.
// Phase 1: matrix 569 rows 570 cols
[2022-05-19 11:34:48] [INFO ] Computed 269 place invariants in 1 ms
[2022-05-19 11:34:48] [INFO ] Implicit Places using invariants in 614 ms returned [559]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 620 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 569/1777 places, 569/1627 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 568
Applied a total of 2 rules in 33 ms. Remains 568 /569 variables (removed 1) and now considering 568/569 (removed 1) transitions.
// Phase 1: matrix 568 rows 568 cols
[2022-05-19 11:34:48] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:34:49] [INFO ] Implicit Places using invariants in 586 ms returned []
// Phase 1: matrix 568 rows 568 cols
[2022-05-19 11:34:49] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:34:49] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 568/1777 places, 568/1627 transitions.
Finished structural reductions, in 2 iterations. Remains : 568/1777 places, 568/1627 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s491 0) (EQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 497 steps with 0 reset in 9 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-02 finished in 2200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1771 transition count 1621
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1771 transition count 1621
Applied a total of 12 rules in 169 ms. Remains 1771 /1777 variables (removed 6) and now considering 1621/1627 (removed 6) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:34:49] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:34:50] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:34:50] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:34:51] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:34:51] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:34:52] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1777 places, 1621/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1777 places, 1621/1627 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s369 0) (NEQ s1324 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-04 finished in 3106 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Support contains 4 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1771 transition count 1621
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1771 transition count 1621
Applied a total of 12 rules in 128 ms. Remains 1771 /1777 variables (removed 6) and now considering 1621/1627 (removed 6) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:34:53] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:34:53] [INFO ] Implicit Places using invariants in 568 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:34:53] [INFO ] Computed 271 place invariants in 7 ms
[2022-05-19 11:34:55] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:34:55] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:34:55] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1777 places, 1621/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1777 places, 1621/1627 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1647 0) (EQ s585 1)), p1:(AND (NEQ s629 0) (NEQ s505 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-05 finished in 3129 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||p1)))'
Support contains 4 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1772 transition count 1622
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1772 transition count 1622
Applied a total of 10 rules in 146 ms. Remains 1772 /1777 variables (removed 5) and now considering 1622/1627 (removed 5) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:34:56] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:34:56] [INFO ] Implicit Places using invariants in 482 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:34:56] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:34:58] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:34:58] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 11:34:58] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1777 places, 1622/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1772/1777 places, 1622/1627 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(OR (EQ s334 0) (EQ s1199 1)), p1:(AND (EQ s323 0) (EQ s800 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1137 ms.
Product exploration explored 100000 steps with 50000 reset in 1075 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-06 finished in 5448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(G(p0))))))'
Support contains 1 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1771 transition count 1621
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1771 transition count 1621
Applied a total of 12 rules in 117 ms. Remains 1771 /1777 variables (removed 6) and now considering 1621/1627 (removed 6) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:35:01] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 11:35:02] [INFO ] Implicit Places using invariants in 546 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:35:02] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:35:03] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:35:03] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1777 places, 1621/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1777 places, 1621/1627 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s127 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 548 ms.
Product exploration explored 100000 steps with 0 reset in 911 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 171420 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171420 steps, saw 96698 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:35:09] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 11:35:09] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:35:09] [INFO ] [Nat]Absence check using 271 positive place invariants in 78 ms returned sat
[2022-05-19 11:35:10] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:35:10] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 1 ms to minimize.
[2022-05-19 11:35:11] [INFO ] Deduced a trap composed of 23 places in 324 ms of which 1 ms to minimize.
[2022-05-19 11:35:11] [INFO ] Deduced a trap composed of 22 places in 335 ms of which 1 ms to minimize.
[2022-05-19 11:35:12] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 1 ms to minimize.
[2022-05-19 11:35:12] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 2 ms to minimize.
[2022-05-19 11:35:12] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 5 ms to minimize.
[2022-05-19 11:35:13] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 1 ms to minimize.
[2022-05-19 11:35:13] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 2 ms to minimize.
[2022-05-19 11:35:13] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 1 ms to minimize.
[2022-05-19 11:35:14] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 1 ms to minimize.
[2022-05-19 11:35:14] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 0 ms to minimize.
[2022-05-19 11:35:14] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 0 ms to minimize.
[2022-05-19 11:35:15] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 1 ms to minimize.
[2022-05-19 11:35:15] [INFO ] Deduced a trap composed of 29 places in 283 ms of which 0 ms to minimize.
[2022-05-19 11:35:15] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 1 ms to minimize.
[2022-05-19 11:35:16] [INFO ] Deduced a trap composed of 19 places in 235 ms of which 0 ms to minimize.
[2022-05-19 11:35:16] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 1 ms to minimize.
[2022-05-19 11:35:16] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 1 ms to minimize.
[2022-05-19 11:35:17] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 0 ms to minimize.
[2022-05-19 11:35:17] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 0 ms to minimize.
[2022-05-19 11:35:17] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 1 ms to minimize.
[2022-05-19 11:35:17] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 1 ms to minimize.
[2022-05-19 11:35:18] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 0 ms to minimize.
[2022-05-19 11:35:18] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 0 ms to minimize.
[2022-05-19 11:35:18] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 1 ms to minimize.
[2022-05-19 11:35:19] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 1 ms to minimize.
[2022-05-19 11:35:19] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 1 ms to minimize.
[2022-05-19 11:35:19] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 0 ms to minimize.
[2022-05-19 11:35:19] [INFO ] Deduced a trap composed of 32 places in 198 ms of which 1 ms to minimize.
[2022-05-19 11:35:20] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 0 ms to minimize.
[2022-05-19 11:35:20] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 1 ms to minimize.
[2022-05-19 11:35:20] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 0 ms to minimize.
[2022-05-19 11:35:20] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 0 ms to minimize.
[2022-05-19 11:35:21] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 0 ms to minimize.
[2022-05-19 11:35:21] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 0 ms to minimize.
[2022-05-19 11:35:21] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 1 ms to minimize.
[2022-05-19 11:35:21] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 0 ms to minimize.
[2022-05-19 11:35:22] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 1 ms to minimize.
[2022-05-19 11:35:22] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 1 ms to minimize.
[2022-05-19 11:35:22] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 0 ms to minimize.
[2022-05-19 11:35:22] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 0 ms to minimize.
[2022-05-19 11:35:22] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 1 ms to minimize.
[2022-05-19 11:35:23] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 1 ms to minimize.
[2022-05-19 11:35:23] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 0 ms to minimize.
[2022-05-19 11:35:23] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 0 ms to minimize.
[2022-05-19 11:35:23] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 1 ms to minimize.
[2022-05-19 11:35:24] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 0 ms to minimize.
[2022-05-19 11:35:24] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 0 ms to minimize.
[2022-05-19 11:35:24] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 13771 ms
[2022-05-19 11:35:24] [INFO ] After 14472ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2022-05-19 11:35:24] [INFO ] After 14819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 1771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1771/1771 places, 1621/1621 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1771 transition count 1263
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 1413 transition count 1263
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 241 Pre rules applied. Total rules applied 716 place count 1413 transition count 1022
Deduced a syphon composed of 241 places in 1 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 2 with 482 rules applied. Total rules applied 1198 place count 1172 transition count 1022
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2216 place count 663 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2217 place count 663 transition count 512
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2219 place count 662 transition count 511
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2397 place count 573 transition count 570
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2398 place count 573 transition count 569
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 4 with 31 rules applied. Total rules applied 2429 place count 573 transition count 569
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2430 place count 572 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2432 place count 570 transition count 568
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2432 place count 570 transition count 567
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2434 place count 569 transition count 567
Applied a total of 2434 rules in 229 ms. Remains 569 /1771 variables (removed 1202) and now considering 567/1621 (removed 1054) transitions.
Finished structural reductions, in 1 iterations. Remains : 569/1771 places, 567/1621 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 308580 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308580 steps, saw 197790 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 567 rows 569 cols
[2022-05-19 11:35:27] [INFO ] Computed 269 place invariants in 1 ms
[2022-05-19 11:35:27] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:35:27] [INFO ] [Nat]Absence check using 269 positive place invariants in 29 ms returned sat
[2022-05-19 11:35:28] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:35:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-19 11:35:28] [INFO ] After 26ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:35:28] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-19 11:35:28] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 569 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 54 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 569/569 places, 567/567 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 9 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
// Phase 1: matrix 567 rows 569 cols
[2022-05-19 11:35:28] [INFO ] Computed 269 place invariants in 1 ms
[2022-05-19 11:35:28] [INFO ] Implicit Places using invariants in 402 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 414 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 568/569 places, 567/567 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 567 transition count 566
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 567 transition count 566
Applied a total of 2 rules in 21 ms. Remains 567 /568 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:35:28] [INFO ] Computed 268 place invariants in 0 ms
[2022-05-19 11:35:29] [INFO ] Implicit Places using invariants in 400 ms returned []
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:35:29] [INFO ] Computed 268 place invariants in 9 ms
[2022-05-19 11:35:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:35:29] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 567/569 places, 566/567 transitions.
Finished structural reductions, in 2 iterations. Remains : 567/569 places, 566/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 310184 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 310184 steps, saw 199039 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:35:32] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:35:32] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:35:32] [INFO ] [Nat]Absence check using 268 positive place invariants in 32 ms returned sat
[2022-05-19 11:35:33] [INFO ] After 193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:35:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:35:33] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:35:33] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-19 11:35:33] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 587 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=117 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1771 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1771/1771 places, 1621/1621 transitions.
Applied a total of 0 rules in 61 ms. Remains 1771 /1771 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:35:33] [INFO ] Computed 271 place invariants in 9 ms
[2022-05-19 11:35:34] [INFO ] Implicit Places using invariants in 489 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:35:34] [INFO ] Computed 271 place invariants in 21 ms
[2022-05-19 11:35:35] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1895 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:35:35] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 11:35:36] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1771 places, 1621/1621 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 181237 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181237 steps, saw 101435 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:35:39] [INFO ] Computed 271 place invariants in 9 ms
[2022-05-19 11:35:40] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:35:40] [INFO ] [Nat]Absence check using 271 positive place invariants in 74 ms returned sat
[2022-05-19 11:35:41] [INFO ] After 673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:35:41] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 1 ms to minimize.
[2022-05-19 11:35:41] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 0 ms to minimize.
[2022-05-19 11:35:42] [INFO ] Deduced a trap composed of 22 places in 307 ms of which 1 ms to minimize.
[2022-05-19 11:35:42] [INFO ] Deduced a trap composed of 22 places in 303 ms of which 0 ms to minimize.
[2022-05-19 11:35:42] [INFO ] Deduced a trap composed of 22 places in 295 ms of which 1 ms to minimize.
[2022-05-19 11:35:43] [INFO ] Deduced a trap composed of 30 places in 288 ms of which 1 ms to minimize.
[2022-05-19 11:35:43] [INFO ] Deduced a trap composed of 22 places in 310 ms of which 1 ms to minimize.
[2022-05-19 11:35:43] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 0 ms to minimize.
[2022-05-19 11:35:44] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 1 ms to minimize.
[2022-05-19 11:35:44] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 0 ms to minimize.
[2022-05-19 11:35:44] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2022-05-19 11:35:45] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2022-05-19 11:35:45] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 0 ms to minimize.
[2022-05-19 11:35:45] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 1 ms to minimize.
[2022-05-19 11:35:46] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 1 ms to minimize.
[2022-05-19 11:35:46] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 0 ms to minimize.
[2022-05-19 11:35:46] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 1 ms to minimize.
[2022-05-19 11:35:46] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 0 ms to minimize.
[2022-05-19 11:35:47] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 0 ms to minimize.
[2022-05-19 11:35:47] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 1 ms to minimize.
[2022-05-19 11:35:47] [INFO ] Deduced a trap composed of 34 places in 215 ms of which 1 ms to minimize.
[2022-05-19 11:35:47] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2022-05-19 11:35:48] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 1 ms to minimize.
[2022-05-19 11:35:48] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 1 ms to minimize.
[2022-05-19 11:35:48] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 1 ms to minimize.
[2022-05-19 11:35:48] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 1 ms to minimize.
[2022-05-19 11:35:49] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 1 ms to minimize.
[2022-05-19 11:35:49] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 0 ms to minimize.
[2022-05-19 11:35:49] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 0 ms to minimize.
[2022-05-19 11:35:50] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 0 ms to minimize.
[2022-05-19 11:35:50] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 1 ms to minimize.
[2022-05-19 11:35:50] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 1 ms to minimize.
[2022-05-19 11:35:50] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 0 ms to minimize.
[2022-05-19 11:35:50] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 1 ms to minimize.
[2022-05-19 11:35:51] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 1 ms to minimize.
[2022-05-19 11:35:51] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 0 ms to minimize.
[2022-05-19 11:35:51] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 0 ms to minimize.
[2022-05-19 11:35:51] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 0 ms to minimize.
[2022-05-19 11:35:52] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 0 ms to minimize.
[2022-05-19 11:35:52] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 1 ms to minimize.
[2022-05-19 11:35:52] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 0 ms to minimize.
[2022-05-19 11:35:52] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 1 ms to minimize.
[2022-05-19 11:35:52] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 1 ms to minimize.
[2022-05-19 11:35:53] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 1 ms to minimize.
[2022-05-19 11:35:53] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 1 ms to minimize.
[2022-05-19 11:35:53] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 0 ms to minimize.
[2022-05-19 11:35:53] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2022-05-19 11:35:53] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 0 ms to minimize.
[2022-05-19 11:35:54] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 12990 ms
[2022-05-19 11:35:54] [INFO ] After 13716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-19 11:35:54] [INFO ] After 14054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 1771 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1771/1771 places, 1621/1621 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1771 transition count 1263
Reduce places removed 358 places and 0 transitions.
Iterating post reduction 1 with 358 rules applied. Total rules applied 716 place count 1413 transition count 1263
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 241 Pre rules applied. Total rules applied 716 place count 1413 transition count 1022
Deduced a syphon composed of 241 places in 2 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 2 with 482 rules applied. Total rules applied 1198 place count 1172 transition count 1022
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 0 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2216 place count 663 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2217 place count 663 transition count 512
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2219 place count 662 transition count 511
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2397 place count 573 transition count 570
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2398 place count 573 transition count 569
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 4 with 31 rules applied. Total rules applied 2429 place count 573 transition count 569
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2430 place count 572 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2432 place count 570 transition count 568
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2432 place count 570 transition count 567
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2434 place count 569 transition count 567
Applied a total of 2434 rules in 219 ms. Remains 569 /1771 variables (removed 1202) and now considering 567/1621 (removed 1054) transitions.
Finished structural reductions, in 1 iterations. Remains : 569/1771 places, 567/1621 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 323696 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 323696 steps, saw 207358 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 567 rows 569 cols
[2022-05-19 11:35:57] [INFO ] Computed 269 place invariants in 2 ms
[2022-05-19 11:35:57] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:35:57] [INFO ] [Nat]Absence check using 269 positive place invariants in 33 ms returned sat
[2022-05-19 11:35:57] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:35:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-19 11:35:57] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:35:57] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-19 11:35:57] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 569 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 8 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 569/569 places, 567/567 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 7 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
// Phase 1: matrix 567 rows 569 cols
[2022-05-19 11:35:57] [INFO ] Computed 269 place invariants in 2 ms
[2022-05-19 11:35:58] [INFO ] Implicit Places using invariants in 296 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 299 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 568/569 places, 567/567 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 567 transition count 566
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 567 transition count 566
Applied a total of 2 rules in 13 ms. Remains 567 /568 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:35:58] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:35:58] [INFO ] Implicit Places using invariants in 387 ms returned []
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:35:58] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:35:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:35:59] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 567/569 places, 566/567 transitions.
Finished structural reductions, in 2 iterations. Remains : 567/569 places, 566/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 321251 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 321251 steps, saw 205954 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:36:02] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:36:02] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:36:02] [INFO ] [Nat]Absence check using 268 positive place invariants in 29 ms returned sat
[2022-05-19 11:36:02] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:36:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:36:02] [INFO ] After 24ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:36:02] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-19 11:36:02] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 464 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=92 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 554 ms.
Product exploration explored 100000 steps with 0 reset in 671 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1771 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1771/1771 places, 1621/1621 transitions.
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1771 transition count 1621
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 121 Pre rules applied. Total rules applied 358 place count 1771 transition count 1712
Deduced a syphon composed of 479 places in 1 ms
Iterating global reduction 1 with 121 rules applied. Total rules applied 479 place count 1771 transition count 1712
Performed 600 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1079 places in 1 ms
Iterating global reduction 1 with 600 rules applied. Total rules applied 1079 place count 1771 transition count 1712
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1080 place count 1771 transition count 1711
Renaming transitions due to excessive name length > 1024 char.
Discarding 240 places :
Symmetric choice reduction at 2 with 240 rule applications. Total rules 1320 place count 1531 transition count 1471
Deduced a syphon composed of 839 places in 1 ms
Iterating global reduction 2 with 240 rules applied. Total rules applied 1560 place count 1531 transition count 1471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 840 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1561 place count 1531 transition count 1471
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1563 place count 1529 transition count 1469
Deduced a syphon composed of 838 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1565 place count 1529 transition count 1469
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 939 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1666 place count 1529 transition count 1999
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1767 place count 1428 transition count 1797
Deduced a syphon composed of 838 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1868 place count 1428 transition count 1797
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 855 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1885 place count 1428 transition count 1894
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1902 place count 1411 transition count 1860
Deduced a syphon composed of 838 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1919 place count 1411 transition count 1860
Deduced a syphon composed of 838 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1928 place count 1411 transition count 1851
Deduced a syphon composed of 838 places in 1 ms
Applied a total of 1928 rules in 953 ms. Remains 1411 /1771 variables (removed 360) and now considering 1851/1621 (removed -230) transitions.
[2022-05-19 11:36:05] [INFO ] Redundant transitions in 118 ms returned []
// Phase 1: matrix 1851 rows 1411 cols
[2022-05-19 11:36:06] [INFO ] Computed 271 place invariants in 17 ms
[2022-05-19 11:36:06] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1411/1771 places, 1851/1621 transitions.
Finished structural reductions, in 1 iterations. Remains : 1411/1771 places, 1851/1621 transitions.
Product exploration explored 100000 steps with 0 reset in 626 ms.
Product exploration explored 100000 steps with 0 reset in 730 ms.
Built C files in :
/tmp/ltsmin5463487436579026341
[2022-05-19 11:36:08] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5463487436579026341
Running compilation step : cd /tmp/ltsmin5463487436579026341;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2976 ms.
Running link step : cd /tmp/ltsmin5463487436579026341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5463487436579026341;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6392807529791290510.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 1771 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1771/1771 places, 1621/1621 transitions.
Applied a total of 0 rules in 80 ms. Remains 1771 /1771 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:36:23] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:36:23] [INFO ] Implicit Places using invariants in 450 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:36:23] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:36:25] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:36:25] [INFO ] Computed 271 place invariants in 12 ms
[2022-05-19 11:36:25] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1771 places, 1621/1621 transitions.
Built C files in :
/tmp/ltsmin9561673419788004726
[2022-05-19 11:36:26] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9561673419788004726
Running compilation step : cd /tmp/ltsmin9561673419788004726;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2898 ms.
Running link step : cd /tmp/ltsmin9561673419788004726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9561673419788004726;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2938852736910385290.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 11:36:41] [INFO ] Flatten gal took : 42 ms
[2022-05-19 11:36:41] [INFO ] Flatten gal took : 39 ms
[2022-05-19 11:36:41] [INFO ] Time to serialize gal into /tmp/LTL12885470170930801977.gal : 6 ms
[2022-05-19 11:36:41] [INFO ] Time to serialize properties into /tmp/LTL17810407517269025026.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12885470170930801977.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17810407517269025026.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1288547...268
Read 1 LTL properties
Checking formula 0 : !((X(G(X(X(G("(p142==0)")))))))
Formula 0 simplified : !XGXXG"(p142==0)"
Detected timeout of ITS tools.
[2022-05-19 11:36:56] [INFO ] Flatten gal took : 38 ms
[2022-05-19 11:36:56] [INFO ] Applying decomposition
[2022-05-19 11:36:56] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3472350176275556849.txt' '-o' '/tmp/graph3472350176275556849.bin' '-w' '/tmp/graph3472350176275556849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3472350176275556849.bin' '-l' '-1' '-v' '-w' '/tmp/graph3472350176275556849.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:36:56] [INFO ] Decomposing Gal with order
[2022-05-19 11:36:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:36:56] [INFO ] Removed a total of 302 redundant transitions.
[2022-05-19 11:36:56] [INFO ] Flatten gal took : 81 ms
[2022-05-19 11:36:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-19 11:36:56] [INFO ] Time to serialize gal into /tmp/LTL17467781223088317909.gal : 12 ms
[2022-05-19 11:36:56] [INFO ] Time to serialize properties into /tmp/LTL7564215789991039961.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17467781223088317909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7564215789991039961.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1746778...246
Read 1 LTL properties
Checking formula 0 : !((X(G(X(X(G("(i1.i4.u48.p142==0)")))))))
Formula 0 simplified : !XGXXG"(i1.i4.u48.p142==0)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15284898303637953095
[2022-05-19 11:37:11] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15284898303637953095
Running compilation step : cd /tmp/ltsmin15284898303637953095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2923 ms.
Running link step : cd /tmp/ltsmin15284898303637953095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15284898303637953095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](X(X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-07 finished in 145358 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(F(!(G(p0) U p1)))))))'
Support contains 3 out of 1777 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1776 transition count 1268
Reduce places removed 358 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 359 rules applied. Total rules applied 717 place count 1418 transition count 1267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 718 place count 1417 transition count 1267
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 718 place count 1417 transition count 1030
Deduced a syphon composed of 237 places in 2 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1192 place count 1180 transition count 1030
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1197 place count 1175 transition count 1025
Iterating global reduction 3 with 5 rules applied. Total rules applied 1202 place count 1175 transition count 1025
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1202 place count 1175 transition count 1020
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1212 place count 1170 transition count 1020
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 504
Deduced a syphon composed of 504 places in 0 ms
Reduce places removed 504 places and 0 transitions.
Iterating global reduction 3 with 1008 rules applied. Total rules applied 2220 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2221 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2223 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2401 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2403 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2405 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2405 place count 572 transition count 570
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2407 place count 571 transition count 570
Applied a total of 2407 rules in 252 ms. Remains 571 /1777 variables (removed 1206) and now considering 570/1627 (removed 1057) transitions.
// Phase 1: matrix 570 rows 571 cols
[2022-05-19 11:37:27] [INFO ] Computed 269 place invariants in 3 ms
[2022-05-19 11:37:27] [INFO ] Implicit Places using invariants in 295 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 298 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1777 places, 570/1627 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 569 transition count 569
Applied a total of 2 rules in 41 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2022-05-19 11:37:27] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:37:27] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 569 rows 569 cols
[2022-05-19 11:37:27] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:37:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 11:37:28] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1777 places, 569/1627 transitions.
Finished structural reductions, in 2 iterations. Remains : 569/1777 places, 569/1627 transitions.
Stuttering acceptance computed with spot in 111 ms :[p1, p1, (AND p1 p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s320 1), p0:(OR (EQ s471 0) (EQ s433 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 52288 steps with 2 reset in 322 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-09 finished in 1864 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G(X(X(p1)))))'
Support contains 4 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1771 transition count 1621
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1771 transition count 1621
Applied a total of 12 rules in 113 ms. Remains 1771 /1777 variables (removed 6) and now considering 1621/1627 (removed 6) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:37:28] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 11:37:29] [INFO ] Implicit Places using invariants in 487 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:37:29] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:37:30] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1817 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:37:30] [INFO ] Computed 271 place invariants in 11 ms
[2022-05-19 11:37:31] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1777 places, 1621/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1777 places, 1621/1627 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-10 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s1635 0) (EQ s66 1)), p1:(OR (EQ s933 0) (EQ s1611 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-10 finished in 2902 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1773 transition count 1623
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1773 transition count 1623
Applied a total of 8 rules in 128 ms. Remains 1773 /1777 variables (removed 4) and now considering 1623/1627 (removed 4) transitions.
// Phase 1: matrix 1623 rows 1773 cols
[2022-05-19 11:37:31] [INFO ] Computed 271 place invariants in 9 ms
[2022-05-19 11:37:32] [INFO ] Implicit Places using invariants in 485 ms returned []
// Phase 1: matrix 1623 rows 1773 cols
[2022-05-19 11:37:32] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:37:33] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 1924 ms to find 0 implicit places.
// Phase 1: matrix 1623 rows 1773 cols
[2022-05-19 11:37:33] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:37:34] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1773/1777 places, 1623/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1773/1777 places, 1623/1627 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-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 s1394 0) (EQ s1631 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 1004 ms.
Product exploration explored 100000 steps with 50000 reset in 1025 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [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 75 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-12 finished in 5069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(G(p0))))))'
Found a SL insensitive property : ShieldIIPt-PT-030B-LTLCardinality-07
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1777 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 1776 transition count 1267
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 1417 transition count 1267
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 718 place count 1417 transition count 1030
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1192 place count 1180 transition count 1030
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1197 place count 1175 transition count 1025
Iterating global reduction 2 with 5 rules applied. Total rules applied 1202 place count 1175 transition count 1025
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1202 place count 1175 transition count 1020
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1212 place count 1170 transition count 1020
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 0 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 2 with 1012 rules applied. Total rules applied 2224 place count 664 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2225 place count 664 transition count 513
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2227 place count 663 transition count 512
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2405 place count 574 transition count 571
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2406 place count 574 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2408 place count 572 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2410 place count 570 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2410 place count 570 transition count 568
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2412 place count 569 transition count 568
Applied a total of 2412 rules in 236 ms. Remains 569 /1777 variables (removed 1208) and now considering 568/1627 (removed 1059) transitions.
// Phase 1: matrix 568 rows 569 cols
[2022-05-19 11:37:37] [INFO ] Computed 269 place invariants in 3 ms
[2022-05-19 11:37:37] [INFO ] Implicit Places using invariants in 283 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 285 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 568/1777 places, 568/1627 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 567 transition count 567
Applied a total of 2 rules in 15 ms. Remains 567 /568 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:37:37] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:37:37] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:37:37] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:37:38] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 567/1777 places, 567/1627 transitions.
Finished structural reductions, in 2 iterations. Remains : 567/1777 places, 567/1627 transitions.
Running random walk in product with property : ShieldIIPt-PT-030B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s36 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 563 ms.
Product exploration explored 100000 steps with 0 reset in 687 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 335609 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335609 steps, saw 212405 distinct states, run finished after 3002 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:37:42] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:37:43] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:37:43] [INFO ] [Nat]Absence check using 268 positive place invariants in 32 ms returned sat
[2022-05-19 11:37:43] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:37:43] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-19 11:37:43] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 567 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 567/567 places, 567/567 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 566
Applied a total of 1 rules in 11 ms. Remains 567 /567 variables (removed 0) and now considering 566/567 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 567/567 places, 566/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 340979 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340979 steps, saw 220764 distinct states, run finished after 3002 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:37:46] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:37:46] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:37:46] [INFO ] [Nat]Absence check using 268 positive place invariants in 32 ms returned sat
[2022-05-19 11:37:46] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:37:46] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-19 11:37:46] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 567 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 567/567 places, 566/566 transitions.
Applied a total of 0 rules in 8 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 567/567 places, 566/566 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 567/567 places, 566/566 transitions.
Applied a total of 0 rules in 8 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:37:46] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:37:47] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:37:47] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:37:47] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2022-05-19 11:37:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:37:47] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:37:48] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 567/567 places, 566/566 transitions.
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 567 transition count 566
Applied a total of 60 rules in 14 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:37:48] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:37:48] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:37:48] [INFO ] [Nat]Absence check using 268 positive place invariants in 30 ms returned sat
[2022-05-19 11:37:48] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:37:48] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-19 11:37:48] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:37:48] [INFO ] Flatten gal took : 29 ms
[2022-05-19 11:37:48] [INFO ] Flatten gal took : 16 ms
[2022-05-19 11:37:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2308668266907387867.gal : 5 ms
[2022-05-19 11:37:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16043289738653500715.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3901224368042503099;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2308668266907387867.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16043289738653500715.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16043289738653500715.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 483
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9961,0.194027,8888,2,1384,12,7897,6,0,2837,4371,0
Total reachable state count : 9961

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,161,0.195852,8888,2,631,12,7897,7,0,2840,4371,0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 567 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 567/567 places, 567/567 transitions.
Applied a total of 0 rules in 7 ms. Remains 567 /567 variables (removed 0) and now considering 567/567 (removed 0) transitions.
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:37:49] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:37:49] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:37:49] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:37:49] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:37:49] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:37:50] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 567/567 places, 567/567 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 351426 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 351426 steps, saw 222147 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:37:53] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:37:53] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:37:53] [INFO ] [Nat]Absence check using 268 positive place invariants in 31 ms returned sat
[2022-05-19 11:37:53] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:37:53] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-19 11:37:54] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 567 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 567/567 places, 567/567 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 566
Applied a total of 1 rules in 9 ms. Remains 567 /567 variables (removed 0) and now considering 566/567 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 567/567 places, 566/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 342173 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342173 steps, saw 221567 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:37:57] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:37:57] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:37:57] [INFO ] [Nat]Absence check using 268 positive place invariants in 31 ms returned sat
[2022-05-19 11:37:57] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:37:57] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-19 11:37:57] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 567 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 567/567 places, 566/566 transitions.
Applied a total of 0 rules in 8 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 567/567 places, 566/566 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 567/567 places, 566/566 transitions.
Applied a total of 0 rules in 7 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:37:57] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:37:57] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:37:57] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:37:58] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2022-05-19 11:37:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:37:58] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:37:58] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 567/567 places, 566/566 transitions.
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 567 transition count 566
Applied a total of 60 rules in 14 ms. Remains 567 /567 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 567 cols
[2022-05-19 11:37:58] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:37:58] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:37:58] [INFO ] [Nat]Absence check using 268 positive place invariants in 31 ms returned sat
[2022-05-19 11:37:59] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:37:59] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-19 11:37:59] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:37:59] [INFO ] Flatten gal took : 18 ms
[2022-05-19 11:37:59] [INFO ] Flatten gal took : 18 ms
[2022-05-19 11:37:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10930154056365969280.gal : 3 ms
[2022-05-19 11:37:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16818744596835426530.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3432853047033939108;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10930154056365969280.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16818744596835426530.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality16818744596835426530.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 70
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :70 after 137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :137 after 483
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9961,0.188958,8888,2,1384,12,7897,6,0,2837,4371,0
Total reachable state count : 9961

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,161,0.190872,8888,2,631,12,7897,7,0,2840,4371,0
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 573 ms.
Product exploration explored 100000 steps with 0 reset in 715 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 567/567 places, 567/567 transitions.
Applied a total of 0 rules in 13 ms. Remains 567 /567 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2022-05-19 11:38:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:38:01] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:38:01] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 567/567 places, 567/567 transitions.
Product exploration explored 100000 steps with 0 reset in 560 ms.
Product exploration explored 100000 steps with 0 reset in 801 ms.
Built C files in :
/tmp/ltsmin10566836039183935162
[2022-05-19 11:38:03] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10566836039183935162
Running compilation step : cd /tmp/ltsmin10566836039183935162;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 971 ms.
Running link step : cd /tmp/ltsmin10566836039183935162;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10566836039183935162;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11119273492525388739.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 567 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 567/567 places, 567/567 transitions.
Applied a total of 0 rules in 10 ms. Remains 567 /567 variables (removed 0) and now considering 567/567 (removed 0) transitions.
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:38:18] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:38:18] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:38:18] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:38:19] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
// Phase 1: matrix 567 rows 567 cols
[2022-05-19 11:38:19] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:38:19] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 567/567 places, 567/567 transitions.
Built C files in :
/tmp/ltsmin1885458771114486977
[2022-05-19 11:38:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1885458771114486977
Running compilation step : cd /tmp/ltsmin1885458771114486977;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 976 ms.
Running link step : cd /tmp/ltsmin1885458771114486977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1885458771114486977;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16411132314788775744.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 11:38:34] [INFO ] Flatten gal took : 17 ms
[2022-05-19 11:38:34] [INFO ] Flatten gal took : 16 ms
[2022-05-19 11:38:34] [INFO ] Time to serialize gal into /tmp/LTL10676004124661304496.gal : 2 ms
[2022-05-19 11:38:34] [INFO ] Time to serialize properties into /tmp/LTL16438898987697829104.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10676004124661304496.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16438898987697829104.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1067600...268
Read 1 LTL properties
Checking formula 0 : !((X(G(X(X(G("(p142==0)")))))))
Formula 0 simplified : !XGXXG"(p142==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.12205e+36 deadlock states
Detected timeout of ITS tools.
[2022-05-19 11:38:49] [INFO ] Flatten gal took : 27 ms
[2022-05-19 11:38:49] [INFO ] Applying decomposition
[2022-05-19 11:38:49] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14535250999971538518.txt' '-o' '/tmp/graph14535250999971538518.bin' '-w' '/tmp/graph14535250999971538518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14535250999971538518.bin' '-l' '-1' '-v' '-w' '/tmp/graph14535250999971538518.weights' '-q' '0' '-e' '0.001'
[2022-05-19 11:38:49] [INFO ] Decomposing Gal with order
[2022-05-19 11:38:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 11:38:49] [INFO ] Removed a total of 648 redundant transitions.
[2022-05-19 11:38:49] [INFO ] Flatten gal took : 35 ms
[2022-05-19 11:38:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 8 ms.
[2022-05-19 11:38:49] [INFO ] Time to serialize gal into /tmp/LTL16773405081214349344.gal : 15 ms
[2022-05-19 11:38:49] [INFO ] Time to serialize properties into /tmp/LTL1798141328953295714.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16773405081214349344.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1798141328953295714.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1677340...246
Read 1 LTL properties
Checking formula 0 : !((X(G(X(X(G("(i1.i2.u15.p142==0)")))))))
Formula 0 simplified : !XGXXG"(i1.i2.u15.p142==0)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.12205e+36 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
64 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.707761,37592,1,0,39954,127,1862,101450,124,324,62926
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldIIPt-PT-030B-LTLCardinality-07 finished in 73762 ms.
FORMULA ShieldIIPt-PT-030B-LTLCardinality-07 FALSE TECHNIQUES SL_INSENSITIVE
[2022-05-19 11:38:50] [INFO ] Flatten gal took : 35 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 333529 ms.

BK_STOP 1652960330584

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-030B, 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 r222-tall-165286025000299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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