Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r008-oct2-177944369700183.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-01b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-oct2-177944369700183
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.9K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 293K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1779654348389

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202604301425
[2026-05-24 20:25:50] [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]
[2026-05-24 20:25:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 20:25:50] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2026-05-24 20:25:50] [INFO ] Transformed 846 places.
[2026-05-24 20:25:50] [INFO ] Transformed 1148 transitions.
[2026-05-24 20:25:50] [INFO ] Found NUPN structural information;
[2026-05-24 20:25:50] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 253 ms.
Structural test allowed to assert that 96 places are NOT stable. Took 15 ms.
[2026-05-24 20:25:51] [INFO ] Flatten gal took : 222 ms
RANDOM walk for 40000 steps (239 resets) in 2281 ms. (17 steps per ms) remains 54/750 properties
BEST_FIRST walk for 4004 steps (9 resets) in 60 ms. (65 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (11 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
[2026-05-24 20:25:51] [INFO ] Flatten gal took : 126 ms
BEST_FIRST walk for 4004 steps (9 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (9 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
[2026-05-24 20:25:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13673557963298682948.gal : 67 ms
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
[2026-05-24 20:25:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14246880442939224852.prop : 1 ms
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
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/ReachabilityCardinality13673557963298682948.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14246880442939224852.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 54/54 properties

its-reach command run as :

BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 54/54 properties
Loading property file /tmp/ReachabilityCardinality14246880442939224852.prop.
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (9 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (10 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5430916801151895966.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2085454523399444884.kers'
[2026-05-24 20:25:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5430916801151895966.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2085454523399444884.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1148 rows 846 cols 3624 entries
Finished phase 1 with 548 SingleSign rule and 216 generalized
[2026-05-24 20:25:51] [INFO ] Computed 82 invariants in 5 ms
Computed 82 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-2085454523399444884.kers
Total runtime 7 ms.
SDD proceeding with computation,54 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,54 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,54 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,54 properties remain. new max is 32
SDD size :13 after 46
SDD proceeding with computation,54 properties remain. new max is 64
SDD size :46 after 178
SDD proceeding with computation,54 properties remain. new max is 128
SDD size :178 after 571
SDD proceeding with computation,54 properties remain. new max is 256
SDD size :571 after 689
SDD proceeding with computation,54 properties remain. new max is 512
SDD size :689 after 10045
SDD proceeding with computation,54 properties remain. new max is 1024
SDD size :10045 after 28954
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
SDD proceeding with computation,54 properties remain. new max is 2048
SDD size :28954 after 435646
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 25/79 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 201/280 variables, 10/98 constraints. Problems are: Problem set: 0 solved, 54 unsolved
SDD proceeding with computation,54 properties remain. new max is 4096
SDD size :435646 after 9.83056e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 201/299 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 54 unsolved
SDD proceeding with computation,54 properties remain. new max is 8192
SDD size :9.83056e+07 after 1.00295e+08
At refinement iteration 10 (OVERLAPS) 524/804 variables, 45/344 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/804 variables, 524/868 constraints. Problems are: Problem set: 0 solved, 54 unsolved
SDD proceeding with computation,54 properties remain. new max is 16384
SDD size :1.00295e+08 after 1.16726e+08
At refinement iteration 12 (INCLUDED_ONLY) 0/804 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 42/846 variables, 18/886 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/846 variables, 42/928 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/846 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 54 unsolved
SDD proceeding with computation,54 properties remain. new max is 32768
SDD size :1.16726e+08 after 1.59208e+08
At refinement iteration 16 (OVERLAPS) 1148/1994 variables, 846/1774 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1994/1994 variables, and 1774 constraints, problems are : Problem set: 0 solved, 54 unsolved in 5069 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 69/69 constraints, State Equation: 846/846 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 25/79 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 201/280 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 201/300 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 524/804 variables, 45/345 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/804 variables, 524/869 constraints. Problems are: Problem set: 0 solved, 54 unsolved
SDD proceeding with computation,54 properties remain. new max is 65536
SDD size :1.59208e+08 after 1.88343e+09
SMT process timed out in 10439ms, After SMT, problems are : Problem set: 0 solved, 54 unsolved
Fused 54 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 54 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 177 rules applied. Total rules applied 177 place count 846 transition count 971
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 187 rules applied. Total rules applied 364 place count 669 transition count 961
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 367 place count 666 transition count 961
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 367 place count 666 transition count 782
Deduced a syphon composed of 179 places in 4 ms
Ensure Unique test removed 12 places
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 3 with 370 rules applied. Total rules applied 737 place count 475 transition count 782
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 10 rules applied. Total rules applied 747 place count 474 transition count 773
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 756 place count 465 transition count 773
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 756 place count 465 transition count 769
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 768 place count 457 transition count 769
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 768 place count 457 transition count 765
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 776 place count 453 transition count 765
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 798 place count 431 transition count 743
Iterating global reduction 5 with 22 rules applied. Total rules applied 820 place count 431 transition count 743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 821 place count 431 transition count 742
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 821 place count 431 transition count 734
Deduced a syphon composed of 8 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 17 rules applied. Total rules applied 838 place count 422 transition count 734
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 838 place count 422 transition count 733
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 841 place count 420 transition count 733
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 843 place count 418 transition count 718
Iterating global reduction 6 with 2 rules applied. Total rules applied 845 place count 418 transition count 718
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 845 place count 418 transition count 717
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 847 place count 417 transition count 717
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 848 place count 416 transition count 709
Iterating global reduction 6 with 1 rules applied. Total rules applied 849 place count 416 transition count 709
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 850 place count 415 transition count 701
Iterating global reduction 6 with 1 rules applied. Total rules applied 851 place count 415 transition count 701
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 852 place count 414 transition count 693
Iterating global reduction 6 with 1 rules applied. Total rules applied 853 place count 414 transition count 693
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 854 place count 413 transition count 685
Iterating global reduction 6 with 1 rules applied. Total rules applied 855 place count 413 transition count 685
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 856 place count 412 transition count 677
Iterating global reduction 6 with 1 rules applied. Total rules applied 857 place count 412 transition count 677
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 858 place count 411 transition count 669
Iterating global reduction 6 with 1 rules applied. Total rules applied 859 place count 411 transition count 669
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 860 place count 410 transition count 661
Iterating global reduction 6 with 1 rules applied. Total rules applied 861 place count 410 transition count 661
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 862 place count 409 transition count 653
Iterating global reduction 6 with 1 rules applied. Total rules applied 863 place count 409 transition count 653
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 864 place count 408 transition count 645
Iterating global reduction 6 with 1 rules applied. Total rules applied 865 place count 408 transition count 645
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 866 place count 407 transition count 637
Iterating global reduction 6 with 1 rules applied. Total rules applied 867 place count 407 transition count 637
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 868 place count 406 transition count 629
Iterating global reduction 6 with 1 rules applied. Total rules applied 869 place count 406 transition count 629
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 870 place count 405 transition count 621
Iterating global reduction 6 with 1 rules applied. Total rules applied 871 place count 405 transition count 621
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 872 place count 404 transition count 613
Iterating global reduction 6 with 1 rules applied. Total rules applied 873 place count 404 transition count 613
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 874 place count 403 transition count 605
Iterating global reduction 6 with 1 rules applied. Total rules applied 875 place count 403 transition count 605
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 876 place count 402 transition count 597
Iterating global reduction 6 with 1 rules applied. Total rules applied 877 place count 402 transition count 597
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 878 place count 401 transition count 589
Iterating global reduction 6 with 1 rules applied. Total rules applied 879 place count 401 transition count 589
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 955 place count 363 transition count 551
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 956 place count 362 transition count 550
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 958 place count 361 transition count 550
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 959 place count 360 transition count 549
Iterating global reduction 6 with 1 rules applied. Total rules applied 960 place count 360 transition count 549
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 962 place count 360 transition count 547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 963 place count 359 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 965 place count 358 transition count 556
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 968 place count 358 transition count 553
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 971 place count 355 transition count 553
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 972 place count 354 transition count 552
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 973 place count 353 transition count 552
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 973 place count 353 transition count 551
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 975 place count 352 transition count 551
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 976 place count 351 transition count 551
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 980 place count 349 transition count 549
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 981 place count 348 transition count 548
Iterating global reduction 11 with 1 rules applied. Total rules applied 982 place count 348 transition count 548
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 983 place count 348 transition count 547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 984 place count 347 transition count 547
Applied a total of 984 rules in 553 ms. Remains 347 /846 variables (removed 499) and now considering 547/1148 (removed 601) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 565 ms. Remains : 347/846 places, 547/1148 transitions.
Invariant property smplace_457 does not hold.
Invariant property smplace_456 does not hold.
Invariant property smplace_455 does not hold.
Invariant property smplace_429 does not hold.
Invariant property smplace_422 does not hold.
Invariant property smplace_421 does not hold.
Invariant property smplace_419 does not hold.
Invariant property smplace_418 does not hold.
Invariant property smplace_417 does not hold.
Invariant property smplace_416 does not hold.
Invariant property smplace_415 does not hold.
Invariant property smplace_414 does not hold.
Invariant property smplace_64 does not hold.
Invariant property smplace_63 does not hold.
Invariant property smplace_62 does not hold.
Invariant property smplace_61 does not hold.
Invariant property smplace_60 does not hold.
Invariant property smplace_59 does not hold.
Invariant property smplace_58 does not hold.
Invariant property smplace_56 does not hold.
Invariant property smplace_46 does not hold.
SDD proceeding with computation,33 properties remain. new max is 65536
SDD size :1.88343e+09 after 2.30125e+09
RANDOM walk for 4000000 steps (85260 resets) in 34329 ms. (116 steps per ms) remains 15/54 properties
BEST_FIRST walk for 400004 steps (3664 resets) in 979 ms. (408 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400000 steps (3704 resets) in 1211 ms. (330 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (3637 resets) in 1165 ms. (343 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (3686 resets) in 932 ms. (428 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (3717 resets) in 964 ms. (414 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (3666 resets) in 1142 ms. (349 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (3652 resets) in 1103 ms. (362 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (3691 resets) in 1209 ms. (330 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (3713 resets) in 1641 ms. (243 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (3675 resets) in 1008 ms. (396 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (3689 resets) in 1103 ms. (362 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400000 steps (3657 resets) in 1252 ms. (319 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (3718 resets) in 1405 ms. (284 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (3740 resets) in 1119 ms. (357 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (3690 resets) in 1271 ms. (314 steps per ms) remains 15/15 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12860786832680877367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12919940970702587648.kers'
[2026-05-24 20:26:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12860786832680877367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12919940970702587648.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 547 rows 344 cols 2073 entries
Finished phase 1 with 107 SingleSign rule and 180 generalized
[2026-05-24 20:26:24] [INFO ] Computed 60 invariants in 3 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12919940970702587648.kers
Total runtime 5 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 25/47 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 80/127 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 28/155 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 26/181 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 119/300 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 44/344 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/346 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/346 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1/347 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/347 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 547/894 variables, 347/407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/894 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/894 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 894/894 variables, and 407 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 25/47 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 80/127 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 28/155 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 26/181 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 119/300 variables, 16/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 44/344 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 2/346 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/346 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1/347 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/347 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 547/894 variables, 347/407 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/894 variables, 10/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/894 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/894 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/894 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 0/894 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 894/894 variables, and 418 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3292 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4408ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Invariant property smplace_428 does not hold.
SDD proceeding with computation,32 properties remain. new max is 65536
SDD size :2.30125e+09 after 7.29738e+09
Parikh walk visited 0 properties in 3671 ms.
Support contains 9 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 547/547 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 347 transition count 537
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 337 transition count 537
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 20 place count 337 transition count 528
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 39 place count 327 transition count 528
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 327 transition count 527
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 43 place count 325 transition count 526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 324 transition count 526
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 9 rules applied. Total rules applied 53 place count 319 transition count 522
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 53 place count 319 transition count 520
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 57 place count 317 transition count 520
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 58 place count 316 transition count 520
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 58 place count 316 transition count 519
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 60 place count 315 transition count 519
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 62 place count 314 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 314 transition count 518
Applied a total of 63 rules in 125 ms. Remains 314 /347 variables (removed 33) and now considering 518/547 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 314/347 places, 518/547 transitions.
RANDOM walk for 3187414 steps (68210 resets) in 15505 ms. (205 steps per ms) remains 0/9 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 751 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL
Total runtime 47392 ms.

BK_STOP 1779654397518

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 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="ASLink-PT-01b"
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-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-01b, 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 r008-oct2-177944369700183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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