fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r189-tall-174889272200213
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ResIsolation-PT-N12P2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 368993.00 0.00 0.00 F normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r189-tall-174889272200213.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ResIsolation-PT-N12P2, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tall-174889272200213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 211M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 211M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748938260830

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ResIsolation-PT-N12P2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2025-06-03 08:11:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-03 08:11:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 08:11:08] [INFO ] Load time of PNML (sax parser for PT used): 6639 ms
[2025-06-03 08:11:09] [INFO ] Transformed 425 places.
[2025-06-03 08:11:09] [INFO ] Transformed 147837 transitions.
[2025-06-03 08:11:09] [INFO ] Found NUPN structural information;
[2025-06-03 08:11:09] [INFO ] Parsed PT model containing 425 places and 147837 transitions and 4129543 arcs in 7689 ms.
Graph (trivial) has 368 edges and 425 vertex of which 36 / 425 are part of one of the 12 SCC in 25 ms
Free SCC test removed 24 places
Structural test allowed to assert that 155 places are NOT stable. Took 560 ms.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
RANDOM walk for 40000 steps (545 resets) in 42227 ms. (0 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 42 ms. (9 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 24 ms. (16 steps per ms) remains 270/270 properties
BEST_FIRST walk for 402 steps (8 resets) in 27 ms. (14 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 38 ms. (10 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 41 ms. (9 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 44 ms. (8 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 33 ms. (11 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 25 ms. (15 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 37 ms. (10 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 58 ms. (6 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 34 ms. (11 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 30 ms. (13 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 60 ms. (6 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 25 ms. (15 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 26 ms. (14 steps per ms) remains 270/270 properties
BEST_FIRST walk for 401 steps (8 resets) in 25 ms. (15 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 44 ms. (8 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 35 ms. (11 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 76 ms. (5 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 66 ms. (6 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 54 ms. (7 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 40 ms. (9 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 31 ms. (12 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 43 ms. (9 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 36 ms. (10 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 38 ms. (10 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 34 ms. (11 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 38 ms. (10 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 42 ms. (9 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 438 ms. (0 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 34 ms. (11 steps per ms) remains 270/270 properties
BEST_FIRST walk for 402 steps (8 resets) in 27 ms. (14 steps per ms) remains 270/270 properties
BEST_FIRST walk for 402 steps (8 resets) in 46 ms. (8 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 28 ms. (13 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 36 ms. (10 steps per ms) remains 270/270 properties
BEST_FIRST walk for 401 steps (8 resets) in 43 ms. (9 steps per ms) remains 270/270 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 40 ms. (9 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 40 ms. (9 steps per ms) remains 270/270 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 36 ms. (10 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (8 resets) in 36 ms. (10 steps per ms) remains 270/270 properties
[2025-06-03 08:11:49] [INFO ] Flatten gal took : 33018 ms
Interrupted probabilistic random walk after 62432 steps, run timeout after 36011 ms. (steps per millisecond=1 ) properties seen :168 out of 270
Probabilistic random walk after 62432 steps, saw 52504 distinct states, run finished after 36017 ms. (steps per millisecond=1 ) properties seen :168
[2025-06-03 08:12:01] [INFO ] Flow matrix only has 147802 transitions (discarded 11 similar events)
// Phase 1: matrix 147802 rows 401 cols
[2025-06-03 08:12:04] [INFO ] Computed 14 invariants in 3259 ms
[2025-06-03 08:12:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 299/401 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 299/415 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 102 unsolved
SMT process timed out in 11582ms, After SMT, problems are : Problem set: 0 solved, 102 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 147813/147813 transitions.
Graph (complete) has 6070 edges and 401 vertex of which 359 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1043 ms
Discarding 42 places :
Also discarding 28 output transitions
Drop transitions (Output transitions of discarded places.) removed 28 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 359 transition count 147711
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 123 place count 311 transition count 147711
Discarding 126 places :
Symmetric choice reduction at 2 with 126 rule applications. Total rules 249 place count 185 transition count 147585
Iterating global reduction 2 with 126 rules applied. Total rules applied 375 place count 185 transition count 147585
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
[2025-06-03 08:12:21] [INFO ] Flatten gal took : 31459 ms
Iterating post reduction 2 with 8 rules applied. Total rules applied 383 place count 185 transition count 147577
[2025-06-03 08:12:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6933883282770918677.gal : 3368 ms
[2025-06-03 08:12:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15815511163695302294.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6933883282770918677.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15815511163695302294.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Performed 13 Post agglomeration using F-continuation condition.
Performed 15 Post agglomeration using F-continuation condition.
ITS-tools command line returned an error code 137
Performed 17 Post agglomeration using F-continuation condition.
[2025-06-03 08:14:30] [INFO ] Flatten gal took : 49176 ms
[2025-06-03 08:14:30] [INFO ] Applying decomposition
Performed 20 Post agglomeration using F-continuation condition.
[2025-06-03 08:15:03] [INFO ] Flatten gal took : 32333 ms
Performed 23 Post agglomeration using F-continuation condition.
Performed 25 Post agglomeration using F-continuation condition.
[2025-06-03 08:16:12] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4148331862503212505.txt' '-o' '/tmp/graph4148331862503212505.bin' '-w' '/tmp/graph4148331862503212505.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:71)
at java.base/java.lang.Thread.run(Thread.java:1583)
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 53 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 435 place count 159 transition count 147551
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 436 place count 159 transition count 147550
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 437 place count 158 transition count 147549
Applied a total of 437 rules in 264648 ms. Remains 158 /401 variables (removed 243) and now considering 147549/147813 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264681 ms. Remains : 158/401 places, 147549/147813 transitions.
[2025-06-03 08:16:48] [INFO ] Flatten gal took : 36118 ms
[2025-06-03 08:16:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13981627680957249971.gal : 3997 ms
[2025-06-03 08:16:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality314545146998993402.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13981627680957249971.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality314545146998993402.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 1278 steps (17 resets) in 120324 ms. (0 steps per ms) remains 0/102 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 272 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 367008 ms.

BK_STOP 1748938629823

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

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

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="ResIsolation-PT-N12P2"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool itstools"
echo " Input is ResIsolation-PT-N12P2, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tall-174889272200213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ResIsolation-PT-N12P2.tgz
mv ResIsolation-PT-N12P2 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;