fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r078-tall-165260110800742
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for FamilyReunion-PT-L00100M0010C005P005G002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2710.044 332313.00 390807.00 586.70 FTTTTTFFTFFTFFFT normal

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.r078-tall-165260110800742.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 FamilyReunion-PT-L00100M0010C005P005G002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110800742
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 40M
-rw-r--r-- 1 mcc users 469K Apr 30 09:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.8M Apr 30 09:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 30 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 30 09:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 194K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 782K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 362K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 970K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 890K Apr 30 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.4M Apr 30 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 30 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.5M Apr 30 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 48K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 17M May 10 09:33 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 FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654195184789

Running Version 202205111006
[2022-06-02 18:39:46] [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-02 18:39:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 18:39:47] [INFO ] Load time of PNML (sax parser for PT used): 898 ms
[2022-06-02 18:39:47] [INFO ] Transformed 40605 places.
[2022-06-02 18:39:47] [INFO ] Transformed 36871 transitions.
[2022-06-02 18:39:47] [INFO ] Parsed PT model containing 40605 places and 36871 transitions in 1221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11879 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 31 places and 0 transitions.
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1135 ms. (steps per millisecond=8 ) properties (out of 15) seen :2
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2568 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1004 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 36871 rows 40574 cols
[2022-06-02 18:40:18] [INFO ] Computed 8805 place invariants in 12475 ms
[2022-06-02 18:40:34] [INFO ] After 15986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-06-02 18:40:50] [INFO ] [Nat]Absence check using 300 positive place invariants in 1086 ms returned sat
[2022-06-02 18:40:59] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-02 18:40:59] [INFO ] [Nat]Absence check using 300 positive and 8505 generalized place invariants in 9361 ms returned unknown
[2022-06-02 18:40:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 18:40:59] [INFO ] After 25128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19469 out of 40574 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Graph (complete) has 65258 edges and 40574 vertex of which 40544 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.80 ms
Discarding 30 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Discarding 2218 places :
Implicit places reduction removed 2218 places
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 2318 rules applied. Total rules applied 2319 place count 38326 transition count 36765
Reduce places removed 100 places and 0 transitions.
Performed 2210 Post agglomeration using F-continuation condition.Transition count delta: 2210
Iterating post reduction 1 with 2310 rules applied. Total rules applied 4629 place count 38226 transition count 34555
Reduce places removed 2210 places and 0 transitions.
Iterating post reduction 2 with 2210 rules applied. Total rules applied 6839 place count 36016 transition count 34555
Performed 705 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 705 Pre rules applied. Total rules applied 6839 place count 36016 transition count 33850
Deduced a syphon composed of 705 places in 114 ms
Reduce places removed 705 places and 0 transitions.
Iterating global reduction 3 with 1410 rules applied. Total rules applied 8249 place count 35311 transition count 33850
Discarding 605 places :
Implicit places reduction removed 605 places
Iterating post reduction 3 with 605 rules applied. Total rules applied 8854 place count 34706 transition count 33850
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 64 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 9256 place count 34505 transition count 33649
Free-agglomeration rule (complex) applied 1110 times.
Iterating global reduction 4 with 1110 rules applied. Total rules applied 10366 place count 34505 transition count 32539
Reduce places removed 1110 places and 0 transitions.
Iterating post reduction 4 with 1110 rules applied. Total rules applied 11476 place count 33395 transition count 32539
Reduce places removed 101 places and 101 transitions.
Iterating global reduction 5 with 101 rules applied. Total rules applied 11577 place count 33294 transition count 32438
Applied a total of 11577 rules in 7093 ms. Remains 33294 /40574 variables (removed 7280) and now considering 32438/36871 (removed 4433) transitions.
Finished structural reductions, in 1 iterations. Remains : 33294/40574 places, 32438/36871 transitions.
Interrupted random walk after 406557 steps, including 85 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 4
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 19418 steps, including 0 resets, run timeout after 5237 ms. (steps per millisecond=3 ) properties seen 0
Interrupted Best-First random walk after 71232 steps, including 0 resets, run timeout after 5009 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3247 ms. (steps per millisecond=307 ) properties (out of 9) seen :0
Interrupted Best-First random walk after 184732 steps, including 0 resets, run timeout after 5004 ms. (steps per millisecond=36 ) properties seen 0
Interrupted Best-First random walk after 48668 steps, including 0 resets, run timeout after 5040 ms. (steps per millisecond=9 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3204 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3797 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3364 ms. (steps per millisecond=297 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3197 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 32438 rows 33294 cols
[2022-06-02 18:42:17] [INFO ] Computed 5973 place invariants in 2974 ms
[2022-06-02 18:42:26] [INFO ] After 9163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-02 18:42:35] [INFO ] [Nat]Absence check using 299 positive place invariants in 830 ms returned sat
[2022-06-02 18:42:45] [INFO ] [Nat]Absence check using 299 positive and 5674 generalized place invariants in 9067 ms returned sat
[2022-06-02 18:45:07] [INFO ] After 140803ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :1
[2022-06-02 18:45:11] [INFO ] After 144500ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 1284 ms.
[2022-06-02 18:45:12] [INFO ] After 166018ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3660 ms.
Support contains 8 out of 33294 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33294/33294 places, 32438/32438 transitions.
Graph (complete) has 55958 edges and 33294 vertex of which 14981 are kept as prefixes of interest. Removing 18313 places using SCC suffix rule.15 ms
Discarding 18313 places :
Also discarding 18805 output transitions
Drop transitions removed 18805 transitions
Drop transitions removed 1092 transitions
Reduce isomorphic transitions removed 1092 transitions.
Discarding 3382 places :
Implicit places reduction removed 3382 places
Drop transitions removed 10121 transitions
Trivial Post-agglo rules discarded 10121 transitions
Performed 10121 trivial Post agglomeration. Transition count delta: 10121
Iterating post reduction 0 with 14595 rules applied. Total rules applied 14596 place count 11599 transition count 2420
Reduce places removed 10121 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 10125 rules applied. Total rules applied 24721 place count 1478 transition count 2416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24725 place count 1474 transition count 2416
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 24725 place count 1474 transition count 2412
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 24733 place count 1470 transition count 2412
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 24734 place count 1469 transition count 2412
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 24734 place count 1469 transition count 2411
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 24736 place count 1468 transition count 2411
Discarding 95 places :
Symmetric choice reduction at 4 with 95 rule applications. Total rules 24831 place count 1373 transition count 2316
Iterating global reduction 4 with 95 rules applied. Total rules applied 24926 place count 1373 transition count 2316
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 33 rules applied. Total rules applied 24959 place count 1367 transition count 2289
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 24971 place count 1355 transition count 2289
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 24971 place count 1355 transition count 2285
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 24979 place count 1351 transition count 2285
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 24989 place count 1341 transition count 2245
Iterating global reduction 6 with 10 rules applied. Total rules applied 24999 place count 1341 transition count 2245
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 6 with 4 rules applied. Total rules applied 25003 place count 1337 transition count 2245
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 25003 place count 1337 transition count 2241
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 25011 place count 1333 transition count 2241
Discarding 1006 places :
Symmetric choice reduction at 7 with 1006 rule applications. Total rules 26017 place count 327 transition count 1235
Iterating global reduction 7 with 1006 rules applied. Total rules applied 27023 place count 327 transition count 1235
Ensure Unique test removed 1006 transitions
Reduce isomorphic transitions removed 1006 transitions.
Iterating post reduction 7 with 1006 rules applied. Total rules applied 28029 place count 327 transition count 229
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 97 Pre rules applied. Total rules applied 28029 place count 327 transition count 132
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 97 places
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 8 with 291 rules applied. Total rules applied 28320 place count 133 transition count 132
Discarding 92 places :
Symmetric choice reduction at 8 with 92 rule applications. Total rules 28412 place count 41 transition count 40
Iterating global reduction 8 with 92 rules applied. Total rules applied 28504 place count 41 transition count 40
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 28512 place count 41 transition count 32
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 28524 place count 29 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 28525 place count 29 transition count 31
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 28528 place count 29 transition count 28
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 28531 place count 26 transition count 28
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 28534 place count 26 transition count 25
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 28538 place count 26 transition count 21
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 28542 place count 22 transition count 21
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 11 with 5 rules applied. Total rules applied 28547 place count 17 transition count 16
Applied a total of 28547 rules in 883 ms. Remains 17 /33294 variables (removed 33277) and now considering 16/32438 (removed 32422) transitions.
Finished structural reductions, in 1 iterations. Remains : 17/33294 places, 16/32438 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 330839 ms.

BK_STOP 1654195517102

--------------------
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="FamilyReunion-PT-L00100M0010C005P005G002"
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 FamilyReunion-PT-L00100M0010C005P005G002, 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 r078-tall-165260110800742"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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