Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107900486.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is LeafsetExtension-PT-S16C3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107900486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 11K Mar 7 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 7 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K Mar 15 11:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 15 11:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 15 11:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Mar 7 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Mar 7 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 7 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Mar 15 11:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 905K Mar 3 18:30 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-S16C3-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779917184918

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S16C3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-27 21:26:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 21:26:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 21:26:28] [INFO ] Load time of PNML (sax parser for PT used): 400 ms
[2026-05-27 21:26:28] [INFO ] Transformed 1542 places.
[2026-05-27 21:26:28] [INFO ] Transformed 1449 transitions.
[2026-05-27 21:26:28] [INFO ] Parsed PT model containing 1542 places and 1449 transitions and 4668 arcs in 654 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1533 resets) in 3425 ms. (11 steps per ms) remains 15/16 properties
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (16 resets) in 95 ms. (41 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 85 ms. (46 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 159 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 123 ms. (32 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 137 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (15 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
[2026-05-27 21:26:29] [INFO ] Flatten gal took : 569 ms
BEST_FIRST walk for 4004 steps (16 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 54 ms. (72 steps per ms) remains 15/15 properties
[2026-05-27 21:26:29] [INFO ] Flatten gal took : 209 ms
[2026-05-27 21:26:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7194263579337106919.gal : 197 ms
[2026-05-27 21:26:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2408964573200199258.prop : 17 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7194263579337106919.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2408964573200199258.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2408964573200199258.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :12 after 14
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :14 after 15
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :15 after 16
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :16 after 17
Interrupted probabilistic random walk after 82241 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 15
Probabilistic random walk after 82241 steps, saw 28914 distinct states, run finished after 3008 ms. (steps per millisecond=27 ) properties seen :0
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :17 after 24
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :24 after 25
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8773963980458353212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9840845897253924421.kers'
[2026-05-27 21:26:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8773963980458353212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9840845897253924421.kers]
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :25 after 33
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 2 ms.
// Phase 1: matrix 1449 rows 1522 cols 4036 entries
Finished phase 1 with 879 SingleSign rule and 570 generalized
[2026-05-27 21:26:32] [INFO ] Computed 93 invariants in 24 ms
Computed 93 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-9840845897253924421.kers
Total runtime 31 ms.
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :33 after 46
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :46 after 64
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :64 after 97
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :97 after 168
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-00 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-01 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-02 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-04 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-08 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-12 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-15 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 1087/1357 variables, 26/26 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1357 variables, 1/27 constraints. Problems are: Problem set: 10 solved, 5 unsolved
SDD proceeding with computation,15 properties remain. new max is 16384
SDD size :168 after 299
At refinement iteration 3 (INCLUDED_ONLY) 0/1357 variables, 0/27 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 8/1365 variables, 8/35 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1365 variables, 0/35 constraints. Problems are: Problem set: 10 solved, 5 unsolved
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-09 is UNSAT
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 174/1539 variables, 55/90 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/90 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/1541 variables, 2/92 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1541 variables, 0/92 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1542 variables, 1/93 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1542 variables, 0/93 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1449/2991 variables, 1542/1635 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2991 variables, 0/1635 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/2991 variables, 0/1635 constraints. Problems are: Problem set: 12 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2991/2991 variables, and 1635 constraints, problems are : Problem set: 12 solved, 3 unsolved in 4867 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 1542/1542 constraints, PredecessorRefiner: 15/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 3 unsolved
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :299 after 5616
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1193/1241 variables, 17/17 constraints. Problems are: Problem set: 12 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1241 variables, 3/20 constraints. Problems are: Problem set: 12 solved, 3 unsolved
SMT process timed out in 10965ms, After SMT, problems are : Problem set: 12 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 1542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1542/1542 places, 1449/1449 transitions.
Graph (complete) has 2953 edges and 1542 vertex of which 890 are kept as prefixes of interest. Removing 652 places using SCC suffix rule.10 ms
Discarding 652 places :
Also discarding 248 output transitions
Drop transitions (Output transitions of discarded places.) removed 248 transitions
Drop transitions (Empty/Sink Transition effects.) removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 303 transitions
Trivial Post-agglo rules discarded 303 transitions
Performed 303 trivial Post agglomeration. Transition count delta: 303
Iterating post reduction 0 with 416 rules applied. Total rules applied 417 place count 890 transition count 785
Reduce places removed 304 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 311 rules applied. Total rules applied 728 place count 586 transition count 778
Reduce places removed 7 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 24 rules applied. Total rules applied 752 place count 579 transition count 761
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 769 place count 562 transition count 761
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 769 place count 562 transition count 735
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 821 place count 536 transition count 735
Discarding 117 places :
Symmetric choice reduction at 4 with 117 rule applications. Total rules 938 place count 419 transition count 618
Iterating global reduction 4 with 117 rules applied. Total rules applied 1055 place count 419 transition count 618
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1062 place count 412 transition count 611
Iterating global reduction 4 with 7 rules applied. Total rules applied 1069 place count 412 transition count 611
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 1070 place count 411 transition count 611
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1072 place count 410 transition count 610
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 5 with 15 rules applied. Total rules applied 1087 place count 410 transition count 595
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1102 place count 395 transition count 595
Partial Free-agglomeration rule applied 61 times.
Drop transitions (Partial Free agglomeration) removed 61 transitions
Iterating global reduction 6 with 61 rules applied. Total rules applied 1163 place count 395 transition count 595
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 1166 place count 392 transition count 595
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1168 place count 392 transition count 593
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1170 place count 390 transition count 593
Applied a total of 1170 rules in 574 ms. Remains 390 /1542 variables (removed 1152) and now considering 593/1449 (removed 856) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 390/1542 places, 593/1449 transitions.
RANDOM walk for 40000 steps (3138 resets) in 1064 ms. (37 steps per ms) remains 1/3 properties
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (238 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
[2026-05-27 21:26:44] [INFO ] Flow matrix only has 551 transitions (discarded 42 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13140773263888772013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13192070607897254721.kers'
[2026-05-27 21:26:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13140773263888772013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13192070607897254721.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 551 rows 388 cols 1569 entries
Finished phase 1 with 302 SingleSign rule and 59 generalized
[2026-05-27 21:26:44] [INFO ] Computed 29 invariants in 2 ms
Computed 29 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13192070607897254721.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/181 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/293 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 322/615 variables, 209/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 8/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/638 variables, 11/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/638 variables, 17/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/638 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 226/864 variables, 78/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/864 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/864 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 73/937 variables, 62/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/937 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 4/941 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/941 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/941 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 941/941 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 166/181 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 112/293 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 322/615 variables, 209/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/615 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/638 variables, 11/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/638 variables, 17/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/638 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 226/864 variables, 78/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/864 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/864 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 73/937 variables, 62/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/937 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/941 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/941 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/941 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 941/941 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1481ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
FORMULA LeafsetExtension-PT-S16C3-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 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 18946 ms.

BK_STOP 1779917206419

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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-S16C3"
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-5973"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S16C3, 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 r162-smll-177961107900486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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