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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 13:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 13:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 13:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 29 13:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 29 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 13:46 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 185K 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-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654274509775

Running Version 202205111006
[2022-06-03 16:41:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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:41:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:41:51] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2022-06-03 16:41:51] [INFO ] Transformed 783 places.
[2022-06-03 16:41:51] [INFO ] Transformed 713 transitions.
[2022-06-03 16:41:51] [INFO ] Found NUPN structural information;
[2022-06-03 16:41:51] [INFO ] Parsed PT model containing 783 places and 713 transitions in 297 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 15) seen :6
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :1
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 713 rows 783 cols
[2022-06-03 16:41:52] [INFO ] Computed 111 place invariants in 22 ms
[2022-06-03 16:41:52] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-03 16:41:53] [INFO ] [Nat]Absence check using 111 positive place invariants in 36 ms returned sat
[2022-06-03 16:41:53] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2022-06-03 16:41:54] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 6 ms to minimize.
[2022-06-03 16:41:54] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 2 ms to minimize.
[2022-06-03 16:41:54] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 1 ms to minimize.
[2022-06-03 16:41:54] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2022-06-03 16:41:54] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2022-06-03 16:41:55] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2022-06-03 16:41:55] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2022-06-03 16:41:55] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 1 ms to minimize.
[2022-06-03 16:41:55] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 0 ms to minimize.
[2022-06-03 16:41:55] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2022-06-03 16:41:55] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2022-06-03 16:41:55] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2022-06-03 16:41:56] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2022-06-03 16:41:56] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2022-06-03 16:41:56] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2022-06-03 16:41:56] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 0 ms to minimize.
[2022-06-03 16:41:56] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-06-03 16:41:56] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2022-06-03 16:41:56] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2022-06-03 16:41:56] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2912 ms
[2022-06-03 16:41:57] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 1 ms to minimize.
[2022-06-03 16:41:57] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2022-06-03 16:41:57] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 5 ms to minimize.
[2022-06-03 16:41:57] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2022-06-03 16:41:57] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 0 ms to minimize.
[2022-06-03 16:41:57] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2022-06-03 16:41:58] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 1 ms to minimize.
[2022-06-03 16:41:58] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 0 ms to minimize.
[2022-06-03 16:41:58] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-06-03 16:41:58] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2022-06-03 16:41:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1567 ms
[2022-06-03 16:41:58] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2022-06-03 16:41:58] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2022-06-03 16:41:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2022-06-03 16:41:58] [INFO ] After 5652ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 279 ms.
[2022-06-03 16:41:59] [INFO ] After 6295ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5702 ms.
Support contains 63 out of 783 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 783 transition count 569
Reduce places removed 144 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 146 rules applied. Total rules applied 290 place count 639 transition count 567
Reduce places removed 1 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 15 rules applied. Total rules applied 305 place count 638 transition count 553
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 319 place count 624 transition count 553
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 319 place count 624 transition count 503
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 419 place count 574 transition count 503
Discarding 58 places :
Symmetric choice reduction at 4 with 58 rule applications. Total rules 477 place count 516 transition count 445
Iterating global reduction 4 with 58 rules applied. Total rules applied 535 place count 516 transition count 445
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 535 place count 516 transition count 425
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 575 place count 496 transition count 425
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 1 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 855 place count 356 transition count 285
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 887 place count 340 transition count 285
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 894 place count 340 transition count 278
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 901 place count 333 transition count 278
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 921 place count 333 transition count 278
Applied a total of 921 rules in 182 ms. Remains 333 /783 variables (removed 450) and now considering 278/713 (removed 435) transitions.
Finished structural reductions, in 1 iterations. Remains : 333/783 places, 278/713 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10688 ms. (steps per millisecond=93 ) properties (out of 4) seen :2
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3819 ms. (steps per millisecond=261 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3262 ms. (steps per millisecond=306 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 278 rows 333 cols
[2022-06-03 16:42:22] [INFO ] Computed 111 place invariants in 6 ms
[2022-06-03 16:42:22] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:42:23] [INFO ] [Nat]Absence check using 111 positive place invariants in 27 ms returned sat
[2022-06-03 16:42:23] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:42:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-03 16:42:23] [INFO ] After 184ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:42:23] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-06-03 16:42:23] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2022-06-03 16:42:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2022-06-03 16:42:23] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2022-06-03 16:42:24] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-06-03 16:42:24] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2022-06-03 16:42:24] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-06-03 16:42:24] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2022-06-03 16:42:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 415 ms
[2022-06-03 16:42:24] [INFO ] After 1064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2022-06-03 16:42:24] [INFO ] After 1542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 411 ms.
Support contains 59 out of 333 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 333/333 places, 278/278 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 333 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 332 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 332 transition count 276
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 331 transition count 276
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 327 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 326 transition count 272
Applied a total of 14 rules in 47 ms. Remains 326 /333 variables (removed 7) and now considering 272/278 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 326/333 places, 272/278 transitions.
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 9261 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2694 ms. (steps per millisecond=371 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3251 ms. (steps per millisecond=307 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5651424 steps, run timeout after 45001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 5651424 steps, saw 3763489 distinct states, run finished after 45003 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 272 rows 326 cols
[2022-06-03 16:43:25] [INFO ] Computed 111 place invariants in 6 ms
[2022-06-03 16:43:25] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:43:25] [INFO ] [Nat]Absence check using 111 positive place invariants in 16 ms returned sat
[2022-06-03 16:43:25] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:43:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-03 16:43:25] [INFO ] After 204ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:43:25] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2022-06-03 16:43:25] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2022-06-03 16:43:26] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2022-06-03 16:43:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 256 ms
[2022-06-03 16:43:26] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2022-06-03 16:43:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-06-03 16:43:26] [INFO ] After 674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 189 ms.
[2022-06-03 16:43:26] [INFO ] After 1146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 185 ms.
Support contains 59 out of 326 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 326/326 places, 272/272 transitions.
Applied a total of 0 rules in 11 ms. Remains 326 /326 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 326/326 places, 272/272 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 326/326 places, 272/272 transitions.
Applied a total of 0 rules in 9 ms. Remains 326 /326 variables (removed 0) and now considering 272/272 (removed 0) transitions.
// Phase 1: matrix 272 rows 326 cols
[2022-06-03 16:43:26] [INFO ] Computed 111 place invariants in 2 ms
[2022-06-03 16:43:26] [INFO ] Implicit Places using invariants in 149 ms returned [312]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 325/326 places, 272/272 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 325 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 324 transition count 271
Applied a total of 2 rules in 14 ms. Remains 324 /325 variables (removed 1) and now considering 271/272 (removed 1) transitions.
// Phase 1: matrix 271 rows 324 cols
[2022-06-03 16:43:26] [INFO ] Computed 110 place invariants in 1 ms
[2022-06-03 16:43:27] [INFO ] Implicit Places using invariants in 208 ms returned [304]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 323/326 places, 271/272 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 322 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 322 transition count 270
Applied a total of 2 rules in 19 ms. Remains 322 /323 variables (removed 1) and now considering 270/271 (removed 1) transitions.
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:43:27] [INFO ] Computed 109 place invariants in 2 ms
[2022-06-03 16:43:27] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:43:27] [INFO ] Computed 109 place invariants in 6 ms
[2022-06-03 16:43:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-03 16:43:27] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 322/326 places, 270/272 transitions.
Finished structural reductions, in 3 iterations. Remains : 322/326 places, 270/272 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8156 ms. (steps per millisecond=122 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2557 ms. (steps per millisecond=391 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3157 ms. (steps per millisecond=316 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5448339 steps, run timeout after 39001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 5448339 steps, saw 3618656 distinct states, run finished after 39001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:44:20] [INFO ] Computed 109 place invariants in 1 ms
[2022-06-03 16:44:20] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:44:20] [INFO ] [Nat]Absence check using 109 positive place invariants in 17 ms returned sat
[2022-06-03 16:44:20] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:44:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-03 16:44:21] [INFO ] After 159ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:44:21] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-06-03 16:44:21] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2022-06-03 16:44:21] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2022-06-03 16:44:21] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2022-06-03 16:44:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 335 ms
[2022-06-03 16:44:21] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2022-06-03 16:44:21] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2022-06-03 16:44:21] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2022-06-03 16:44:21] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-06-03 16:44:21] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2022-06-03 16:44:21] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2022-06-03 16:44:22] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2022-06-03 16:44:22] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2022-06-03 16:44:22] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2022-06-03 16:44:22] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 651 ms
[2022-06-03 16:44:22] [INFO ] After 1313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 128 ms.
[2022-06-03 16:44:22] [INFO ] After 1741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 422 ms.
Support contains 59 out of 322 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 322/322 places, 270/270 transitions.
Applied a total of 0 rules in 8 ms. Remains 322 /322 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 322/322 places, 270/270 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 322/322 places, 270/270 transitions.
Applied a total of 0 rules in 8 ms. Remains 322 /322 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:44:22] [INFO ] Computed 109 place invariants in 1 ms
[2022-06-03 16:44:22] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:44:22] [INFO ] Computed 109 place invariants in 1 ms
[2022-06-03 16:44:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-03 16:44:23] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2022-06-03 16:44:23] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:44:23] [INFO ] Computed 109 place invariants in 2 ms
[2022-06-03 16:44:23] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 322/322 places, 270/270 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8371 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2613 ms. (steps per millisecond=382 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3454 ms. (steps per millisecond=289 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5845994 steps, run timeout after 42001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 5845994 steps, saw 3879154 distinct states, run finished after 42001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:45:19] [INFO ] Computed 109 place invariants in 1 ms
[2022-06-03 16:45:20] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:45:20] [INFO ] [Nat]Absence check using 109 positive place invariants in 16 ms returned sat
[2022-06-03 16:45:20] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:45:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-03 16:45:20] [INFO ] After 146ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:45:20] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-06-03 16:45:20] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2022-06-03 16:45:20] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2022-06-03 16:45:20] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2022-06-03 16:45:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 333 ms
[2022-06-03 16:45:21] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2022-06-03 16:45:21] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2022-06-03 16:45:21] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2022-06-03 16:45:21] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2022-06-03 16:45:21] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2022-06-03 16:45:21] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2022-06-03 16:45:21] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2022-06-03 16:45:21] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2022-06-03 16:45:21] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2022-06-03 16:45:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 622 ms
[2022-06-03 16:45:21] [INFO ] After 1255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 124 ms.
[2022-06-03 16:45:21] [INFO ] After 1643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 406 ms.
Support contains 59 out of 322 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 322/322 places, 270/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 322 /322 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 322/322 places, 270/270 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 322/322 places, 270/270 transitions.
Applied a total of 0 rules in 7 ms. Remains 322 /322 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:45:22] [INFO ] Computed 109 place invariants in 1 ms
[2022-06-03 16:45:22] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:45:22] [INFO ] Computed 109 place invariants in 1 ms
[2022-06-03 16:45:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-03 16:45:22] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2022-06-03 16:45:22] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:45:22] [INFO ] Computed 109 place invariants in 1 ms
[2022-06-03 16:45:22] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 322/322 places, 270/270 transitions.
Partial Free-agglomeration rule applied 35 times.
Drop transitions removed 35 transitions
Iterating global reduction 0 with 35 rules applied. Total rules applied 35 place count 322 transition count 270
Applied a total of 35 rules in 14 ms. Remains 322 /322 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:45:22] [INFO ] Computed 109 place invariants in 1 ms
[2022-06-03 16:45:22] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 16:45:22] [INFO ] [Nat]Absence check using 109 positive place invariants in 16 ms returned sat
[2022-06-03 16:45:23] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 16:45:23] [INFO ] State equation strengthened by 27 read => feed constraints.
[2022-06-03 16:45:23] [INFO ] After 104ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:45:23] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2022-06-03 16:45:23] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2022-06-03 16:45:23] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2022-06-03 16:45:23] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2022-06-03 16:45:23] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2022-06-03 16:45:23] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-06-03 16:45:23] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2022-06-03 16:45:23] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2022-06-03 16:45:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 588 ms
[2022-06-03 16:45:24] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2022-06-03 16:45:24] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2022-06-03 16:45:24] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-06-03 16:45:24] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2022-06-03 16:45:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 263 ms
[2022-06-03 16:45:24] [INFO ] After 1079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 162 ms.
[2022-06-03 16:45:24] [INFO ] After 1543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 16:45:24] [INFO ] Flatten gal took : 70 ms
[2022-06-03 16:45:24] [INFO ] Flatten gal took : 29 ms
[2022-06-03 16:45:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9779992492827653810.gal : 11 ms
[2022-06-03 16:45:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6325270023405860154.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9779992492827653810.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6325270023405860154.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...319
Loading property file /tmp/ReachabilityCardinality6325270023405860154.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :9 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 141
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :141 after 2707
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2707 after 437908
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :437908 after 7.08042e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7.08042e+06 after 7.08278e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7.08278e+06 after 7.63058e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :7.63058e+06 after 1.78601e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.78601e+07 after 1.16449e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.16449e+09 after 4.35481e+11
Detected timeout of ITS tools.
[2022-06-03 16:45:39] [INFO ] Flatten gal took : 23 ms
[2022-06-03 16:45:39] [INFO ] Applying decomposition
[2022-06-03 16:45:39] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12903266389383953365.txt' '-o' '/tmp/graph12903266389383953365.bin' '-w' '/tmp/graph12903266389383953365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12903266389383953365.bin' '-l' '-1' '-v' '-w' '/tmp/graph12903266389383953365.weights' '-q' '0' '-e' '0.001'
[2022-06-03 16:45:39] [INFO ] Decomposing Gal with order
[2022-06-03 16:45:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:45:40] [INFO ] Removed a total of 56 redundant transitions.
[2022-06-03 16:45:40] [INFO ] Flatten gal took : 92 ms
[2022-06-03 16:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 10 ms.
[2022-06-03 16:45:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality45331674453506395.gal : 7 ms
[2022-06-03 16:45:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11027323071123306082.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/ReachabilityCardinality45331674453506395.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11027323071123306082.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/ReachabilityCardinality11027323071123306082.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 61
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :61 after 157
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :157 after 157
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :157 after 8.7583e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :8.7583e+06 after 3.32596e+13
Invariant property ShieldPPPt-PT-010B-ReachabilityCardinality-09 does not hold.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.32596e+13 after 1.04528e+20
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.04528e+20 after 1.85619e+24
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11820064892793820644
[2022-06-03 16:45:55] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11820064892793820644
Running compilation step : cd /tmp/ltsmin11820064892793820644;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 551 ms.
Running link step : cd /tmp/ltsmin11820064892793820644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin11820064892793820644;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldPPPtPT010BReachabilityCardinality07==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 16:46:10] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2022-06-03 16:46:10] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin12826981099151553197
[2022-06-03 16:46:10] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2022-06-03 16:46:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:46:10] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2022-06-03 16:46:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:46:10] [INFO ] Flatten gal took : 20 ms
[2022-06-03 16:46:10] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4636578194904520883.txt' '-o' '/tmp/graph4636578194904520883.bin' '-w' '/tmp/graph4636578194904520883.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4636578194904520883.bin' '-l' '-1' '-v' '-w' '/tmp/graph4636578194904520883.weights' '-q' '0' '-e' '0.001'
[2022-06-03 16:46:10] [INFO ] Input system was already deterministic with 270 transitions.
[2022-06-03 16:46:10] [INFO ] Decomposing Gal with order
[2022-06-03 16:46:10] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2022-06-03 16:46:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 16:46:10] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 16:46:10] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12826981099151553197
Running compilation step : cd /tmp/ltsmin12826981099151553197;'/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 16:46:10] [INFO ] Removed a total of 88 redundant transitions.
[2022-06-03 16:46:10] [INFO ] Flatten gal took : 28 ms
[2022-06-03 16:46:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 9 ms.
[2022-06-03 16:46:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14432675841601829343.gal : 6 ms
[2022-06-03 16:46:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17919252892981060788.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14432675841601829343.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17919252892981060788.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...300
Loading property file /tmp/ReachabilityCardinality17919252892981060788.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2801 after 16801
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :16801 after 1.2488e+06
[2022-06-03 16:46:10] [INFO ] Ran tautology test, simplified 0 / 2 in 223 ms.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.2488e+06 after 3.06534e+09
[2022-06-03 16:46:10] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(UNSAT) depth K=0 took 8 ms
[2022-06-03 16:46:10] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(UNSAT) depth K=0 took 1 ms
[2022-06-03 16:46:10] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(UNSAT) depth K=1 took 1 ms
[2022-06-03 16:46:10] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(UNSAT) depth K=1 took 5 ms
[2022-06-03 16:46:10] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(UNSAT) depth K=2 took 38 ms
[2022-06-03 16:46:10] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(UNSAT) depth K=2 took 12 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 270 rows 322 cols
[2022-06-03 16:46:10] [INFO ] Computed 109 place invariants in 1 ms
[2022-06-03 16:46:10] [INFO ] Computed 109 place invariants in 2 ms
[2022-06-03 16:46:10] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(UNSAT) depth K=3 took 259 ms
Compilation finished in 696 ms.
Running link step : cd /tmp/ltsmin12826981099151553197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin12826981099151553197;'/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' 'ShieldPPPtPT010BReachabilityCardinality07==true'
[2022-06-03 16:46:11] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(UNSAT) depth K=3 took 273 ms
[2022-06-03 16:46:11] [INFO ] Proved 322 variables to be positive in 620 ms
[2022-06-03 16:46:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-07
[2022-06-03 16:46:11] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(SAT) depth K=0 took 78 ms
[2022-06-03 16:46:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-09
[2022-06-03 16:46:11] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(SAT) depth K=0 took 53 ms
[2022-06-03 16:46:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-07
[2022-06-03 16:46:11] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(SAT) depth K=1 took 132 ms
[2022-06-03 16:46:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-09
[2022-06-03 16:46:11] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(SAT) depth K=1 took 92 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.90455e+09 after 2.5905e+25
[2022-06-03 16:46:24] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(UNSAT) depth K=4 took 13452 ms
[2022-06-03 16:46:43] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(UNSAT) depth K=4 took 18351 ms
[2022-06-03 16:47:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-07
[2022-06-03 16:47:10] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(SAT) depth K=2 took 58683 ms
[2022-06-03 16:47:29] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-09
[2022-06-03 16:47:29] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(SAT) depth K=2 took 19251 ms
[2022-06-03 16:48:08] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(UNSAT) depth K=5 took 85494 ms
[2022-06-03 16:49:44] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(UNSAT) depth K=5 took 95514 ms
[2022-06-03 16:51:36] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-07
[2022-06-03 16:51:36] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(SAT) depth K=3 took 246672 ms
[2022-06-03 16:51:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-09
[2022-06-03 16:51:44] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(SAT) depth K=3 took 7876 ms
[2022-06-03 16:52:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-07
[2022-06-03 16:52:30] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(SAT) depth K=4 took 46410 ms
[2022-06-03 16:54:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-09
[2022-06-03 16:54:14] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(SAT) depth K=4 took 103836 ms
[2022-06-03 16:54:43] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(UNSAT) depth K=6 took 299908 ms
[2022-06-03 16:58:36] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-09(UNSAT) depth K=6 took 232069 ms
Detected timeout of ITS tools.
[2022-06-03 17:07:36] [INFO ] Applying decomposition
[2022-06-03 17:07:37] [INFO ] Flatten gal took : 42 ms
[2022-06-03 17:07:37] [INFO ] Decomposing Gal with order
[2022-06-03 17:07:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 17:07:37] [INFO ] Removed a total of 93 redundant transitions.
[2022-06-03 17:07:37] [INFO ] Flatten gal took : 72 ms
[2022-06-03 17:07:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 33 ms.
[2022-06-03 17:07:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16089425338617988735.gal : 28 ms
[2022-06-03 17:07:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6269160210508672156.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16089425338617988735.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6269160210508672156.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/ReachabilityCardinality6269160210508672156.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 49
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :49 after 265
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :265 after 265
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :265 after 8.81771e+08
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :8.81771e+08 after 1.69079e+17
Invariant property ShieldPPPt-PT-010B-ReachabilityCardinality-09 does not hold.
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.69079e+17 after 6.42372e+24
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.42372e+24 after 3.10603e+27
[2022-06-03 17:14:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-010B-ReachabilityCardinality-07
[2022-06-03 17:14:45] [INFO ] KInduction solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(SAT) depth K=5 took 1230730 ms
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin12826981099151553197;'/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' 'ShieldPPPtPT010BReachabilityCardinality07==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin12826981099151553197;'/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' 'ShieldPPPtPT010BReachabilityCardinality07==true'
[2022-06-03 17:18:31] [INFO ] BMC solution for property ShieldPPPt-PT-010B-ReachabilityCardinality-07(UNSAT) depth K=7 took 1195376 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.4722e+40,335.579,2192524,1559,350,2.90618e+06,8945,909,1.15643e+07,169,110121,0
Total reachable state count : 3.47219519914869648883337345864525980631e+40

Verifying 2 reachability properties.
Invariant property ShieldPPPt-PT-010B-ReachabilityCardinality-07 does not hold.
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-010B-ReachabilityCardinality-07,1.95187e+38,336.418,2192524,1131,285,2.90618e+06,8945,929,1.15643e+07,178,110121,1241
Invariant property ShieldPPPt-PT-010B-ReachabilityCardinality-09 does not hold.

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-010B-ReachabilityCardinality-09,4.40422e+38,336.452,2192524,965,279,2.90618e+06,8945,1175,1.15643e+07,192,110121,6068
[2022-06-03 17:23:01] [WARNING] Interrupting SMT solver.
[2022-06-03 17:23:01] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 17:23:01] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldPPPt-PT-010B-ReachabilityCardinality-07 SMT depth 8
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-03 17:23:01] [INFO ] During BMC, SMT solver timed out at depth 8
[2022-06-03 17:23:01] [INFO ] BMC solving timed out (3600000 secs) at depth 8
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 17:23:01] [WARNING] Unexpected error occurred while running SMT. Was verifying ShieldPPPt-PT-010B-ReachabilityCardinality-07 K-induction depth 6
Exception in thread "Thread-12" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-03 17:23:01] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2471016 ms.

BK_STOP 1654276982015

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

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