Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 20:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716952573150

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 03:16:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 03:16:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:16:15] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-29 03:16:15] [INFO ] Transformed 1403 places.
[2024-05-29 03:16:15] [INFO ] Transformed 1303 transitions.
[2024-05-29 03:16:15] [INFO ] Found NUPN structural information;
[2024-05-29 03:16:15] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 215 places :
Symmetric choice reduction at 0 with 215 rule applications. Total rules 215 place count 1188 transition count 1088
Iterating global reduction 0 with 215 rules applied. Total rules applied 430 place count 1188 transition count 1088
Applied a total of 430 rules in 293 ms. Remains 1188 /1403 variables (removed 215) and now considering 1088/1303 (removed 215) transitions.
// Phase 1: matrix 1088 rows 1188 cols
[2024-05-29 03:16:15] [INFO ] Computed 181 invariants in 20 ms
[2024-05-29 03:16:16] [INFO ] Implicit Places using invariants in 748 ms returned []
[2024-05-29 03:16:16] [INFO ] Invariant cache hit.
[2024-05-29 03:16:17] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
[2024-05-29 03:16:17] [INFO ] Invariant cache hit.
[2024-05-29 03:16:18] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1188/1403 places, 1088/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2704 ms. Remains : 1188/1403 places, 1088/1303 transitions.
Support contains 30 out of 1188 places after structural reductions.
[2024-05-29 03:16:18] [INFO ] Flatten gal took : 97 ms
[2024-05-29 03:16:18] [INFO ] Flatten gal took : 49 ms
[2024-05-29 03:16:18] [INFO ] Input system was already deterministic with 1088 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 03:16:19] [INFO ] Invariant cache hit.
[2024-05-29 03:16:19] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 03:16:19] [INFO ] [Nat]Absence check using 181 positive place invariants in 50 ms returned sat
[2024-05-29 03:16:20] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 03:16:20] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 6 ms to minimize.
[2024-05-29 03:16:21] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 2 ms to minimize.
[2024-05-29 03:16:21] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 2 ms to minimize.
[2024-05-29 03:16:21] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 1 ms to minimize.
[2024-05-29 03:16:21] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 0 ms to minimize.
[2024-05-29 03:16:22] [INFO ] Deduced a trap composed of 27 places in 201 ms of which 1 ms to minimize.
[2024-05-29 03:16:22] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 1 ms to minimize.
[2024-05-29 03:16:22] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 0 ms to minimize.
[2024-05-29 03:16:22] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 2 ms to minimize.
[2024-05-29 03:16:23] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 1 ms to minimize.
[2024-05-29 03:16:23] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 0 ms to minimize.
[2024-05-29 03:16:23] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 1 ms to minimize.
[2024-05-29 03:16:23] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 1 ms to minimize.
[2024-05-29 03:16:23] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 0 ms to minimize.
[2024-05-29 03:16:24] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 1 ms to minimize.
[2024-05-29 03:16:24] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 1 ms to minimize.
[2024-05-29 03:16:24] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2024-05-29 03:16:24] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 1 ms to minimize.
[2024-05-29 03:16:24] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 2 ms to minimize.
[2024-05-29 03:16:25] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 0 ms to minimize.
[2024-05-29 03:16:25] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 1 ms to minimize.
[2024-05-29 03:16:25] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 1 ms to minimize.
[2024-05-29 03:16:25] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 0 ms to minimize.
[2024-05-29 03:16:25] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2024-05-29 03:16:25] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 0 ms to minimize.
[2024-05-29 03:16:26] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 0 ms to minimize.
[2024-05-29 03:16:26] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 1 ms to minimize.
[2024-05-29 03:16:26] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5733 ms
[2024-05-29 03:16:26] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 1 ms to minimize.
[2024-05-29 03:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-05-29 03:16:26] [INFO ] After 6735ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 169 ms.
[2024-05-29 03:16:26] [INFO ] After 7291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 9 out of 1188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 1188 transition count 856
Reduce places removed 232 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 234 rules applied. Total rules applied 466 place count 956 transition count 854
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 468 place count 955 transition count 853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 469 place count 954 transition count 853
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 159 Pre rules applied. Total rules applied 469 place count 954 transition count 694
Deduced a syphon composed of 159 places in 2 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 4 with 318 rules applied. Total rules applied 787 place count 795 transition count 694
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 791 place count 791 transition count 690
Iterating global reduction 4 with 4 rules applied. Total rules applied 795 place count 791 transition count 690
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 795 place count 791 transition count 686
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 803 place count 787 transition count 686
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 1 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 4 with 670 rules applied. Total rules applied 1473 place count 452 transition count 351
Renaming transitions due to excessive name length > 1024 char.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1587 place count 395 transition count 387
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1588 place count 395 transition count 386
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1589 place count 395 transition count 385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1590 place count 394 transition count 385
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 1610 place count 394 transition count 385
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1611 place count 393 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1613 place count 391 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1613 place count 391 transition count 383
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1615 place count 390 transition count 383
Applied a total of 1615 rules in 240 ms. Remains 390 /1188 variables (removed 798) and now considering 383/1088 (removed 705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 390/1188 places, 383/1088 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 383 rows 390 cols
[2024-05-29 03:16:27] [INFO ] Computed 179 invariants in 5 ms
[2024-05-29 03:16:27] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:16:27] [INFO ] [Nat]Absence check using 179 positive place invariants in 25 ms returned sat
[2024-05-29 03:16:27] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 03:16:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:16:27] [INFO ] After 42ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 03:16:27] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-29 03:16:28] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 383/383 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 390 transition count 382
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 389 transition count 382
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 387 transition count 380
Applied a total of 6 rules in 27 ms. Remains 387 /390 variables (removed 3) and now considering 380/383 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 387/390 places, 380/383 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 257735 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257735 steps, saw 162653 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 380 rows 387 cols
[2024-05-29 03:16:31] [INFO ] Computed 179 invariants in 5 ms
[2024-05-29 03:16:31] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:16:31] [INFO ] [Nat]Absence check using 179 positive place invariants in 25 ms returned sat
[2024-05-29 03:16:31] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 03:16:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:16:31] [INFO ] After 42ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 03:16:31] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-29 03:16:31] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 54 ms.
Support contains 7 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 380/380 transitions.
Applied a total of 0 rules in 12 ms. Remains 387 /387 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 387/387 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 380/380 transitions.
Applied a total of 0 rules in 12 ms. Remains 387 /387 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2024-05-29 03:16:31] [INFO ] Invariant cache hit.
[2024-05-29 03:16:32] [INFO ] Implicit Places using invariants in 239 ms returned [376]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 242 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 386/387 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 385 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 385 transition count 379
Applied a total of 2 rules in 42 ms. Remains 385 /386 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 385 cols
[2024-05-29 03:16:32] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:16:32] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-29 03:16:32] [INFO ] Invariant cache hit.
[2024-05-29 03:16:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 03:16:32] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 385/387 places, 379/380 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 944 ms. Remains : 385/387 places, 379/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:16:33] [INFO ] Invariant cache hit.
[2024-05-29 03:16:33] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:16:33] [INFO ] [Nat]Absence check using 178 positive place invariants in 20 ms returned sat
[2024-05-29 03:16:33] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:16:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 03:16:33] [INFO ] After 28ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:16:33] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 03:16:33] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 379/379 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 385 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 384 transition count 378
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 384 transition count 377
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 383 transition count 377
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 381 transition count 375
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 380 transition count 376
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 378 transition count 374
Applied a total of 12 rules in 28 ms. Remains 378 /385 variables (removed 7) and now considering 374/379 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 378/385 places, 374/379 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 378 cols
[2024-05-29 03:16:33] [INFO ] Computed 178 invariants in 3 ms
[2024-05-29 03:16:33] [INFO ] [Real]Absence check using 178 positive place invariants in 22 ms returned sat
[2024-05-29 03:16:33] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:16:34] [INFO ] [Nat]Absence check using 178 positive place invariants in 26 ms returned sat
[2024-05-29 03:16:34] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:16:34] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-29 03:16:34] [INFO ] After 278ms 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 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 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 378 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 377 transition count 373
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 376 transition count 373
Applied a total of 4 rules in 19 ms. Remains 376 /378 variables (removed 2) and now considering 373/374 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 376/378 places, 373/374 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 530385 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 530385 steps, saw 342209 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 376 cols
[2024-05-29 03:16:37] [INFO ] Computed 178 invariants in 3 ms
[2024-05-29 03:16:37] [INFO ] [Real]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-29 03:16:37] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:16:37] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-29 03:16:37] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:16:37] [INFO ] After 166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-29 03:16:37] [INFO ] After 272ms 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 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 373/373 transitions.
Applied a total of 0 rules in 7 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 376/376 places, 373/373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 373/373 transitions.
Applied a total of 0 rules in 6 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2024-05-29 03:16:37] [INFO ] Invariant cache hit.
[2024-05-29 03:16:38] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-29 03:16:38] [INFO ] Invariant cache hit.
[2024-05-29 03:16:38] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2024-05-29 03:16:38] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-29 03:16:38] [INFO ] Invariant cache hit.
[2024-05-29 03:16:38] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 886 ms. Remains : 376/376 places, 373/373 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 376 transition count 373
Applied a total of 39 rules in 12 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 376 cols
[2024-05-29 03:16:38] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:16:38] [INFO ] [Real]Absence check using 178 positive place invariants in 24 ms returned sat
[2024-05-29 03:16:38] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:16:39] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-29 03:16:39] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:16:39] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 03:16:39] [INFO ] After 42ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:16:39] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-29 03:16:39] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 320 stabilizing places and 320 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1183 transition count 1083
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1182 transition count 1082
Applied a total of 12 rules in 101 ms. Remains 1182 /1188 variables (removed 6) and now considering 1082/1088 (removed 6) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-29 03:16:39] [INFO ] Computed 181 invariants in 11 ms
[2024-05-29 03:16:39] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-29 03:16:39] [INFO ] Invariant cache hit.
[2024-05-29 03:16:41] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
[2024-05-29 03:16:41] [INFO ] Invariant cache hit.
[2024-05-29 03:16:41] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1188 places, 1082/1088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2072 ms. Remains : 1182/1188 places, 1082/1088 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s288 0) (EQ s703 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 9 reset in 527 ms.
Stack based approach found an accepted trace after 2596 steps with 0 reset with depth 2597 and stack size 2597 in 15 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-00 finished in 2872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1182 transition count 1082
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1181 transition count 1081
Applied a total of 14 rules in 82 ms. Remains 1181 /1188 variables (removed 7) and now considering 1081/1088 (removed 7) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2024-05-29 03:16:42] [INFO ] Computed 181 invariants in 4 ms
[2024-05-29 03:16:42] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-29 03:16:42] [INFO ] Invariant cache hit.
[2024-05-29 03:16:43] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
[2024-05-29 03:16:43] [INFO ] Invariant cache hit.
[2024-05-29 03:16:44] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1188 places, 1081/1088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2092 ms. Remains : 1181/1188 places, 1081/1088 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s649 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 23 reset in 409 ms.
Stack based approach found an accepted trace after 1791 steps with 0 reset with depth 1792 and stack size 1792 in 20 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-01 finished in 2650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1187 transition count 849
Reduce places removed 238 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 478 place count 949 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 948 transition count 847
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 479 place count 948 transition count 688
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 797 place count 789 transition count 688
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 802 place count 784 transition count 683
Iterating global reduction 3 with 5 rules applied. Total rules applied 807 place count 784 transition count 683
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 807 place count 784 transition count 678
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 817 place count 779 transition count 678
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1491 place count 442 transition count 341
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1609 place count 383 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1611 place count 381 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1613 place count 379 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1613 place count 379 transition count 377
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 1615 place count 378 transition count 377
Applied a total of 1615 rules in 119 ms. Remains 378 /1188 variables (removed 810) and now considering 377/1088 (removed 711) transitions.
// Phase 1: matrix 377 rows 378 cols
[2024-05-29 03:16:45] [INFO ] Computed 179 invariants in 3 ms
[2024-05-29 03:16:45] [INFO ] Implicit Places using invariants in 263 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 267 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 377/1188 places, 377/1088 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 376 transition count 376
Applied a total of 2 rules in 16 ms. Remains 376 /377 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 376 cols
[2024-05-29 03:16:45] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:16:45] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-29 03:16:45] [INFO ] Invariant cache hit.
[2024-05-29 03:16:46] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 376/1188 places, 376/1088 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 996 ms. Remains : 376/1188 places, 376/1088 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s200 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-02 finished in 1045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(G(p0))&&F(p1))))))'
Support contains 4 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1182 transition count 1082
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1181 transition count 1081
Applied a total of 14 rules in 105 ms. Remains 1181 /1188 variables (removed 7) and now considering 1081/1088 (removed 7) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2024-05-29 03:16:46] [INFO ] Computed 181 invariants in 7 ms
[2024-05-29 03:16:46] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-29 03:16:46] [INFO ] Invariant cache hit.
[2024-05-29 03:16:47] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
[2024-05-29 03:16:47] [INFO ] Invariant cache hit.
[2024-05-29 03:16:48] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1188 places, 1081/1088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2050 ms. Remains : 1181/1188 places, 1081/1088 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s669 0) (EQ s1097 1)) (EQ s350 0)), p0:(EQ s622 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 553 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(AND p1 p0), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 203771 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203771 steps, saw 105343 distinct states, run finished after 3002 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 03:16:52] [INFO ] Invariant cache hit.
[2024-05-29 03:16:52] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:16:53] [INFO ] [Nat]Absence check using 181 positive place invariants in 52 ms returned sat
[2024-05-29 03:16:53] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 03:16:54] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 0 ms to minimize.
[2024-05-29 03:16:54] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 1 ms to minimize.
[2024-05-29 03:16:54] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2024-05-29 03:16:54] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 1 ms to minimize.
[2024-05-29 03:16:54] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2024-05-29 03:16:55] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2024-05-29 03:16:55] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2024-05-29 03:16:55] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2024-05-29 03:16:55] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 1 ms to minimize.
[2024-05-29 03:16:55] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 1 ms to minimize.
[2024-05-29 03:16:56] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 0 ms to minimize.
[2024-05-29 03:16:56] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 1 ms to minimize.
[2024-05-29 03:16:56] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
[2024-05-29 03:16:56] [INFO ] Deduced a trap composed of 23 places in 163 ms of which 1 ms to minimize.
[2024-05-29 03:16:56] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
[2024-05-29 03:16:57] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 1 ms to minimize.
[2024-05-29 03:16:57] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2024-05-29 03:16:57] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 0 ms to minimize.
[2024-05-29 03:16:57] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2024-05-29 03:16:57] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 0 ms to minimize.
[2024-05-29 03:16:58] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 4 ms to minimize.
[2024-05-29 03:16:58] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 1 ms to minimize.
[2024-05-29 03:16:58] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2024-05-29 03:16:58] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2024-05-29 03:16:58] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2024-05-29 03:16:58] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 0 ms to minimize.
[2024-05-29 03:16:58] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2024-05-29 03:16:59] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 0 ms to minimize.
[2024-05-29 03:16:59] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 1 ms to minimize.
[2024-05-29 03:16:59] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 0 ms to minimize.
[2024-05-29 03:16:59] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 4 ms to minimize.
[2024-05-29 03:16:59] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2024-05-29 03:16:59] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 3 ms to minimize.
[2024-05-29 03:16:59] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-29 03:17:00] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-05-29 03:17:00] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2024-05-29 03:17:00] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2024-05-29 03:17:00] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-29 03:17:00] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 0 ms to minimize.
[2024-05-29 03:17:00] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 0 ms to minimize.
[2024-05-29 03:17:00] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 6829 ms
[2024-05-29 03:17:00] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 03:17:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-05-29 03:17:00] [INFO ] After 7674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 119 ms.
[2024-05-29 03:17:01] [INFO ] After 8099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 4 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1181 transition count 844
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 475 place count 944 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 476 place count 943 transition count 843
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 476 place count 943 transition count 684
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 794 place count 784 transition count 684
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 1 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 3 with 674 rules applied. Total rules applied 1468 place count 447 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1469 place count 447 transition count 346
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 1471 place count 446 transition count 345
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1587 place count 388 transition count 383
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1588 place count 388 transition count 382
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1608 place count 388 transition count 382
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1609 place count 387 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1611 place count 385 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1611 place count 385 transition count 380
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1613 place count 384 transition count 380
Applied a total of 1613 rules in 85 ms. Remains 384 /1181 variables (removed 797) and now considering 380/1081 (removed 701) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 384/1181 places, 380/1081 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 380 rows 384 cols
[2024-05-29 03:17:01] [INFO ] Computed 179 invariants in 4 ms
[2024-05-29 03:17:01] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:17:01] [INFO ] [Nat]Absence check using 179 positive place invariants in 26 ms returned sat
[2024-05-29 03:17:01] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 03:17:01] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:01] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-29 03:17:01] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 6 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 384/384 places, 380/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:17:02] [INFO ] Invariant cache hit.
[2024-05-29 03:17:02] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:17:02] [INFO ] [Nat]Absence check using 179 positive place invariants in 26 ms returned sat
[2024-05-29 03:17:02] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:17:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 03:17:02] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:17:02] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-29 03:17:02] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 8 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 384/384 places, 380/380 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 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 530910 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :{}
Probabilistic random walk after 530910 steps, saw 340668 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:17:05] [INFO ] Invariant cache hit.
[2024-05-29 03:17:05] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:17:05] [INFO ] [Nat]Absence check using 179 positive place invariants in 23 ms returned sat
[2024-05-29 03:17:05] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:17:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 03:17:05] [INFO ] After 14ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:17:05] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-29 03:17:05] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 384/384 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 380/380 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2024-05-29 03:17:05] [INFO ] Invariant cache hit.
[2024-05-29 03:17:06] [INFO ] Implicit Places using invariants in 225 ms returned [373]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 227 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 383/384 places, 380/380 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 382 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 382 transition count 379
Applied a total of 2 rules in 9 ms. Remains 382 /383 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 382 cols
[2024-05-29 03:17:06] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:17:06] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-29 03:17:06] [INFO ] Invariant cache hit.
[2024-05-29 03:17:06] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 382/384 places, 379/380 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 883 ms. Remains : 382/384 places, 379/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 487391 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 487391 steps, saw 312193 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:17:09] [INFO ] Invariant cache hit.
[2024-05-29 03:17:10] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:17:10] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-29 03:17:10] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:17:10] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-29 03:17:10] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 379/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 382/382 places, 379/379 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 379/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2024-05-29 03:17:10] [INFO ] Invariant cache hit.
[2024-05-29 03:17:10] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-29 03:17:10] [INFO ] Invariant cache hit.
[2024-05-29 03:17:10] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-05-29 03:17:10] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 03:17:10] [INFO ] Invariant cache hit.
[2024-05-29 03:17:11] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 838 ms. Remains : 382/382 places, 379/379 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 382 transition count 379
Applied a total of 40 rules in 33 ms. Remains 382 /382 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 379 rows 382 cols
[2024-05-29 03:17:11] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:17:11] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:17:11] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-29 03:17:11] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:17:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-29 03:17:11] [INFO ] After 25ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:17:11] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-29 03:17:11] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p1)]
Support contains 4 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1181/1181 places, 1081/1081 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1180 transition count 843
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 475 place count 943 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 476 place count 942 transition count 842
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 476 place count 942 transition count 683
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 794 place count 783 transition count 683
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 335
Deduced a syphon composed of 335 places in 1 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 3 with 670 rules applied. Total rules applied 1464 place count 448 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1465 place count 448 transition count 347
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 1467 place count 447 transition count 346
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1583 place count 389 transition count 384
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1585 place count 387 transition count 382
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1587 place count 385 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1587 place count 385 transition count 381
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 1589 place count 384 transition count 381
Applied a total of 1589 rules in 84 ms. Remains 384 /1181 variables (removed 797) and now considering 381/1081 (removed 700) transitions.
// Phase 1: matrix 381 rows 384 cols
[2024-05-29 03:17:11] [INFO ] Computed 179 invariants in 2 ms
[2024-05-29 03:17:12] [INFO ] Implicit Places using invariants in 234 ms returned [373]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 238 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/1181 places, 381/1081 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 382 transition count 380
Applied a total of 2 rules in 8 ms. Remains 382 /383 variables (removed 1) and now considering 380/381 (removed 1) transitions.
// Phase 1: matrix 380 rows 382 cols
[2024-05-29 03:17:12] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:17:12] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-29 03:17:12] [INFO ] Invariant cache hit.
[2024-05-29 03:17:12] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 382/1181 places, 380/1081 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 952 ms. Remains : 382/1181 places, 380/1081 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:17:13] [INFO ] Invariant cache hit.
[2024-05-29 03:17:13] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:17:13] [INFO ] [Nat]Absence check using 178 positive place invariants in 24 ms returned sat
[2024-05-29 03:17:13] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:17:13] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-29 03:17:13] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 380/380 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 382 transition count 379
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 382 transition count 379
Applied a total of 2 rules in 21 ms. Remains 382 /382 variables (removed 0) and now considering 379/380 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 382/382 places, 379/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 518710 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518710 steps, saw 343167 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 379 rows 382 cols
[2024-05-29 03:17:16] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:17:16] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:17:16] [INFO ] [Nat]Absence check using 178 positive place invariants in 26 ms returned sat
[2024-05-29 03:17:17] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:17:17] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-29 03:17:17] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 146 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p1)]
Stuttering criterion allowed to conclude after 12417 steps with 0 reset in 77 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-04 finished in 31486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 1187 transition count 853
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 236 rules applied. Total rules applied 470 place count 953 transition count 851
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 471 place count 952 transition count 851
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 160 Pre rules applied. Total rules applied 471 place count 952 transition count 691
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 3 with 320 rules applied. Total rules applied 791 place count 792 transition count 691
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 795 place count 788 transition count 687
Iterating global reduction 3 with 4 rules applied. Total rules applied 799 place count 788 transition count 687
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 799 place count 788 transition count 683
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 807 place count 784 transition count 683
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 1475 place count 450 transition count 349
Renaming transitions due to excessive name length > 1024 char.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1591 place count 392 transition count 385
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1593 place count 390 transition count 383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1595 place count 388 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1595 place count 388 transition count 382
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1597 place count 387 transition count 382
Applied a total of 1597 rules in 94 ms. Remains 387 /1188 variables (removed 801) and now considering 382/1088 (removed 706) transitions.
// Phase 1: matrix 382 rows 387 cols
[2024-05-29 03:17:17] [INFO ] Computed 179 invariants in 3 ms
[2024-05-29 03:17:17] [INFO ] Implicit Places using invariants in 215 ms returned [376]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 216 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 386/1188 places, 382/1088 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 385 transition count 381
Applied a total of 2 rules in 10 ms. Remains 385 /386 variables (removed 1) and now considering 381/382 (removed 1) transitions.
// Phase 1: matrix 381 rows 385 cols
[2024-05-29 03:17:17] [INFO ] Computed 178 invariants in 3 ms
[2024-05-29 03:17:18] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-29 03:17:18] [INFO ] Invariant cache hit.
[2024-05-29 03:17:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:17:18] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 385/1188 places, 381/1088 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 957 ms. Remains : 385/1188 places, 381/1088 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s249 0) (EQ s294 1)), p0:(OR (EQ s155 0) (EQ s274 1) (AND (EQ s353 0) (EQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 484 ms.
Product exploration explored 100000 steps with 0 reset in 581 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 351455 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 351455 steps, saw 220813 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:17:23] [INFO ] Invariant cache hit.
[2024-05-29 03:17:23] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:17:23] [INFO ] [Nat]Absence check using 178 positive place invariants in 27 ms returned sat
[2024-05-29 03:17:23] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:17:23] [INFO ] After 38ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:23] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-29 03:17:23] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 381/381 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 385 transition count 380
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 385 transition count 380
Applied a total of 3 rules in 14 ms. Remains 385 /385 variables (removed 0) and now considering 380/381 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 385/385 places, 380/381 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 354476 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 354476 steps, saw 228083 distinct states, run finished after 3002 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 380 rows 385 cols
[2024-05-29 03:17:26] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:17:26] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:17:26] [INFO ] [Nat]Absence check using 178 positive place invariants in 27 ms returned sat
[2024-05-29 03:17:27] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:17:27] [INFO ] After 32ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:27] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 03:17:27] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 380/380 transitions.
Applied a total of 0 rules in 12 ms. Remains 385 /385 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 385/385 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 380/380 transitions.
Applied a total of 0 rules in 7 ms. Remains 385 /385 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2024-05-29 03:17:27] [INFO ] Invariant cache hit.
[2024-05-29 03:17:27] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-29 03:17:27] [INFO ] Invariant cache hit.
[2024-05-29 03:17:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:17:27] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2024-05-29 03:17:27] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 03:17:27] [INFO ] Invariant cache hit.
[2024-05-29 03:17:28] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 923 ms. Remains : 385/385 places, 380/380 transitions.
Partial Free-agglomeration rule applied 44 times.
Drop transitions removed 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 385 transition count 380
Applied a total of 44 rules in 9 ms. Remains 385 /385 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 380 rows 385 cols
[2024-05-29 03:17:28] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:17:28] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:17:28] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-29 03:17:28] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:17:28] [INFO ] After 42ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:28] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:17:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-29 03:17:28] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-29 03:17:28] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 385 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 385/385 places, 381/381 transitions.
Applied a total of 0 rules in 6 ms. Remains 385 /385 variables (removed 0) and now considering 381/381 (removed 0) transitions.
// Phase 1: matrix 381 rows 385 cols
[2024-05-29 03:17:28] [INFO ] Computed 178 invariants in 3 ms
[2024-05-29 03:17:29] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-29 03:17:29] [INFO ] Invariant cache hit.
[2024-05-29 03:17:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:17:29] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-29 03:17:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 03:17:29] [INFO ] Invariant cache hit.
[2024-05-29 03:17:29] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 883 ms. Remains : 385/385 places, 381/381 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 316131 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316131 steps, saw 197711 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:17:33] [INFO ] Invariant cache hit.
[2024-05-29 03:17:33] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:17:33] [INFO ] [Nat]Absence check using 178 positive place invariants in 24 ms returned sat
[2024-05-29 03:17:33] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:17:33] [INFO ] After 35ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:33] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-29 03:17:33] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 381/381 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 385 transition count 380
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 385 transition count 380
Applied a total of 3 rules in 10 ms. Remains 385 /385 variables (removed 0) and now considering 380/381 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 385/385 places, 380/381 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 338206 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 338206 steps, saw 217528 distinct states, run finished after 3002 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 380 rows 385 cols
[2024-05-29 03:17:36] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:17:36] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:17:37] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-29 03:17:37] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:17:37] [INFO ] After 33ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:37] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-29 03:17:37] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 380/380 transitions.
Applied a total of 0 rules in 6 ms. Remains 385 /385 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 385/385 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 380/380 transitions.
Applied a total of 0 rules in 5 ms. Remains 385 /385 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2024-05-29 03:17:37] [INFO ] Invariant cache hit.
[2024-05-29 03:17:37] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-29 03:17:37] [INFO ] Invariant cache hit.
[2024-05-29 03:17:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:17:38] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-29 03:17:38] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 03:17:38] [INFO ] Invariant cache hit.
[2024-05-29 03:17:38] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 912 ms. Remains : 385/385 places, 380/380 transitions.
Partial Free-agglomeration rule applied 44 times.
Drop transitions removed 44 transitions
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 385 transition count 380
Applied a total of 44 rules in 10 ms. Remains 385 /385 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 380 rows 385 cols
[2024-05-29 03:17:38] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:17:38] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:17:38] [INFO ] [Nat]Absence check using 178 positive place invariants in 31 ms returned sat
[2024-05-29 03:17:38] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:38] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:17:38] [INFO ] After 32ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:17:38] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:17:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-29 03:17:38] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-29 03:17:38] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 413 ms.
Product exploration explored 100000 steps with 0 reset in 570 ms.
Built C files in :
/tmp/ltsmin3132331794663405659
[2024-05-29 03:17:40] [INFO ] Computing symmetric may disable matrix : 381 transitions.
[2024-05-29 03:17:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:17:40] [INFO ] Computing symmetric may enable matrix : 381 transitions.
[2024-05-29 03:17:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:17:40] [INFO ] Computing Do-Not-Accords matrix : 381 transitions.
[2024-05-29 03:17:40] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:17:40] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3132331794663405659
Running compilation step : cd /tmp/ltsmin3132331794663405659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1003 ms.
Running link step : cd /tmp/ltsmin3132331794663405659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3132331794663405659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3896184666240117704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 385 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 385/385 places, 381/381 transitions.
Applied a total of 0 rules in 9 ms. Remains 385 /385 variables (removed 0) and now considering 381/381 (removed 0) transitions.
// Phase 1: matrix 381 rows 385 cols
[2024-05-29 03:17:55] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:17:55] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-29 03:17:55] [INFO ] Invariant cache hit.
[2024-05-29 03:17:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 03:17:55] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-29 03:17:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 03:17:55] [INFO ] Invariant cache hit.
[2024-05-29 03:17:56] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 853 ms. Remains : 385/385 places, 381/381 transitions.
Built C files in :
/tmp/ltsmin5807690956994546768
[2024-05-29 03:17:56] [INFO ] Computing symmetric may disable matrix : 381 transitions.
[2024-05-29 03:17:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:17:56] [INFO ] Computing symmetric may enable matrix : 381 transitions.
[2024-05-29 03:17:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:17:56] [INFO ] Computing Do-Not-Accords matrix : 381 transitions.
[2024-05-29 03:17:56] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:17:56] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5807690956994546768
Running compilation step : cd /tmp/ltsmin5807690956994546768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 795 ms.
Running link step : cd /tmp/ltsmin5807690956994546768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5807690956994546768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11986818171724344659.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:18:11] [INFO ] Flatten gal took : 22 ms
[2024-05-29 03:18:11] [INFO ] Flatten gal took : 22 ms
[2024-05-29 03:18:11] [INFO ] Time to serialize gal into /tmp/LTL8344905382174990271.gal : 6 ms
[2024-05-29 03:18:11] [INFO ] Time to serialize properties into /tmp/LTL8026776698366157492.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8344905382174990271.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11354072104671130220.hoa' '-atoms' '/tmp/LTL8026776698366157492.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8026776698366157492.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11354072104671130220.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t21, t22, t24...927
Computing Next relation with stutter on 1.06153e+24 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
739 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,7.44951,242368,1,0,850,1.25306e+06,801,393,13625,1.77812e+06,1007
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-05 finished in 63197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(F(p0))&&(G(p1) U G(p2))))))'
Support contains 4 out of 1188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 1187 transition count 853
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 236 rules applied. Total rules applied 470 place count 953 transition count 851
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 473 place count 952 transition count 849
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 475 place count 950 transition count 849
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 160 Pre rules applied. Total rules applied 475 place count 950 transition count 689
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 4 with 320 rules applied. Total rules applied 795 place count 790 transition count 689
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 799 place count 786 transition count 685
Iterating global reduction 4 with 4 rules applied. Total rules applied 803 place count 786 transition count 685
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 803 place count 786 transition count 681
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 811 place count 782 transition count 681
Performed 332 Post agglomeration using F-continuation condition.Transition count delta: 332
Deduced a syphon composed of 332 places in 0 ms
Reduce places removed 332 places and 0 transitions.
Iterating global reduction 4 with 664 rules applied. Total rules applied 1475 place count 450 transition count 349
Renaming transitions due to excessive name length > 1024 char.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1591 place count 392 transition count 386
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1593 place count 390 transition count 384
Applied a total of 1593 rules in 89 ms. Remains 390 /1188 variables (removed 798) and now considering 384/1088 (removed 704) transitions.
// Phase 1: matrix 384 rows 390 cols
[2024-05-29 03:18:20] [INFO ] Computed 181 invariants in 3 ms
[2024-05-29 03:18:21] [INFO ] Implicit Places using invariants in 252 ms returned [381, 382]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 256 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 388/1188 places, 384/1088 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 388 transition count 383
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 387 transition count 383
Applied a total of 2 rules in 7 ms. Remains 387 /388 variables (removed 1) and now considering 383/384 (removed 1) transitions.
// Phase 1: matrix 383 rows 387 cols
[2024-05-29 03:18:21] [INFO ] Computed 179 invariants in 2 ms
[2024-05-29 03:18:21] [INFO ] Implicit Places using invariants in 223 ms returned [375]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 225 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 386/1188 places, 383/1088 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 385 transition count 382
Applied a total of 2 rules in 15 ms. Remains 385 /386 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 385 cols
[2024-05-29 03:18:21] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:18:21] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-05-29 03:18:21] [INFO ] Invariant cache hit.
[2024-05-29 03:18:21] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-29 03:18:21] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 385/1188 places, 382/1088 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1232 ms. Remains : 385/1188 places, 382/1088 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s91 0) (EQ s15 1)), p0:(OR (EQ s234 0) (EQ s285 1))], nbAcceptance=2, 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 6 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-06 finished in 1381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(G(p1))))))'
Support contains 3 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1182 transition count 1082
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1181 transition count 1081
Applied a total of 14 rules in 101 ms. Remains 1181 /1188 variables (removed 7) and now considering 1081/1088 (removed 7) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2024-05-29 03:18:22] [INFO ] Computed 181 invariants in 4 ms
[2024-05-29 03:18:22] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-29 03:18:22] [INFO ] Invariant cache hit.
[2024-05-29 03:18:23] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
[2024-05-29 03:18:23] [INFO ] Invariant cache hit.
[2024-05-29 03:18:24] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1188 places, 1081/1088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1919 ms. Remains : 1181/1188 places, 1081/1088 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s83 0) (EQ s322 1)), p1:(EQ s58 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 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-07 finished in 2083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(!p1)))'
Support contains 3 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1182 transition count 1082
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1181 transition count 1081
Applied a total of 14 rules in 82 ms. Remains 1181 /1188 variables (removed 7) and now considering 1081/1088 (removed 7) transitions.
[2024-05-29 03:18:24] [INFO ] Invariant cache hit.
[2024-05-29 03:18:24] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-29 03:18:24] [INFO ] Invariant cache hit.
[2024-05-29 03:18:25] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2024-05-29 03:18:25] [INFO ] Invariant cache hit.
[2024-05-29 03:18:26] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1188 places, 1081/1088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1930 ms. Remains : 1181/1188 places, 1081/1088 transitions.
Stuttering acceptance computed with spot in 164 ms :[p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s264 0) (EQ s292 1)), p1:(OR (EQ s671 0) (EQ s264 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 37722 steps with 0 reset in 164 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-10 finished in 2283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1187 transition count 850
Reduce places removed 237 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 476 place count 950 transition count 848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 477 place count 949 transition count 848
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 477 place count 949 transition count 689
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 795 place count 790 transition count 689
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 799 place count 786 transition count 685
Iterating global reduction 3 with 4 rules applied. Total rules applied 803 place count 786 transition count 685
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 803 place count 786 transition count 681
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 811 place count 782 transition count 681
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 1487 place count 444 transition count 343
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1605 place count 385 transition count 382
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1607 place count 383 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1608 place count 382 transition count 380
Applied a total of 1608 rules in 80 ms. Remains 382 /1188 variables (removed 806) and now considering 380/1088 (removed 708) transitions.
// Phase 1: matrix 380 rows 382 cols
[2024-05-29 03:18:26] [INFO ] Computed 180 invariants in 1 ms
[2024-05-29 03:18:26] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-29 03:18:26] [INFO ] Invariant cache hit.
[2024-05-29 03:18:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:18:27] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-05-29 03:18:27] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 03:18:27] [INFO ] Invariant cache hit.
[2024-05-29 03:18:27] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 382/1188 places, 380/1088 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 913 ms. Remains : 382/1188 places, 380/1088 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s375 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-12 finished in 1014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 1188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1188/1188 places, 1088/1088 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1183 transition count 1083
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1182 transition count 1082
Applied a total of 12 rules in 87 ms. Remains 1182 /1188 variables (removed 6) and now considering 1082/1088 (removed 6) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-29 03:18:27] [INFO ] Computed 181 invariants in 9 ms
[2024-05-29 03:18:27] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-29 03:18:27] [INFO ] Invariant cache hit.
[2024-05-29 03:18:28] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2024-05-29 03:18:28] [INFO ] Invariant cache hit.
[2024-05-29 03:18:29] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1188 places, 1082/1088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2037 ms. Remains : 1182/1188 places, 1082/1088 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s980 0) (EQ s138 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4003 steps with 0 reset in 22 ms.
FORMULA ShieldIIPt-PT-020B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLCardinality-13 finished in 2177 ms.
All properties solved by simple procedures.
Total runtime 134889 ms.

BK_STOP 1716952710688

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-020B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-020B, 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 r373-tall-171683788700177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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