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.r294-smll-165463872600206.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 StigmergyCommit-PT-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872600206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 6.5K May 30 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 30 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 30 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 30 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 25 13:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.1K May 30 15:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 30 15:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 30 15:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 30 15:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 51M May 29 12:20 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 StigmergyCommit-PT-09a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654807701250

Running Version 202205111006
[2022-06-09 20:48:23] [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-09 20:48:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 20:48:28] [INFO ] Load time of PNML (sax parser for PT used): 3803 ms
[2022-06-09 20:48:28] [INFO ] Transformed 364 places.
[2022-06-09 20:48:28] [INFO ] Transformed 50444 transitions.
[2022-06-09 20:48:28] [INFO ] Found NUPN structural information;
[2022-06-09 20:48:28] [INFO ] Parsed PT model containing 364 places and 50444 transitions in 4725 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 2378 ms. (steps per millisecond=4 ) properties (out of 13) seen :2
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-06-09 20:48:32] [INFO ] Flow matrix only has 2490 transitions (discarded 30 similar events)
// Phase 1: matrix 2490 rows 364 cols
[2022-06-09 20:48:32] [INFO ] Computed 11 place invariants in 86 ms
[2022-06-09 20:48:33] [INFO ] After 703ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-09 20:48:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2022-06-09 20:48:35] [INFO ] After 1931ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2022-06-09 20:48:36] [INFO ] State equation strengthened by 2185 read => feed constraints.
[2022-06-09 20:48:37] [INFO ] After 1511ms SMT Verify possible using 2185 Read/Feed constraints in natural domain returned unsat :4 sat :7
[2022-06-09 20:48:39] [INFO ] Deduced a trap composed of 19 places in 1457 ms of which 16 ms to minimize.
[2022-06-09 20:48:40] [INFO ] Deduced a trap composed of 17 places in 1376 ms of which 4 ms to minimize.
[2022-06-09 20:48:42] [INFO ] Deduced a trap composed of 17 places in 951 ms of which 3 ms to minimize.
[2022-06-09 20:48:43] [INFO ] Deduced a trap composed of 16 places in 858 ms of which 2 ms to minimize.
[2022-06-09 20:48:44] [INFO ] Deduced a trap composed of 17 places in 928 ms of which 2 ms to minimize.
[2022-06-09 20:48:44] [INFO ] Deduced a trap composed of 17 places in 748 ms of which 1 ms to minimize.
[2022-06-09 20:48:45] [INFO ] Deduced a trap composed of 16 places in 577 ms of which 1 ms to minimize.
[2022-06-09 20:48:46] [INFO ] Deduced a trap composed of 16 places in 579 ms of which 2 ms to minimize.
[2022-06-09 20:48:46] [INFO ] Deduced a trap composed of 16 places in 412 ms of which 1 ms to minimize.
[2022-06-09 20:48:47] [INFO ] Deduced a trap composed of 17 places in 699 ms of which 1 ms to minimize.
[2022-06-09 20:48:48] [INFO ] Deduced a trap composed of 17 places in 729 ms of which 1 ms to minimize.
[2022-06-09 20:48:49] [INFO ] Deduced a trap composed of 16 places in 415 ms of which 2 ms to minimize.
[2022-06-09 20:48:49] [INFO ] Deduced a trap composed of 16 places in 431 ms of which 1 ms to minimize.
[2022-06-09 20:48:50] [INFO ] Deduced a trap composed of 18 places in 279 ms of which 1 ms to minimize.
[2022-06-09 20:48:50] [INFO ] Deduced a trap composed of 16 places in 289 ms of which 1 ms to minimize.
[2022-06-09 20:48:50] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 2 ms to minimize.
[2022-06-09 20:48:51] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 13082 ms
[2022-06-09 20:48:52] [INFO ] Deduced a trap composed of 17 places in 991 ms of which 1 ms to minimize.
[2022-06-09 20:48:53] [INFO ] Deduced a trap composed of 17 places in 859 ms of which 1 ms to minimize.
[2022-06-09 20:48:54] [INFO ] Deduced a trap composed of 16 places in 732 ms of which 1 ms to minimize.
[2022-06-09 20:48:54] [INFO ] Deduced a trap composed of 16 places in 582 ms of which 1 ms to minimize.
[2022-06-09 20:48:55] [INFO ] Deduced a trap composed of 16 places in 439 ms of which 1 ms to minimize.
[2022-06-09 20:48:56] [INFO ] Deduced a trap composed of 16 places in 704 ms of which 2 ms to minimize.
[2022-06-09 20:48:56] [INFO ] Deduced a trap composed of 16 places in 572 ms of which 0 ms to minimize.
[2022-06-09 20:48:57] [INFO ] Deduced a trap composed of 18 places in 812 ms of which 3 ms to minimize.
[2022-06-09 20:48:58] [INFO ] Deduced a trap composed of 16 places in 749 ms of which 1 ms to minimize.
[2022-06-09 20:48:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-09 20:48:58] [INFO ] After 25176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2915 ms.
Support contains 51 out of 364 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Graph (complete) has 873 edges and 364 vertex of which 355 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.48 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 355 transition count 2447
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 60 rules applied. Total rules applied 125 place count 321 transition count 2421
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 12 rules applied. Total rules applied 137 place count 315 transition count 2415
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 147 place count 309 transition count 2411
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 147 place count 309 transition count 2351
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 267 place count 249 transition count 2351
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 309 place count 207 transition count 2309
Iterating global reduction 4 with 42 rules applied. Total rules applied 351 place count 207 transition count 2309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 354 place count 207 transition count 2306
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 383 place count 178 transition count 2275
Iterating global reduction 5 with 29 rules applied. Total rules applied 412 place count 178 transition count 2275
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 419 place count 178 transition count 2268
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 426 place count 171 transition count 2261
Iterating global reduction 6 with 7 rules applied. Total rules applied 433 place count 171 transition count 2261
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 445 place count 171 transition count 2249
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 447 place count 169 transition count 2247
Iterating global reduction 7 with 2 rules applied. Total rules applied 449 place count 169 transition count 2247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 450 place count 169 transition count 2246
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 472 place count 158 transition count 2235
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 476 place count 158 transition count 2231
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 482 place count 152 transition count 2225
Iterating global reduction 9 with 6 rules applied. Total rules applied 488 place count 152 transition count 2225
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 491 place count 149 transition count 2222
Iterating global reduction 9 with 3 rules applied. Total rules applied 494 place count 149 transition count 2222
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 496 place count 147 transition count 2220
Iterating global reduction 9 with 2 rules applied. Total rules applied 498 place count 147 transition count 2220
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 510 place count 147 transition count 2208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 514 place count 145 transition count 2206
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 516 place count 143 transition count 2204
Iterating global reduction 9 with 2 rules applied. Total rules applied 518 place count 143 transition count 2204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 519 place count 143 transition count 2203
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 531 place count 143 transition count 2191
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 543 place count 131 transition count 2191
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 544 place count 131 transition count 2190
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 552 place count 131 transition count 2190
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 558 place count 131 transition count 2184
Applied a total of 558 rules in 6861 ms. Remains 131 /364 variables (removed 233) and now considering 2184/2520 (removed 336) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/364 places, 2184/2520 transitions.
Interrupted random walk after 146299 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen 6
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1299 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2184 rows 131 cols
[2022-06-09 20:49:39] [INFO ] Computed 10 place invariants in 21 ms
[2022-06-09 20:49:39] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 20:49:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-09 20:49:40] [INFO ] After 895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 20:49:42] [INFO ] State equation strengthened by 2122 read => feed constraints.
[2022-06-09 20:49:42] [INFO ] After 436ms SMT Verify possible using 2122 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 20:49:44] [INFO ] Deduced a trap composed of 7 places in 1299 ms of which 1 ms to minimize.
[2022-06-09 20:49:45] [INFO ] Deduced a trap composed of 10 places in 1145 ms of which 1 ms to minimize.
[2022-06-09 20:49:46] [INFO ] Deduced a trap composed of 11 places in 970 ms of which 1 ms to minimize.
[2022-06-09 20:49:47] [INFO ] Deduced a trap composed of 7 places in 1148 ms of which 1 ms to minimize.
[2022-06-09 20:49:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 4888 ms
[2022-06-09 20:49:47] [INFO ] After 5353ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-06-09 20:49:47] [INFO ] After 7760ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA StigmergyCommit-PT-09a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 83843 ms.

BK_STOP 1654807787817

--------------------
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="StigmergyCommit-PT-09a"
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 StigmergyCommit-PT-09a, 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 r294-smll-165463872600206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-09a.tgz
mv StigmergyCommit-PT-09a 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 ;