Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 762K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716988117313

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 13:08:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:08:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:08:39] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-05-29 13:08:39] [INFO ] Transformed 3123 places.
[2024-05-29 13:08:39] [INFO ] Transformed 2843 transitions.
[2024-05-29 13:08:39] [INFO ] Found NUPN structural information;
[2024-05-29 13:08:39] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 3123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 431 places :
Symmetric choice reduction at 0 with 431 rule applications. Total rules 431 place count 2692 transition count 2412
Iterating global reduction 0 with 431 rules applied. Total rules applied 862 place count 2692 transition count 2412
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 863 place count 2691 transition count 2411
Iterating global reduction 0 with 1 rules applied. Total rules applied 864 place count 2691 transition count 2411
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 865 place count 2690 transition count 2410
Iterating global reduction 0 with 1 rules applied. Total rules applied 866 place count 2690 transition count 2410
Applied a total of 866 rules in 1107 ms. Remains 2690 /3123 variables (removed 433) and now considering 2410/2843 (removed 433) transitions.
// Phase 1: matrix 2410 rows 2690 cols
[2024-05-29 13:08:41] [INFO ] Computed 441 invariants in 47 ms
[2024-05-29 13:08:42] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-05-29 13:08:42] [INFO ] Invariant cache hit.
[2024-05-29 13:08:44] [INFO ] Implicit Places using invariants and state equation in 2678 ms returned []
Implicit Place search using SMT with State Equation took 3725 ms to find 0 implicit places.
[2024-05-29 13:08:44] [INFO ] Invariant cache hit.
[2024-05-29 13:08:46] [INFO ] Dead Transitions using invariants and state equation in 1702 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2690/3123 places, 2410/2843 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6543 ms. Remains : 2690/3123 places, 2410/2843 transitions.
Support contains 32 out of 2690 places after structural reductions.
[2024-05-29 13:08:46] [INFO ] Flatten gal took : 170 ms
[2024-05-29 13:08:47] [INFO ] Flatten gal took : 101 ms
[2024-05-29 13:08:47] [INFO ] Input system was already deterministic with 2410 transitions.
Support contains 29 out of 2690 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 13:08:47] [INFO ] Invariant cache hit.
[2024-05-29 13:08:48] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 13:08:49] [INFO ] [Nat]Absence check using 441 positive place invariants in 173 ms returned sat
[2024-05-29 13:08:50] [INFO ] After 1750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 13:08:51] [INFO ] Deduced a trap composed of 18 places in 508 ms of which 6 ms to minimize.
[2024-05-29 13:08:52] [INFO ] Deduced a trap composed of 24 places in 579 ms of which 4 ms to minimize.
[2024-05-29 13:08:52] [INFO ] Deduced a trap composed of 19 places in 520 ms of which 1 ms to minimize.
[2024-05-29 13:08:53] [INFO ] Deduced a trap composed of 19 places in 455 ms of which 2 ms to minimize.
[2024-05-29 13:08:53] [INFO ] Deduced a trap composed of 20 places in 412 ms of which 2 ms to minimize.
[2024-05-29 13:08:54] [INFO ] Deduced a trap composed of 17 places in 434 ms of which 2 ms to minimize.
[2024-05-29 13:08:54] [INFO ] Deduced a trap composed of 22 places in 396 ms of which 2 ms to minimize.
[2024-05-29 13:08:55] [INFO ] Deduced a trap composed of 23 places in 425 ms of which 1 ms to minimize.
[2024-05-29 13:08:55] [INFO ] Deduced a trap composed of 24 places in 388 ms of which 1 ms to minimize.
[2024-05-29 13:08:56] [INFO ] Deduced a trap composed of 34 places in 407 ms of which 1 ms to minimize.
[2024-05-29 13:08:56] [INFO ] Deduced a trap composed of 18 places in 386 ms of which 1 ms to minimize.
[2024-05-29 13:08:57] [INFO ] Deduced a trap composed of 37 places in 406 ms of which 1 ms to minimize.
[2024-05-29 13:08:57] [INFO ] Deduced a trap composed of 27 places in 391 ms of which 1 ms to minimize.
[2024-05-29 13:08:58] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 1 ms to minimize.
[2024-05-29 13:08:58] [INFO ] Deduced a trap composed of 21 places in 360 ms of which 1 ms to minimize.
[2024-05-29 13:08:59] [INFO ] Deduced a trap composed of 35 places in 357 ms of which 1 ms to minimize.
[2024-05-29 13:08:59] [INFO ] Deduced a trap composed of 25 places in 357 ms of which 1 ms to minimize.
[2024-05-29 13:09:00] [INFO ] Deduced a trap composed of 33 places in 359 ms of which 0 ms to minimize.
[2024-05-29 13:09:00] [INFO ] Deduced a trap composed of 38 places in 336 ms of which 0 ms to minimize.
[2024-05-29 13:09:00] [INFO ] Deduced a trap composed of 29 places in 334 ms of which 1 ms to minimize.
[2024-05-29 13:09:01] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 1 ms to minimize.
[2024-05-29 13:09:01] [INFO ] Deduced a trap composed of 39 places in 326 ms of which 2 ms to minimize.
[2024-05-29 13:09:02] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 1 ms to minimize.
[2024-05-29 13:09:02] [INFO ] Deduced a trap composed of 32 places in 310 ms of which 2 ms to minimize.
[2024-05-29 13:09:02] [INFO ] Deduced a trap composed of 40 places in 323 ms of which 2 ms to minimize.
[2024-05-29 13:09:03] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 1 ms to minimize.
[2024-05-29 13:09:03] [INFO ] Deduced a trap composed of 27 places in 289 ms of which 1 ms to minimize.
[2024-05-29 13:09:03] [INFO ] Deduced a trap composed of 36 places in 281 ms of which 0 ms to minimize.
[2024-05-29 13:09:04] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 1 ms to minimize.
[2024-05-29 13:09:04] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 0 ms to minimize.
[2024-05-29 13:09:05] [INFO ] Deduced a trap composed of 35 places in 269 ms of which 1 ms to minimize.
[2024-05-29 13:09:05] [INFO ] Deduced a trap composed of 32 places in 334 ms of which 1 ms to minimize.
[2024-05-29 13:09:05] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 1 ms to minimize.
[2024-05-29 13:09:06] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 2 ms to minimize.
[2024-05-29 13:09:06] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 0 ms to minimize.
[2024-05-29 13:09:06] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 1 ms to minimize.
[2024-05-29 13:09:07] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 1 ms to minimize.
[2024-05-29 13:09:07] [INFO ] Deduced a trap composed of 41 places in 228 ms of which 1 ms to minimize.
[2024-05-29 13:09:07] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 0 ms to minimize.
[2024-05-29 13:09:07] [INFO ] Deduced a trap composed of 47 places in 213 ms of which 1 ms to minimize.
[2024-05-29 13:09:08] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 0 ms to minimize.
[2024-05-29 13:09:08] [INFO ] Deduced a trap composed of 45 places in 197 ms of which 1 ms to minimize.
[2024-05-29 13:09:08] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 1 ms to minimize.
[2024-05-29 13:09:09] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 1 ms to minimize.
[2024-05-29 13:09:09] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 1 ms to minimize.
[2024-05-29 13:09:09] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 1 ms to minimize.
[2024-05-29 13:09:09] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 1 ms to minimize.
[2024-05-29 13:09:10] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 1 ms to minimize.
[2024-05-29 13:09:10] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 1 ms to minimize.
[2024-05-29 13:09:10] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 1 ms to minimize.
[2024-05-29 13:09:10] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-05-29 13:09:11] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:09:11] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 0 ms to minimize.
[2024-05-29 13:09:11] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:09:11] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 0 ms to minimize.
[2024-05-29 13:09:12] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 3 ms to minimize.
[2024-05-29 13:09:12] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 0 ms to minimize.
[2024-05-29 13:09:12] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 0 ms to minimize.
[2024-05-29 13:09:12] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 0 ms to minimize.
[2024-05-29 13:09:12] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 21748 ms
[2024-05-29 13:09:13] [INFO ] After 24190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-29 13:09:13] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 189 ms.
Support contains 8 out of 2690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Drop transitions removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 2690 transition count 1855
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 2135 transition count 1855
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 1110 place count 2135 transition count 1540
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1740 place count 1820 transition count 1540
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1744 place count 1816 transition count 1536
Iterating global reduction 2 with 4 rules applied. Total rules applied 1748 place count 1816 transition count 1536
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1748 place count 1816 transition count 1533
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1754 place count 1813 transition count 1533
Performed 683 Post agglomeration using F-continuation condition.Transition count delta: 683
Deduced a syphon composed of 683 places in 3 ms
Reduce places removed 683 places and 0 transitions.
Iterating global reduction 2 with 1366 rules applied. Total rules applied 3120 place count 1130 transition count 850
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3121 place count 1130 transition count 849
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3123 place count 1129 transition count 848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3325 place count 1028 transition count 848
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3361 place count 1010 transition count 848
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 3 with 118 rules applied. Total rules applied 3479 place count 1010 transition count 848
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3480 place count 1009 transition count 847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3481 place count 1008 transition count 847
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3481 place count 1008 transition count 845
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3485 place count 1006 transition count 845
Applied a total of 3485 rules in 671 ms. Remains 1006 /2690 variables (removed 1684) and now considering 845/2410 (removed 1565) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 671 ms. Remains : 1006/2690 places, 845/2410 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 845 rows 1006 cols
[2024-05-29 13:09:14] [INFO ] Computed 440 invariants in 9 ms
[2024-05-29 13:09:15] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:09:15] [INFO ] [Nat]Absence check using 440 positive place invariants in 75 ms returned sat
[2024-05-29 13:09:15] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:09:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 13:09:15] [INFO ] After 134ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:09:16] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 142 ms.
[2024-05-29 13:09:16] [INFO ] After 1315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 8 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 845/845 transitions.
Applied a total of 0 rules in 30 ms. Remains 1006 /1006 variables (removed 0) and now considering 845/845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1006/1006 places, 845/845 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 117157 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117157 steps, saw 95082 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:09:19] [INFO ] Invariant cache hit.
[2024-05-29 13:09:20] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:09:20] [INFO ] [Nat]Absence check using 440 positive place invariants in 71 ms returned sat
[2024-05-29 13:09:20] [INFO ] After 488ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:09:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 13:09:20] [INFO ] After 132ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:09:21] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 13:09:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2024-05-29 13:09:21] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-29 13:09:21] [INFO ] After 1391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 8 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 845/845 transitions.
Applied a total of 0 rules in 24 ms. Remains 1006 /1006 variables (removed 0) and now considering 845/845 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1006/1006 places, 845/845 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 845/845 transitions.
Applied a total of 0 rules in 27 ms. Remains 1006 /1006 variables (removed 0) and now considering 845/845 (removed 0) transitions.
[2024-05-29 13:09:21] [INFO ] Invariant cache hit.
[2024-05-29 13:09:22] [INFO ] Implicit Places using invariants in 631 ms returned [989, 993]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 633 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1004/1006 places, 845/845 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1002 transition count 843
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1002 transition count 843
Applied a total of 4 rules in 42 ms. Remains 1002 /1004 variables (removed 2) and now considering 843/845 (removed 2) transitions.
// Phase 1: matrix 843 rows 1002 cols
[2024-05-29 13:09:22] [INFO ] Computed 438 invariants in 3 ms
[2024-05-29 13:09:22] [INFO ] Implicit Places using invariants in 591 ms returned []
[2024-05-29 13:09:22] [INFO ] Invariant cache hit.
[2024-05-29 13:09:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:09:24] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1002/1006 places, 843/845 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2503 ms. Remains : 1002/1006 places, 843/845 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 121229 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121229 steps, saw 97630 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 13:09:27] [INFO ] Invariant cache hit.
[2024-05-29 13:09:27] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:09:27] [INFO ] [Nat]Absence check using 438 positive place invariants in 74 ms returned sat
[2024-05-29 13:09:28] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:09:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:09:28] [INFO ] After 135ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:09:28] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:09:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-05-29 13:09:28] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-29 13:09:29] [INFO ] After 1406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 56 ms.
Support contains 8 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 843/843 transitions.
Applied a total of 0 rules in 21 ms. Remains 1002 /1002 variables (removed 0) and now considering 843/843 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1002/1002 places, 843/843 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 843/843 transitions.
Applied a total of 0 rules in 20 ms. Remains 1002 /1002 variables (removed 0) and now considering 843/843 (removed 0) transitions.
[2024-05-29 13:09:29] [INFO ] Invariant cache hit.
[2024-05-29 13:09:29] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-05-29 13:09:29] [INFO ] Invariant cache hit.
[2024-05-29 13:09:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:09:30] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
[2024-05-29 13:09:30] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-29 13:09:30] [INFO ] Invariant cache hit.
[2024-05-29 13:09:31] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2254 ms. Remains : 1002/1002 places, 843/843 transitions.
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 235 place count 1002 transition count 843
Applied a total of 235 rules in 55 ms. Remains 1002 /1002 variables (removed 0) and now considering 843/843 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 843 rows 1002 cols
[2024-05-29 13:09:31] [INFO ] Computed 438 invariants in 6 ms
[2024-05-29 13:09:31] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 13:09:31] [INFO ] [Nat]Absence check using 438 positive place invariants in 74 ms returned sat
[2024-05-29 13:09:32] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 13:09:32] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 13:09:32] [INFO ] After 251ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 13:09:32] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2024-05-29 13:09:33] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2024-05-29 13:09:33] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-05-29 13:09:33] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2024-05-29 13:09:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 862 ms
[2024-05-29 13:09:33] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:09:34] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2024-05-29 13:09:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2024-05-29 13:09:34] [INFO ] After 1744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 175 ms.
[2024-05-29 13:09:34] [INFO ] After 2723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 638 stabilizing places and 638 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(G(p1))))))'
Support contains 4 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2682 transition count 2402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2682 transition count 2402
Applied a total of 16 rules in 275 ms. Remains 2682 /2690 variables (removed 8) and now considering 2402/2410 (removed 8) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2024-05-29 13:09:34] [INFO ] Computed 441 invariants in 17 ms
[2024-05-29 13:09:35] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2024-05-29 13:09:35] [INFO ] Invariant cache hit.
[2024-05-29 13:09:38] [INFO ] Implicit Places using invariants and state equation in 2713 ms returned []
Implicit Place search using SMT with State Equation took 3744 ms to find 0 implicit places.
[2024-05-29 13:09:38] [INFO ] Invariant cache hit.
[2024-05-29 13:09:40] [INFO ] Dead Transitions using invariants and state equation in 1896 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2690 places, 2402/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5919 ms. Remains : 2682/2690 places, 2402/2410 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s2220 0) (EQ s1255 1)), p1:(AND (NEQ s1896 0) (NEQ s1024 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 822 ms.
Stack based approach found an accepted trace after 11836 steps with 0 reset with depth 11837 and stack size 9775 in 126 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-00 finished in 7257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2681 transition count 2401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2681 transition count 2401
Applied a total of 18 rules in 299 ms. Remains 2681 /2690 variables (removed 9) and now considering 2401/2410 (removed 9) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2024-05-29 13:09:42] [INFO ] Computed 441 invariants in 15 ms
[2024-05-29 13:09:43] [INFO ] Implicit Places using invariants in 998 ms returned []
[2024-05-29 13:09:43] [INFO ] Invariant cache hit.
[2024-05-29 13:09:45] [INFO ] Implicit Places using invariants and state equation in 2722 ms returned []
Implicit Place search using SMT with State Equation took 3727 ms to find 0 implicit places.
[2024-05-29 13:09:45] [INFO ] Invariant cache hit.
[2024-05-29 13:09:47] [INFO ] Dead Transitions using invariants and state equation in 1773 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2690 places, 2401/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5802 ms. Remains : 2681/2690 places, 2401/2410 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1806 0) (EQ s364 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1013 ms.
Product exploration explored 100000 steps with 33333 reset in 1001 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 23 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-01 finished in 8043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 4 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2682 transition count 2402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2682 transition count 2402
Applied a total of 16 rules in 281 ms. Remains 2682 /2690 variables (removed 8) and now considering 2402/2410 (removed 8) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2024-05-29 13:09:50] [INFO ] Computed 441 invariants in 19 ms
[2024-05-29 13:09:51] [INFO ] Implicit Places using invariants in 1031 ms returned []
[2024-05-29 13:09:51] [INFO ] Invariant cache hit.
[2024-05-29 13:09:54] [INFO ] Implicit Places using invariants and state equation in 2826 ms returned []
Implicit Place search using SMT with State Equation took 3858 ms to find 0 implicit places.
[2024-05-29 13:09:54] [INFO ] Invariant cache hit.
[2024-05-29 13:09:55] [INFO ] Dead Transitions using invariants and state equation in 1820 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2690 places, 2402/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5961 ms. Remains : 2682/2690 places, 2402/2410 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s2051 0) (EQ s21 1)), p1:(OR (EQ s867 0) (EQ s1092 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1418 ms.
Product exploration explored 100000 steps with 50000 reset in 1422 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 27 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-02 finished in 9069 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2682 transition count 2402
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2682 transition count 2402
Applied a total of 16 rules in 299 ms. Remains 2682 /2690 variables (removed 8) and now considering 2402/2410 (removed 8) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2024-05-29 13:09:59] [INFO ] Computed 441 invariants in 9 ms
[2024-05-29 13:10:00] [INFO ] Implicit Places using invariants in 973 ms returned []
[2024-05-29 13:10:00] [INFO ] Invariant cache hit.
[2024-05-29 13:10:02] [INFO ] Implicit Places using invariants and state equation in 2681 ms returned []
Implicit Place search using SMT with State Equation took 3656 ms to find 0 implicit places.
[2024-05-29 13:10:02] [INFO ] Invariant cache hit.
[2024-05-29 13:10:04] [INFO ] Dead Transitions using invariants and state equation in 1791 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2690 places, 2402/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5749 ms. Remains : 2682/2690 places, 2402/2410 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s2600 0) (EQ s350 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1364 ms.
Product exploration explored 100000 steps with 50000 reset in 1370 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-04 finished in 8687 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 2690 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 553 transitions
Trivial Post-agglo rules discarded 553 transitions
Performed 553 trivial Post agglomeration. Transition count delta: 553
Iterating post reduction 0 with 553 rules applied. Total rules applied 553 place count 2689 transition count 1856
Reduce places removed 553 places and 0 transitions.
Iterating post reduction 1 with 553 rules applied. Total rules applied 1106 place count 2136 transition count 1856
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 1106 place count 2136 transition count 1541
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1736 place count 1821 transition count 1541
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1743 place count 1814 transition count 1534
Iterating global reduction 2 with 7 rules applied. Total rules applied 1750 place count 1814 transition count 1534
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1750 place count 1814 transition count 1528
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1762 place count 1808 transition count 1528
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 3120 place count 1129 transition count 849
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3121 place count 1129 transition count 848
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3123 place count 1128 transition count 847
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3325 place count 1027 transition count 847
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 3357 place count 1011 transition count 847
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3359 place count 1009 transition count 845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3360 place count 1008 transition count 845
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3360 place count 1008 transition count 843
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3364 place count 1006 transition count 843
Applied a total of 3364 rules in 567 ms. Remains 1006 /2690 variables (removed 1684) and now considering 843/2410 (removed 1567) transitions.
// Phase 1: matrix 843 rows 1006 cols
[2024-05-29 13:10:08] [INFO ] Computed 440 invariants in 4 ms
[2024-05-29 13:10:08] [INFO ] Implicit Places using invariants in 576 ms returned [989, 993]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 581 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/2690 places, 843/2410 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 1002 transition count 841
Applied a total of 4 rules in 37 ms. Remains 1002 /1004 variables (removed 2) and now considering 841/843 (removed 2) transitions.
// Phase 1: matrix 841 rows 1002 cols
[2024-05-29 13:10:08] [INFO ] Computed 438 invariants in 4 ms
[2024-05-29 13:10:09] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-29 13:10:09] [INFO ] Invariant cache hit.
[2024-05-29 13:10:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:10:10] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1002/2690 places, 841/2410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2904 ms. Remains : 1002/2690 places, 841/2410 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s691 0) (EQ s824 1)), p0:(AND (EQ s979 0) (EQ s908 1)), p2:(AND (NOT (OR (EQ s875 0) (EQ s94 1))) (NOT (OR (EQ s691 0) (EQ s824 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5 reset in 682 ms.
Stack based approach found an accepted trace after 126 steps with 1 reset with depth 43 and stack size 43 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-05 finished in 3777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 3 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2684 transition count 2404
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2684 transition count 2404
Applied a total of 12 rules in 272 ms. Remains 2684 /2690 variables (removed 6) and now considering 2404/2410 (removed 6) transitions.
// Phase 1: matrix 2404 rows 2684 cols
[2024-05-29 13:10:11] [INFO ] Computed 441 invariants in 13 ms
[2024-05-29 13:10:12] [INFO ] Implicit Places using invariants in 1050 ms returned []
[2024-05-29 13:10:12] [INFO ] Invariant cache hit.
[2024-05-29 13:10:15] [INFO ] Implicit Places using invariants and state equation in 2712 ms returned []
Implicit Place search using SMT with State Equation took 3769 ms to find 0 implicit places.
[2024-05-29 13:10:15] [INFO ] Invariant cache hit.
[2024-05-29 13:10:17] [INFO ] Dead Transitions using invariants and state equation in 1595 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2684/2690 places, 2404/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5640 ms. Remains : 2684/2690 places, 2404/2410 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1598 0), p1:(AND (EQ s1152 0) (EQ s491 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1359 ms.
Product exploration explored 100000 steps with 50000 reset in 1384 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-06 finished in 8615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&G(p1)))))'
Support contains 4 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2681 transition count 2401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2681 transition count 2401
Applied a total of 18 rules in 311 ms. Remains 2681 /2690 variables (removed 9) and now considering 2401/2410 (removed 9) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2024-05-29 13:10:20] [INFO ] Computed 441 invariants in 23 ms
[2024-05-29 13:10:21] [INFO ] Implicit Places using invariants in 1062 ms returned []
[2024-05-29 13:10:21] [INFO ] Invariant cache hit.
[2024-05-29 13:10:24] [INFO ] Implicit Places using invariants and state equation in 2776 ms returned []
Implicit Place search using SMT with State Equation took 3841 ms to find 0 implicit places.
[2024-05-29 13:10:24] [INFO ] Invariant cache hit.
[2024-05-29 13:10:25] [INFO ] Dead Transitions using invariants and state equation in 1706 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2690 places, 2401/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5862 ms. Remains : 2681/2690 places, 2401/2410 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s1015 0) (EQ s1512 0)), p0:(AND (EQ s2458 0) (EQ s183 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-10 finished in 6126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p1))))'
Support contains 2 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2681 transition count 2401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2681 transition count 2401
Applied a total of 18 rules in 292 ms. Remains 2681 /2690 variables (removed 9) and now considering 2401/2410 (removed 9) transitions.
[2024-05-29 13:10:26] [INFO ] Invariant cache hit.
[2024-05-29 13:10:27] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2024-05-29 13:10:27] [INFO ] Invariant cache hit.
[2024-05-29 13:10:30] [INFO ] Implicit Places using invariants and state equation in 2638 ms returned []
Implicit Place search using SMT with State Equation took 3720 ms to find 0 implicit places.
[2024-05-29 13:10:30] [INFO ] Invariant cache hit.
[2024-05-29 13:10:31] [INFO ] Dead Transitions using invariants and state equation in 1752 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2690 places, 2401/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5767 ms. Remains : 2681/2690 places, 2401/2410 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s717 1), p0:(EQ s2248 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-11 finished in 5964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((p1&&X(p0))||X(G(p0)))))'
Support contains 2 out of 2690 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2690/2690 places, 2410/2410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2681 transition count 2401
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2681 transition count 2401
Applied a total of 18 rules in 279 ms. Remains 2681 /2690 variables (removed 9) and now considering 2401/2410 (removed 9) transitions.
[2024-05-29 13:10:32] [INFO ] Invariant cache hit.
[2024-05-29 13:10:33] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2024-05-29 13:10:33] [INFO ] Invariant cache hit.
[2024-05-29 13:10:36] [INFO ] Implicit Places using invariants and state equation in 2731 ms returned []
Implicit Place search using SMT with State Equation took 3782 ms to find 0 implicit places.
[2024-05-29 13:10:36] [INFO ] Invariant cache hit.
[2024-05-29 13:10:37] [INFO ] Dead Transitions using invariants and state equation in 1775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2690 places, 2401/2410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5839 ms. Remains : 2681/2690 places, 2401/2410 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s1652 1), p1:(NEQ s413 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1363 ms.
Product exploration explored 100000 steps with 50000 reset in 1372 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 14 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLCardinality-14 finished in 8756 ms.
All properties solved by simple procedures.
Total runtime 121602 ms.

BK_STOP 1716988241844

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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