Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876423400799.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 LeafsetExtension-PT-S64C4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876423400799
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K 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 14M 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-00
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-01
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-02
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-03
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-04
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-05
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-06
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-07
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-08
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-09
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-10
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-11
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-12
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-13
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-14
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748904696489

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-02 22:51:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 22:51:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:51:38] [INFO ] Load time of PNML (sax parser for PT used): 791 ms
[2025-06-02 22:51:39] [INFO ] Transformed 21462 places.
[2025-06-02 22:51:39] [INFO ] Transformed 21129 transitions.
[2025-06-02 22:51:39] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 1046 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1201 resets) in 3752 ms. (10 steps per ms) remains 10/16 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (42 resets) in 354 ms. (112 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 278 ms. (143 steps per ms) remains 9/10 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (36 resets) in 637 ms. (62 steps per ms) remains 8/9 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (36 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 259 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (27 resets) in 319 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (44 resets) in 334 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (35 resets) in 461 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (37 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
// Phase 1: matrix 21129 rows 21462 cols
[2025-06-02 22:51:41] [INFO ] Flatten gal took : 1713 ms
[2025-06-02 22:51:42] [INFO ] Flatten gal took : 650 ms
[2025-06-02 22:51:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7474005170586446033.gal : 188 ms
[2025-06-02 22:51:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14873353313472030450.prop : 2 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/ReachabilityCardinality7474005170586446033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14873353313472030450.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
[2025-06-02 22:51:44] [INFO ] Computed 333 invariants in 2755 ms
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/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 24/285 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Loading property file /tmp/ReachabilityCardinality14873353313472030450.prop.
At refinement iteration 3 (OVERLAPS) 20116/20401 variables, 143/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20401/42591 variables, and 167 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5052 ms.
Refiners :[Positive P Invariants (semi-flows): 24/67 constraints, Generalized P Invariants (flows): 143/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 24/285 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20116/20401 variables, 143/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20401/42591 variables, and 167 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5033 ms.
Refiners :[Positive P Invariants (semi-flows): 24/67 constraints, Generalized P Invariants (flows): 143/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13141ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 261 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 11829 are kept as prefixes of interest. Removing 9633 places using SCC suffix rule.46 ms
Discarding 9633 places :
Also discarding 4127 output transitions
Drop transitions (Output transitions of discarded places.) removed 4127 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1245 transitions
Reduce isomorphic transitions removed 1245 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3307 transitions
Trivial Post-agglo rules discarded 3307 transitions
Performed 3307 trivial Post agglomeration. Transition count delta: 3307
Iterating post reduction 0 with 4552 rules applied. Total rules applied 4553 place count 11829 transition count 12450
Reduce places removed 3308 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 3324 rules applied. Total rules applied 7877 place count 8521 transition count 12434
Reduce places removed 16 places and 0 transitions.
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Iterating post reduction 2 with 1810 rules applied. Total rules applied 9687 place count 8505 transition count 10640
Reduce places removed 1794 places and 0 transitions.
Iterating post reduction 3 with 1794 rules applied. Total rules applied 11481 place count 6711 transition count 10640
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 82 Pre rules applied. Total rules applied 11481 place count 6711 transition count 10558
Deduced a syphon composed of 82 places in 7 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 11645 place count 6629 transition count 10558
Discarding 2744 places :
Symmetric choice reduction at 4 with 2744 rule applications. Total rules 14389 place count 3885 transition count 7814
Iterating global reduction 4 with 2744 rules applied. Total rules applied 17133 place count 3885 transition count 7814
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 17162 place count 3856 transition count 7785
Iterating global reduction 4 with 29 rules applied. Total rules applied 17191 place count 3856 transition count 7785
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 4 with 19 rules applied. Total rules applied 17210 place count 3856 transition count 7766
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 17229 place count 3837 transition count 7766
Partial Free-agglomeration rule applied 412 times.
Drop transitions (Partial Free agglomeration) removed 412 transitions
Iterating global reduction 5 with 412 rules applied. Total rules applied 17641 place count 3837 transition count 7766
Applied a total of 17641 rules in 4839 ms. Remains 3837 /21462 variables (removed 17625) and now considering 7766/21129 (removed 13363) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4851 ms. Remains : 3837/21462 places, 7766/21129 transitions.
RANDOM walk for 40000 steps (2293 resets) in 2373 ms. (16 steps per ms) remains 6/8 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (48 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (26 resets) in 231 ms. (172 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (41 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (55 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (44 resets) in 270 ms. (147 steps per ms) remains 6/6 properties
[2025-06-02 22:52:00] [INFO ] Flow matrix only has 6803 transitions (discarded 963 similar events)
// Phase 1: matrix 6803 rows 3837 cols
[2025-06-02 22:52:00] [INFO ] Computed 126 invariants in 98 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2037/2296 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2296 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/2297 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2297 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-07 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 5302/7599 variables, 2297/2366 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7599 variables, 0/2366 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2652/10251 variables, 1151/3517 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10251 variables, 49/3566 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10251 variables, 0/3566 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 381/10632 variables, 8/3574 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/10632 variables, 381/3955 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/10632 variables, 0/3955 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 8/10640 variables, 8/3963 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/10640 variables, 0/3963 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/10640 variables, 0/3963 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10640/10640 variables, and 3963 constraints, problems are : Problem set: 1 solved, 5 unsolved in 20066 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 3837/3837 constraints, PredecessorRefiner: 6/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1945/2176 variables, 65/65 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2176 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/2177 variables, 1/66 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2177 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5107/7284 variables, 2177/2243 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7284 variables, 0/2243 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2879/10163 variables, 1185/3428 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10163 variables, 48/3476 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10163 variables, 1/3477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/10163 variables, 0/3477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 461/10624 variables, 12/3489 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/10624 variables, 459/3948 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/10624 variables, 0/3948 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 16/10640 variables, 16/3964 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/10640 variables, 0/3964 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/10640 variables, 0/3964 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10640/10640 variables, and 3964 constraints, problems are : Problem set: 1 solved, 5 unsolved in 24329 ms.
Refiners :[Generalized P Invariants (flows): 126/126 constraints, State Equation: 3837/3837 constraints, PredecessorRefiner: 5/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44586ms problems are : Problem set: 1 solved, 5 unsolved
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-11 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
FORMULA LeafsetExtension-PT-S64C4-ReachabilityFireability-2025-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 116 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 67135 ms.

BK_STOP 1748904765213

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S64C4, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876423400799"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C4.tgz
mv LeafsetExtension-PT-S64C4 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;