Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.2K Apr 29 13:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 13:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 13:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 268K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653028189669

Running Version 202205111006
[2022-05-20 06:29:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 06:29:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 06:29:51] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2022-05-20 06:29:51] [INFO ] Transformed 1003 places.
[2022-05-20 06:29:51] [INFO ] Transformed 723 transitions.
[2022-05-20 06:29:51] [INFO ] Found NUPN structural information;
[2022-05-20 06:29:51] [INFO ] Parsed PT model containing 1003 places and 723 transitions in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 99 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:29:51] [INFO ] Computed 441 place invariants in 27 ms
[2022-05-20 06:29:52] [INFO ] Implicit Places using invariants in 715 ms returned []
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:29:52] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:29:53] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:29:53] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-20 06:29:53] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 722/722 transitions.
Support contains 35 out of 1003 places after structural reductions.
[2022-05-20 06:29:53] [INFO ] Flatten gal took : 147 ms
[2022-05-20 06:29:54] [INFO ] Flatten gal took : 79 ms
[2022-05-20 06:29:54] [INFO ] Input system was already deterministic with 722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 22) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:29:55] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-20 06:29:56] [INFO ] [Real]Absence check using 441 positive place invariants in 63 ms returned sat
[2022-05-20 06:29:57] [INFO ] After 1428ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2022-05-20 06:29:57] [INFO ] [Nat]Absence check using 441 positive place invariants in 67 ms returned sat
[2022-05-20 06:29:58] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2022-05-20 06:29:59] [INFO ] After 1610ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 722 ms.
[2022-05-20 06:30:00] [INFO ] After 2934ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 742 ms.
Support contains 16 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 720
Partial Free-agglomeration rule applied 151 times.
Drop transitions removed 151 transitions
Iterating global reduction 0 with 151 rules applied. Total rules applied 155 place count 1001 transition count 720
Applied a total of 155 rules in 193 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/722 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/1003 places, 720/722 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 720 rows 1001 cols
[2022-05-20 06:30:02] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-20 06:30:02] [INFO ] [Real]Absence check using 441 positive place invariants in 68 ms returned sat
[2022-05-20 06:30:03] [INFO ] After 1220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 06:30:03] [INFO ] [Nat]Absence check using 441 positive place invariants in 65 ms returned sat
[2022-05-20 06:30:04] [INFO ] After 799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 06:30:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-20 06:30:05] [INFO ] After 714ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-20 06:30:05] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2022-05-20 06:30:05] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2022-05-20 06:30:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2022-05-20 06:30:05] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2022-05-20 06:30:05] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-20 06:30:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2022-05-20 06:30:06] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-05-20 06:30:06] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2022-05-20 06:30:06] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2022-05-20 06:30:06] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2022-05-20 06:30:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 433 ms
[2022-05-20 06:30:06] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-05-20 06:30:06] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2022-05-20 06:30:07] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2022-05-20 06:30:07] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2022-05-20 06:30:07] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2022-05-20 06:30:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 518 ms
[2022-05-20 06:30:07] [INFO ] After 2679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 452 ms.
[2022-05-20 06:30:07] [INFO ] After 4399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 411 ms.
Support contains 14 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Applied a total of 0 rules in 65 ms. Remains 1001 /1001 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1001/1001 places, 720/720 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 131835 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1, 6=1, 7=1}
Probabilistic random walk after 131835 steps, saw 127924 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :7
Running SMT prover for 2 properties.
// Phase 1: matrix 720 rows 1001 cols
[2022-05-20 06:30:12] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:30:12] [INFO ] [Real]Absence check using 441 positive place invariants in 65 ms returned sat
[2022-05-20 06:30:12] [INFO ] After 611ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 06:30:13] [INFO ] [Nat]Absence check using 441 positive place invariants in 74 ms returned sat
[2022-05-20 06:30:13] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 06:30:13] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-20 06:30:13] [INFO ] After 107ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 06:30:13] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2022-05-20 06:30:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-20 06:30:13] [INFO ] After 415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-05-20 06:30:14] [INFO ] After 1136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 13 ms.
Support contains 2 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1001/1001 places, 720/720 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1001 transition count 720
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 1000 transition count 719
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 999 transition count 719
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 10 place count 999 transition count 717
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 997 transition count 717
Applied a total of 14 rules in 118 ms. Remains 997 /1001 variables (removed 4) and now considering 717/720 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 997/1001 places, 717/720 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 311615 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311615 steps, saw 299899 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 717 rows 997 cols
[2022-05-20 06:30:17] [INFO ] Computed 440 place invariants in 11 ms
[2022-05-20 06:30:17] [INFO ] [Real]Absence check using 440 positive place invariants in 60 ms returned sat
[2022-05-20 06:30:17] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:30:18] [INFO ] [Nat]Absence check using 440 positive place invariants in 64 ms returned sat
[2022-05-20 06:30:18] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:30:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-20 06:30:18] [INFO ] After 88ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:30:18] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-20 06:30:18] [INFO ] After 744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 997 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 997/997 places, 717/717 transitions.
Applied a total of 0 rules in 24 ms. Remains 997 /997 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 997/997 places, 717/717 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 997/997 places, 717/717 transitions.
Applied a total of 0 rules in 24 ms. Remains 997 /997 variables (removed 0) and now considering 717/717 (removed 0) transitions.
// Phase 1: matrix 717 rows 997 cols
[2022-05-20 06:30:18] [INFO ] Computed 440 place invariants in 2 ms
[2022-05-20 06:30:19] [INFO ] Implicit Places using invariants in 524 ms returned [980, 984]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 539 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 995/997 places, 717/717 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 993 transition count 715
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 993 transition count 715
Applied a total of 4 rules in 64 ms. Remains 993 /995 variables (removed 2) and now considering 715/717 (removed 2) transitions.
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:19] [INFO ] Computed 438 place invariants in 7 ms
[2022-05-20 06:30:19] [INFO ] Implicit Places using invariants in 482 ms returned []
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:19] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:30:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-20 06:30:20] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 993/997 places, 715/717 transitions.
Finished structural reductions, in 2 iterations. Remains : 993/997 places, 715/717 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 310993 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 310993 steps, saw 300368 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:24] [INFO ] Computed 438 place invariants in 11 ms
[2022-05-20 06:30:24] [INFO ] [Real]Absence check using 438 positive place invariants in 57 ms returned sat
[2022-05-20 06:30:24] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:30:24] [INFO ] [Nat]Absence check using 438 positive place invariants in 61 ms returned sat
[2022-05-20 06:30:25] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:30:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-20 06:30:25] [INFO ] After 56ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:30:25] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-05-20 06:30:25] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 993 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 993/993 places, 715/715 transitions.
Applied a total of 0 rules in 30 ms. Remains 993 /993 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 993/993 places, 715/715 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 993/993 places, 715/715 transitions.
Applied a total of 0 rules in 27 ms. Remains 993 /993 variables (removed 0) and now considering 715/715 (removed 0) transitions.
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:25] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:30:25] [INFO ] Implicit Places using invariants in 441 ms returned []
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:25] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:30:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-20 06:30:27] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
[2022-05-20 06:30:27] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:27] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:30:27] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 993/993 places, 715/715 transitions.
Applied a total of 0 rules in 29 ms. Remains 993 /993 variables (removed 0) and now considering 715/715 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:27] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:30:27] [INFO ] [Real]Absence check using 438 positive place invariants in 51 ms returned sat
[2022-05-20 06:30:28] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 06:30:28] [INFO ] [Nat]Absence check using 438 positive place invariants in 59 ms returned sat
[2022-05-20 06:30:28] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 06:30:28] [INFO ] After 360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-20 06:30:28] [INFO ] After 568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 06:30:28] [INFO ] Flatten gal took : 40 ms
[2022-05-20 06:30:28] [INFO ] Flatten gal took : 47 ms
[2022-05-20 06:30:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3944771233764283028.gal : 16 ms
[2022-05-20 06:30:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14454248463599161478.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17121450167844808942;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3944771233764283028.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14454248463599161478.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality14454248463599161478.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 28
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28 after 53
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :53 after 103
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :103 after 347
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :347 after 4315
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4315 after 217466
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :217466 after 4.2715e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.2715e+06 after 9.26924e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9.26924e+08 after 2.33982e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.33982e+10 after 5.08963e+13
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.08963e+13 after 3.33735e+19
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.33735e+19 after 2.05589e+25
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.05589e+25 after 2.17801e+34
Detected timeout of ITS tools.
[2022-05-20 06:30:43] [INFO ] Flatten gal took : 32 ms
[2022-05-20 06:30:43] [INFO ] Applying decomposition
[2022-05-20 06:30:43] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17790441931993214200.txt' '-o' '/tmp/graph17790441931993214200.bin' '-w' '/tmp/graph17790441931993214200.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17790441931993214200.bin' '-l' '-1' '-v' '-w' '/tmp/graph17790441931993214200.weights' '-q' '0' '-e' '0.001'
[2022-05-20 06:30:44] [INFO ] Decomposing Gal with order
[2022-05-20 06:30:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 06:30:44] [INFO ] Removed a total of 233 redundant transitions.
[2022-05-20 06:30:44] [INFO ] Flatten gal took : 97 ms
[2022-05-20 06:30:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 15 ms.
[2022-05-20 06:30:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8364480226100944338.gal : 12 ms
[2022-05-20 06:30:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11978985042283800741.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17121450167844808942;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8364480226100944338.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11978985042283800741.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality11978985042283800741.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :835712 after 1.47444e+21
Reachability property AtomicPropp8 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.67833e+54,4.63526,137888,5741,133,226403,709,936,801572,50,6113,0
Total reachable state count : 1.678325123285600373498954845348669247707e+54

Verifying 1 reachability properties.
Reachability property AtomicPropp8 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp8,6.05456e+50,4.65119,137888,3339,124,226403,709,944,801572,55,6113,0
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!((p0 U X(p0)) U p1)||X(p2))))'
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 29 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:30:49] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:30:49] [INFO ] Implicit Places using invariants in 597 ms returned []
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:30:49] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-20 06:30:50] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:30:51] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:30:51] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 444 ms :[true, (AND p1 (NOT p2)), (NOT p2), (OR (NOT p2) p0), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 p1)), (OR (AND p1 (NOT p2)) (AND p0 p1))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}]], initial=1, aps=[p1:(EQ s680 1), p0:(OR (EQ s73 0) (EQ s137 1)), p2:(AND (EQ s730 0) (EQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-00 finished in 2700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(!(p0 U p1)) U G(p0))||X(F(p1))))))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 720
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 998 transition count 718
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 9 place count 997 transition count 717
Applied a total of 9 rules in 113 ms. Remains 997 /1003 variables (removed 6) and now considering 717/722 (removed 5) transitions.
// Phase 1: matrix 717 rows 997 cols
[2022-05-20 06:30:52] [INFO ] Computed 440 place invariants in 3 ms
[2022-05-20 06:30:52] [INFO ] Implicit Places using invariants in 508 ms returned [980, 984]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 510 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1003 places, 717/722 transitions.
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 4 place count 993 transition count 715
Applied a total of 4 rules in 61 ms. Remains 993 /995 variables (removed 2) and now considering 715/717 (removed 2) transitions.
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:52] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:30:53] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:53] [INFO ] Computed 438 place invariants in 2 ms
[2022-05-20 06:30:54] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 993/1003 places, 715/722 transitions.
Finished structural reductions, in 2 iterations. Remains : 993/1003 places, 715/722 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s906 0) (EQ s707 1)), p1:(OR (EQ s975 0) (EQ s390 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 78 reset in 690 ms.
Product exploration explored 100000 steps with 86 reset in 717 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 183 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 993 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 993/993 places, 715/715 transitions.
Applied a total of 0 rules in 37 ms. Remains 993 /993 variables (removed 0) and now considering 715/715 (removed 0) transitions.
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:56] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:30:56] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:56] [INFO ] Computed 438 place invariants in 5 ms
[2022-05-20 06:30:57] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
[2022-05-20 06:30:57] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:30:57] [INFO ] Computed 438 place invariants in 4 ms
[2022-05-20 06:30:58] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 993/993 places, 715/715 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 471 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 72 reset in 564 ms.
Product exploration explored 100000 steps with 72 reset in 720 ms.
Built C files in :
/tmp/ltsmin1478542901422008001
[2022-05-20 06:31:00] [INFO ] Computing symmetric may disable matrix : 715 transitions.
[2022-05-20 06:31:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:31:00] [INFO ] Computing symmetric may enable matrix : 715 transitions.
[2022-05-20 06:31:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:31:00] [INFO ] Computing Do-Not-Accords matrix : 715 transitions.
[2022-05-20 06:31:00] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 06:31:00] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1478542901422008001
Running compilation step : cd /tmp/ltsmin1478542901422008001;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2370 ms.
Running link step : cd /tmp/ltsmin1478542901422008001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin1478542901422008001;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6590911551529123817.hoa' '--buchi-type=spotba'
LTSmin run took 7109 ms.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-03 finished in 17878 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)||p0))&&G(X(p2)))))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 30 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:09] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-20 06:31:10] [INFO ] Implicit Places using invariants in 497 ms returned []
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:10] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-20 06:31:11] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:11] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-20 06:31:11] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(AND (EQ s510 0) (EQ s869 1)), p0:(OR (EQ s869 0) (EQ s510 1)), p1:(OR (EQ s363 0) (EQ s595 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-05 finished in 2083 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 28 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:11] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-20 06:31:12] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:12] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-20 06:31:13] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:13] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-20 06:31:13] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s939 0) (EQ s493 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 496 steps with 0 reset in 7 ms.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-06 finished in 2095 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(X(p0))||p1)))&&X(p2)&&(p3 U p2)))'
Support contains 5 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 24 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:14] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-20 06:31:14] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:14] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-20 06:31:15] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:15] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-20 06:31:15] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR p2 p3), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(NOT p2), acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(EQ s884 1), p0:(EQ s884 0), p2:(OR (EQ s960 0) (EQ s204 1)), p3:(OR (EQ s810 0) (EQ s315 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-08 finished in 2262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1000 transition count 720
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 998 transition count 718
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 9 place count 997 transition count 717
Applied a total of 9 rules in 102 ms. Remains 997 /1003 variables (removed 6) and now considering 717/722 (removed 5) transitions.
// Phase 1: matrix 717 rows 997 cols
[2022-05-20 06:31:16] [INFO ] Computed 440 place invariants in 4 ms
[2022-05-20 06:31:16] [INFO ] Implicit Places using invariants in 549 ms returned [980, 984]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 555 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 995/1003 places, 717/722 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 993 transition count 715
Applied a total of 4 rules in 61 ms. Remains 993 /995 variables (removed 2) and now considering 715/717 (removed 2) transitions.
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:31:16] [INFO ] Computed 438 place invariants in 3 ms
[2022-05-20 06:31:17] [INFO ] Implicit Places using invariants in 476 ms returned []
// Phase 1: matrix 715 rows 993 cols
[2022-05-20 06:31:17] [INFO ] Computed 438 place invariants in 1 ms
[2022-05-20 06:31:18] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 993/1003 places, 715/722 transitions.
Finished structural reductions, in 2 iterations. Remains : 993/1003 places, 715/722 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s282 0) (NEQ s523 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 552 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 2 ms.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-12 finished in 2659 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(X((G(p1)||p0)))&&p2))&&F(p1))))'
Support contains 6 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 31 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:18] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-20 06:31:19] [INFO ] Implicit Places using invariants in 505 ms returned []
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:19] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-20 06:31:20] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:20] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-20 06:31:20] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (EQ s298 0) (EQ s526 1)), p2:(OR (EQ s827 0) (EQ s471 1)), p0:(OR (EQ s153 0) (EQ s780 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, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 594 ms.
Stack based approach found an accepted trace after 170 steps with 0 reset with depth 171 and stack size 171 in 2 ms.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-13 finished in 2754 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(G(p1)||X(p2)))))'
Support contains 4 out of 1003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1003/1003 places, 722/722 transitions.
Applied a total of 0 rules in 26 ms. Remains 1003 /1003 variables (removed 0) and now considering 722/722 (removed 0) transitions.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:21] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-20 06:31:22] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:22] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-20 06:31:23] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1496 ms to find 0 implicit places.
// Phase 1: matrix 722 rows 1003 cols
[2022-05-20 06:31:23] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-20 06:31:23] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1003/1003 places, 722/722 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s244 0) (EQ s324 1)), p1:(AND (NEQ s324 0) (NEQ s244 1)), p2:(OR (EQ s724 0) (EQ s415 1))], 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 579 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA ShieldPPPt-PT-040A-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040A-LTLCardinality-14 finished in 2760 ms.
All properties solved by simple procedures.
Total runtime 93661 ms.

BK_STOP 1653028284527

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-040A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025600659"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040A.tgz
mv ShieldPPPt-PT-040A 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 ;