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-165286025600655.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-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600655
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 13:36 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.5K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 29 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 29 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 29 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 29 13:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:55 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 569K 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-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654275342629

Running Version 202205111006
[2022-06-03 16:55:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-06-03 16:55:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:55:44] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2022-06-03 16:55:44] [INFO ] Transformed 2343 places.
[2022-06-03 16:55:44] [INFO ] Transformed 2133 transitions.
[2022-06-03 16:55:44] [INFO ] Found NUPN structural information;
[2022-06-03 16:55:44] [INFO ] Parsed PT model containing 2343 places and 2133 transitions in 469 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 16) seen :9
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2022-06-03 16:55:45] [INFO ] Computed 331 place invariants in 39 ms
[2022-06-03 16:55:46] [INFO ] [Real]Absence check using 331 positive place invariants in 137 ms returned sat
[2022-06-03 16:55:46] [INFO ] After 1172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 16:55:47] [INFO ] [Nat]Absence check using 331 positive place invariants in 109 ms returned sat
[2022-06-03 16:55:49] [INFO ] After 2130ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2022-06-03 16:55:50] [INFO ] Deduced a trap composed of 19 places in 508 ms of which 20 ms to minimize.
[2022-06-03 16:55:51] [INFO ] Deduced a trap composed of 24 places in 648 ms of which 2 ms to minimize.
[2022-06-03 16:55:52] [INFO ] Deduced a trap composed of 21 places in 804 ms of which 2 ms to minimize.
[2022-06-03 16:55:53] [INFO ] Deduced a trap composed of 14 places in 808 ms of which 2 ms to minimize.
[2022-06-03 16:55:53] [INFO ] Deduced a trap composed of 20 places in 451 ms of which 1 ms to minimize.
[2022-06-03 16:55:54] [INFO ] Deduced a trap composed of 31 places in 459 ms of which 2 ms to minimize.
[2022-06-03 16:55:54] [INFO ] Deduced a trap composed of 21 places in 405 ms of which 1 ms to minimize.
[2022-06-03 16:55:55] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 1 ms to minimize.
[2022-06-03 16:55:55] [INFO ] Deduced a trap composed of 25 places in 410 ms of which 1 ms to minimize.
[2022-06-03 16:55:56] [INFO ] Deduced a trap composed of 36 places in 354 ms of which 1 ms to minimize.
[2022-06-03 16:55:56] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 1 ms to minimize.
[2022-06-03 16:55:56] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 0 ms to minimize.
[2022-06-03 16:55:57] [INFO ] Deduced a trap composed of 22 places in 325 ms of which 1 ms to minimize.
[2022-06-03 16:55:57] [INFO ] Deduced a trap composed of 28 places in 317 ms of which 1 ms to minimize.
[2022-06-03 16:55:58] [INFO ] Deduced a trap composed of 25 places in 357 ms of which 1 ms to minimize.
[2022-06-03 16:55:58] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 1 ms to minimize.
[2022-06-03 16:55:59] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 1 ms to minimize.
[2022-06-03 16:55:59] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 1 ms to minimize.
[2022-06-03 16:55:59] [INFO ] Deduced a trap composed of 35 places in 294 ms of which 1 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 33 places in 295 ms of which 1 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 0 ms to minimize.
[2022-06-03 16:56:00] [INFO ] Deduced a trap composed of 48 places in 272 ms of which 1 ms to minimize.
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 1 ms to minimize.
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 1 ms to minimize.
[2022-06-03 16:56:01] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 1 ms to minimize.
[2022-06-03 16:56:02] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 1 ms to minimize.
[2022-06-03 16:56:02] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 2 ms to minimize.
[2022-06-03 16:56:02] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 0 ms to minimize.
[2022-06-03 16:56:03] [INFO ] Deduced a trap composed of 35 places in 269 ms of which 1 ms to minimize.
[2022-06-03 16:56:03] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 0 ms to minimize.
[2022-06-03 16:56:03] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 1 ms to minimize.
[2022-06-03 16:56:04] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 0 ms to minimize.
[2022-06-03 16:56:04] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 1 ms to minimize.
[2022-06-03 16:56:04] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 4 ms to minimize.
[2022-06-03 16:56:05] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 0 ms to minimize.
[2022-06-03 16:56:05] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 1 ms to minimize.
[2022-06-03 16:56:05] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 1 ms to minimize.
[2022-06-03 16:56:05] [INFO ] Deduced a trap composed of 64 places in 190 ms of which 1 ms to minimize.
[2022-06-03 16:56:06] [INFO ] Deduced a trap composed of 45 places in 175 ms of which 0 ms to minimize.
[2022-06-03 16:56:06] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 16317 ms
[2022-06-03 16:56:06] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 2 ms to minimize.
[2022-06-03 16:56:06] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 1 ms to minimize.
[2022-06-03 16:56:07] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 0 ms to minimize.
[2022-06-03 16:56:07] [INFO ] Deduced a trap composed of 23 places in 213 ms of which 0 ms to minimize.
[2022-06-03 16:56:07] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 1 ms to minimize.
[2022-06-03 16:56:08] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 1 ms to minimize.
[2022-06-03 16:56:08] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 0 ms to minimize.
[2022-06-03 16:56:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2067 ms
[2022-06-03 16:56:08] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 1 ms to minimize.
[2022-06-03 16:56:09] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 2 ms to minimize.
[2022-06-03 16:56:09] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 1 ms to minimize.
[2022-06-03 16:56:10] [INFO ] Deduced a trap composed of 32 places in 287 ms of which 1 ms to minimize.
[2022-06-03 16:56:10] [INFO ] Deduced a trap composed of 32 places in 311 ms of which 1 ms to minimize.
[2022-06-03 16:56:10] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 1 ms to minimize.
[2022-06-03 16:56:11] [INFO ] Deduced a trap composed of 42 places in 266 ms of which 0 ms to minimize.
[2022-06-03 16:56:11] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 1 ms to minimize.
[2022-06-03 16:56:11] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 1 ms to minimize.
[2022-06-03 16:56:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 16:56:11] [INFO ] After 25218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 22120 ms.
Support contains 68 out of 2343 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 517 transitions
Trivial Post-agglo rules discarded 517 transitions
Performed 517 trivial Post agglomeration. Transition count delta: 517
Iterating post reduction 0 with 517 rules applied. Total rules applied 517 place count 2343 transition count 1616
Reduce places removed 517 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 519 rules applied. Total rules applied 1036 place count 1826 transition count 1614
Reduce places removed 1 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 20 rules applied. Total rules applied 1056 place count 1825 transition count 1595
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 1075 place count 1806 transition count 1595
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 1075 place count 1806 transition count 1470
Deduced a syphon composed of 125 places in 17 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1325 place count 1681 transition count 1470
Discarding 203 places :
Symmetric choice reduction at 4 with 203 rule applications. Total rules 1528 place count 1478 transition count 1267
Iterating global reduction 4 with 203 rules applied. Total rules applied 1731 place count 1478 transition count 1267
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 78 Pre rules applied. Total rules applied 1731 place count 1478 transition count 1189
Deduced a syphon composed of 78 places in 6 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 1887 place count 1400 transition count 1189
Performed 481 Post agglomeration using F-continuation condition.Transition count delta: 481
Deduced a syphon composed of 481 places in 3 ms
Reduce places removed 481 places and 0 transitions.
Iterating global reduction 4 with 962 rules applied. Total rules applied 2849 place count 919 transition count 708
Renaming transitions due to excessive name length > 1024 char.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 3001 place count 843 transition count 708
Partial Free-agglomeration rule applied 84 times.
Drop transitions removed 84 transitions
Iterating global reduction 4 with 84 rules applied. Total rules applied 3085 place count 843 transition count 708
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3086 place count 842 transition count 707
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3087 place count 841 transition count 707
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3087 place count 841 transition count 705
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3091 place count 839 transition count 705
Applied a total of 3091 rules in 1184 ms. Remains 839 /2343 variables (removed 1504) and now considering 705/2133 (removed 1428) transitions.
Finished structural reductions, in 1 iterations. Remains : 839/2343 places, 705/2133 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 24665 ms. (steps per millisecond=40 ) properties (out of 5) seen :2
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 830849 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 0
Interrupted Best-First random walk after 885877 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen 1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 922620 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=184 ) properties seen 0
Running SMT prover for 2 properties.
// Phase 1: matrix 705 rows 839 cols
[2022-06-03 16:57:14] [INFO ] Computed 330 place invariants in 3 ms
[2022-06-03 16:57:15] [INFO ] [Real]Absence check using 330 positive place invariants in 75 ms returned sat
[2022-06-03 16:57:15] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:57:15] [INFO ] [Nat]Absence check using 330 positive place invariants in 63 ms returned sat
[2022-06-03 16:57:15] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:57:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-06-03 16:57:15] [INFO ] After 164ms SMT Verify possible using 84 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 3 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 1 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2022-06-03 16:57:16] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1106 ms
[2022-06-03 16:57:17] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2022-06-03 16:57:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-06-03 16:57:17] [INFO ] After 1542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 138 ms.
[2022-06-03 16:57:17] [INFO ] After 2256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 741 ms.
Support contains 25 out of 839 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 839/839 places, 705/705 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 839 transition count 693
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 827 transition count 693
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 24 place count 827 transition count 681
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 48 place count 815 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 814 transition count 680
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 814 transition count 680
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 94 place count 792 transition count 658
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 110 place count 784 transition count 658
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 784 transition count 658
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 779 transition count 653
Applied a total of 118 rules in 181 ms. Remains 779 /839 variables (removed 60) and now considering 653/705 (removed 52) transitions.
Finished structural reductions, in 1 iterations. Remains : 779/839 places, 653/705 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11558 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4616 ms. (steps per millisecond=216 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 946236 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen 0
Interrupted probabilistic random walk after 3630901 steps, run timeout after 63024 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 3630901 steps, saw 2508947 distinct states, run finished after 63044 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 653 rows 779 cols
[2022-06-03 16:58:42] [INFO ] Computed 330 place invariants in 2 ms
[2022-06-03 16:58:42] [INFO ] [Real]Absence check using 330 positive place invariants in 76 ms returned sat
[2022-06-03 16:58:43] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:58:43] [INFO ] [Nat]Absence check using 330 positive place invariants in 67 ms returned sat
[2022-06-03 16:58:43] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:58:43] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-06-03 16:58:44] [INFO ] After 66ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:58:44] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2022-06-03 16:58:44] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2022-06-03 16:58:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 450 ms
[2022-06-03 16:58:44] [INFO ] After 620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2022-06-03 16:58:44] [INFO ] After 1640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 849 ms.
Support contains 25 out of 779 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 779/779 places, 653/653 transitions.
Applied a total of 0 rules in 20 ms. Remains 779 /779 variables (removed 0) and now considering 653/653 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 779/779 places, 653/653 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 779/779 places, 653/653 transitions.
Applied a total of 0 rules in 18 ms. Remains 779 /779 variables (removed 0) and now considering 653/653 (removed 0) transitions.
// Phase 1: matrix 653 rows 779 cols
[2022-06-03 16:58:45] [INFO ] Computed 330 place invariants in 2 ms
[2022-06-03 16:58:46] [INFO ] Implicit Places using invariants in 588 ms returned [762, 766]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 592 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 777/779 places, 653/653 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 775 transition count 651
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 775 transition count 651
Applied a total of 4 rules in 30 ms. Remains 775 /777 variables (removed 2) and now considering 651/653 (removed 2) transitions.
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 16:58:46] [INFO ] Computed 328 place invariants in 1 ms
[2022-06-03 16:58:46] [INFO ] Implicit Places using invariants in 499 ms returned []
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 16:58:46] [INFO ] Computed 328 place invariants in 2 ms
[2022-06-03 16:58:47] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-06-03 16:58:47] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1338 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 775/779 places, 651/653 transitions.
Finished structural reductions, in 2 iterations. Remains : 775/779 places, 651/653 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11105 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4476 ms. (steps per millisecond=223 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 956158 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 0
Interrupted probabilistic random walk after 3966904 steps, run timeout after 60001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 3966904 steps, saw 2802398 distinct states, run finished after 60001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 17:00:08] [INFO ] Computed 328 place invariants in 2 ms
[2022-06-03 17:00:08] [INFO ] [Real]Absence check using 328 positive place invariants in 45 ms returned sat
[2022-06-03 17:00:08] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 17:00:08] [INFO ] [Nat]Absence check using 328 positive place invariants in 44 ms returned sat
[2022-06-03 17:00:08] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 17:00:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-06-03 17:00:08] [INFO ] After 70ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 17:00:08] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2022-06-03 17:00:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-06-03 17:00:09] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-03 17:00:09] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 871 ms.
Support contains 25 out of 775 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 775/775 places, 651/651 transitions.
Applied a total of 0 rules in 18 ms. Remains 775 /775 variables (removed 0) and now considering 651/651 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 775/775 places, 651/651 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 775/775 places, 651/651 transitions.
Applied a total of 0 rules in 18 ms. Remains 775 /775 variables (removed 0) and now considering 651/651 (removed 0) transitions.
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 17:00:10] [INFO ] Computed 328 place invariants in 2 ms
[2022-06-03 17:00:10] [INFO ] Implicit Places using invariants in 566 ms returned []
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 17:00:10] [INFO ] Computed 328 place invariants in 3 ms
[2022-06-03 17:00:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-06-03 17:00:11] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1558 ms to find 0 implicit places.
[2022-06-03 17:00:11] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 17:00:11] [INFO ] Computed 328 place invariants in 4 ms
[2022-06-03 17:00:12] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 775/775 places, 651/651 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 13039 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4609 ms. (steps per millisecond=216 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 923610 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=184 ) properties seen 0
Interrupted probabilistic random walk after 4245501 steps, run timeout after 66001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 4245501 steps, saw 3001316 distinct states, run finished after 66001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 17:01:40] [INFO ] Computed 328 place invariants in 2 ms
[2022-06-03 17:01:40] [INFO ] [Real]Absence check using 328 positive place invariants in 44 ms returned sat
[2022-06-03 17:01:40] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 17:01:41] [INFO ] [Nat]Absence check using 328 positive place invariants in 43 ms returned sat
[2022-06-03 17:01:41] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 17:01:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-06-03 17:01:41] [INFO ] After 72ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 17:01:41] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2022-06-03 17:01:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-06-03 17:01:41] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 79 ms.
[2022-06-03 17:01:41] [INFO ] After 798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 847 ms.
Support contains 25 out of 775 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 775/775 places, 651/651 transitions.
Applied a total of 0 rules in 33 ms. Remains 775 /775 variables (removed 0) and now considering 651/651 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 775/775 places, 651/651 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 775/775 places, 651/651 transitions.
Applied a total of 0 rules in 19 ms. Remains 775 /775 variables (removed 0) and now considering 651/651 (removed 0) transitions.
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 17:01:42] [INFO ] Computed 328 place invariants in 2 ms
[2022-06-03 17:01:43] [INFO ] Implicit Places using invariants in 577 ms returned []
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 17:01:43] [INFO ] Computed 328 place invariants in 1 ms
[2022-06-03 17:01:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-06-03 17:01:44] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
[2022-06-03 17:01:44] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 17:01:44] [INFO ] Computed 328 place invariants in 2 ms
[2022-06-03 17:01:44] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 775/775 places, 651/651 transitions.
Partial Free-agglomeration rule applied 161 times.
Drop transitions removed 161 transitions
Iterating global reduction 0 with 161 rules applied. Total rules applied 161 place count 775 transition count 651
Applied a total of 161 rules in 36 ms. Remains 775 /775 variables (removed 0) and now considering 651/651 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 17:01:44] [INFO ] Computed 328 place invariants in 2 ms
[2022-06-03 17:01:44] [INFO ] [Real]Absence check using 328 positive place invariants in 43 ms returned sat
[2022-06-03 17:01:44] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 17:01:44] [INFO ] [Nat]Absence check using 328 positive place invariants in 44 ms returned sat
[2022-06-03 17:01:45] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 17:01:45] [INFO ] State equation strengthened by 149 read => feed constraints.
[2022-06-03 17:01:45] [INFO ] After 122ms SMT Verify possible using 149 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 17:01:45] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2022-06-03 17:01:45] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2022-06-03 17:01:45] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2022-06-03 17:01:46] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2022-06-03 17:01:46] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2022-06-03 17:01:46] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 0 ms to minimize.
[2022-06-03 17:01:46] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2022-06-03 17:01:46] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2022-06-03 17:01:46] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2022-06-03 17:01:47] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2022-06-03 17:01:47] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2022-06-03 17:01:47] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2022-06-03 17:01:47] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2022-06-03 17:01:47] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2022-06-03 17:01:47] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2427 ms
[2022-06-03 17:01:48] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2022-06-03 17:01:48] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 1 ms to minimize.
[2022-06-03 17:01:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2022-06-03 17:01:48] [INFO ] After 3005ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 107 ms.
[2022-06-03 17:01:48] [INFO ] After 3581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 17:01:48] [INFO ] Flatten gal took : 188 ms
[2022-06-03 17:01:48] [INFO ] Flatten gal took : 117 ms
[2022-06-03 17:01:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12679410921671077886.gal : 37 ms
[2022-06-03 17:01:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12294750717667980022.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12679410921671077886.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12294750717667980022.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality12294750717667980022.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 72
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :72 after 1296
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1296 after 72000
Reachability property ShieldPPPt-PT-030B-ReachabilityFireability-03 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :72000 after 74494
Reachability property ShieldPPPt-PT-030B-ReachabilityFireability-13 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,101136,0.575193,10556,2,2634,15,18172,6,0,3674,8693,0
Total reachable state count : 101136

Verifying 2 reachability properties.
Reachability property ShieldPPPt-PT-030B-ReachabilityFireability-03 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
ShieldPPPt-PT-030B-ReachabilityFireability-03,18,0.577712,10556,2,804,15,18172,7,0,3682,8693,0
Reachability property ShieldPPPt-PT-030B-ReachabilityFireability-13 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
ShieldPPPt-PT-030B-ReachabilityFireability-13,10372,0.732061,10812,2,1275,15,18172,8,0,3742,8693,0
[2022-06-03 17:01:49] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5767556658766566378
[2022-06-03 17:01:50] [INFO ] Applying decomposition
[2022-06-03 17:01:50] [INFO ] Flatten gal took : 64 ms
[2022-06-03 17:01:50] [INFO ] Computing symmetric may disable matrix : 651 transitions.
[2022-06-03 17:01:50] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 17:01:50] [INFO ] Computing symmetric may enable matrix : 651 transitions.
[2022-06-03 17:01:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 17:01:50] [INFO ] Flatten gal took : 122 ms
[2022-06-03 17:01:50] [INFO ] Input system was already deterministic with 651 transitions.
[2022-06-03 17:01:50] [INFO ] Computing Do-Not-Accords matrix : 651 transitions.
[2022-06-03 17:01:50] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 17:01:50] [INFO ] Built C files in 634ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5767556658766566378
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/graph15932980884574548828.txt' '-o' '/tmp/graph15932980884574548828.bin' '-w' '/tmp/graph15932980884574548828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15932980884574548828.bin' '-l' '-1' '-v' '-w' '/tmp/graph15932980884574548828.weights' '-q' '0' '-e' '0.001'
Running compilation step : cd /tmp/ltsmin5767556658766566378;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
[2022-06-03 17:01:51] [INFO ] Ran tautology test, simplified 0 / 2 in 691 ms.
[2022-06-03 17:01:51] [INFO ] Decomposing Gal with order
[2022-06-03 17:01:51] [INFO ] BMC solution for property ShieldPPPt-PT-030B-ReachabilityFireability-03(UNSAT) depth K=0 took 34 ms
[2022-06-03 17:01:51] [INFO ] BMC solution for property ShieldPPPt-PT-030B-ReachabilityFireability-13(UNSAT) depth K=0 took 1 ms
[2022-06-03 17:01:51] [INFO ] BMC solution for property ShieldPPPt-PT-030B-ReachabilityFireability-03(UNSAT) depth K=1 took 27 ms
[2022-06-03 17:01:51] [INFO ] BMC solution for property ShieldPPPt-PT-030B-ReachabilityFireability-13(UNSAT) depth K=1 took 2 ms
[2022-06-03 17:01:51] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 651 rows 775 cols
[2022-06-03 17:01:51] [INFO ] Computed 328 place invariants in 2 ms
[2022-06-03 17:01:51] [INFO ] Computed 328 place invariants in 3 ms
[2022-06-03 17:01:51] [INFO ] Removed a total of 412 redundant transitions.
[2022-06-03 17:01:51] [INFO ] Flatten gal took : 408 ms
[2022-06-03 17:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 50 ms.
[2022-06-03 17:01:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17656388771465866916.gal : 34 ms
[2022-06-03 17:01:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4680497666626604559.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17656388771465866916.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4680497666626604559.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/ReachabilityFireability4680497666626604559.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 72
[2022-06-03 17:01:53] [INFO ] Proved 775 variables to be positive in 1493 ms
[2022-06-03 17:01:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-030B-ReachabilityFireability-03
[2022-06-03 17:01:53] [INFO ] KInduction solution for property ShieldPPPt-PT-030B-ReachabilityFireability-03(SAT) depth K=0 took 123 ms
[2022-06-03 17:01:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-030B-ReachabilityFireability-13
[2022-06-03 17:01:53] [INFO ] KInduction solution for property ShieldPPPt-PT-030B-ReachabilityFireability-13(SAT) depth K=0 took 140 ms
[2022-06-03 17:01:53] [INFO ] BMC solution for property ShieldPPPt-PT-030B-ReachabilityFireability-03(UNSAT) depth K=2 took 2622 ms
[2022-06-03 17:01:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-030B-ReachabilityFireability-03
[2022-06-03 17:01:53] [INFO ] KInduction solution for property ShieldPPPt-PT-030B-ReachabilityFireability-03(SAT) depth K=1 took 542 ms
[2022-06-03 17:01:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-030B-ReachabilityFireability-13
[2022-06-03 17:01:54] [INFO ] KInduction solution for property ShieldPPPt-PT-030B-ReachabilityFireability-13(SAT) depth K=1 took 569 ms
Compilation finished in 4804 ms.
Running link step : cd /tmp/ltsmin5767556658766566378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 96 ms.
Running LTSmin : cd /tmp/ltsmin5767556658766566378;'/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' '-i' 'ShieldPPPtPT030BReachabilityFireability03==true'
[2022-06-03 17:01:59] [INFO ] BMC solution for property ShieldPPPt-PT-030B-ReachabilityFireability-13(UNSAT) depth K=2 took 5185 ms
[2022-06-03 17:03:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-030B-ReachabilityFireability-03
[2022-06-03 17:03:31] [INFO ] KInduction solution for property ShieldPPPt-PT-030B-ReachabilityFireability-03(SAT) depth K=2 took 97143 ms
[2022-06-03 17:04:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-030B-ReachabilityFireability-13
[2022-06-03 17:04:03] [INFO ] KInduction solution for property ShieldPPPt-PT-030B-ReachabilityFireability-13(SAT) depth K=2 took 32145 ms
[2022-06-03 17:05:37] [INFO ] BMC solution for property ShieldPPPt-PT-030B-ReachabilityFireability-03(UNSAT) depth K=3 took 218591 ms
[2022-06-03 17:07:53] [INFO ] BMC solution for property ShieldPPPt-PT-030B-ReachabilityFireability-13(UNSAT) depth K=3 took 136169 ms
[2022-06-03 17:14:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-030B-ReachabilityFireability-03
[2022-06-03 17:14:05] [INFO ] KInduction solution for property ShieldPPPt-PT-030B-ReachabilityFireability-03(SAT) depth K=3 took 601264 ms

BK_STOP 1654276757681

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-030B"
export BK_EXAMINATION="ReachabilityFireability"
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-030B, examination is ReachabilityFireability"
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-165286025600655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030B.tgz
mv ShieldPPPt-PT-030B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;