Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r035-smll-171620175500083.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is AutoFlight-PT-05b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-smll-171620175500083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 113K May 18 16:42 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 1716216235153

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-20 14:43:57] [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]
[2024-05-20 14:43:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:43:57] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-20 14:43:58] [INFO ] Transformed 482 places.
[2024-05-20 14:43:58] [INFO ] Transformed 480 transitions.
[2024-05-20 14:43:58] [INFO ] Found NUPN structural information;
[2024-05-20 14:43:58] [INFO ] Parsed PT model containing 482 places and 480 transitions and 1120 arcs in 587 ms.
Structural test allowed to assert that 286 places are NOT stable. Took 32 ms.
[2024-05-20 14:43:59] [INFO ] Flatten gal took : 301 ms
[2024-05-20 14:43:59] [INFO ] Flatten gal took : 98 ms
[2024-05-20 14:43:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10655704837110888381.gal : 92 ms
[2024-05-20 14:43:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16851348691576098491.prop : 7 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10655704837110888381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16851348691576098491.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16851348691576098491.prop.
RANDOM walk for 40000 steps (162 resets) in 5408 ms. (7 steps per ms) remains 75/196 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 75/75 properties
SDD proceeding with computation,196 properties remain. new max is 4
SDD size :1 after 3
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 75/75 properties
SDD proceeding with computation,196 properties remain. new max is 8
SDD size :3 after 8
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 75/75 properties
SDD proceeding with computation,196 properties remain. new max is 16
SDD size :8 after 17
SDD proceeding with computation,196 properties remain. new max is 32
SDD size :17 after 34
// Phase 1: matrix 480 rows 482 cols
SDD proceeding with computation,196 properties remain. new max is 64
SDD size :34 after 476
[2024-05-20 14:44:00] [INFO ] Computed 34 invariants in 26 ms
SDD proceeding with computation,196 properties remain. new max is 128
SDD size :476 after 198986
SDD proceeding with computation,196 properties remain. new max is 256
SDD size :198986 after 3.86947e+10
SDD proceeding with computation,196 properties remain. new max is 512
SDD size :3.86947e+10 after 8.79436e+19
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 241/316 variables, 13/88 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 241/329 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 166/482 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 166/516 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 480/962 variables, 482/998 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 (/ 1.0 36.0))
(s31 0.0)
(s32 0.0)
(s33 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 962/962 variables, and 998 constraints, problems are : Problem set: 0 solved, 75 unsolved in 5078 ms.
Refiners :[Domain max(s): 482/482 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 241/316 variables, 13/88 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 241/329 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-20 14:44:06] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 28 ms to minimize.
[2024-05-20 14:44:06] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-20 14:44:06] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 3 ms to minimize.
[2024-05-20 14:44:06] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-20 14:44:06] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-20 14:44:06] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2024-05-20 14:44:07] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-20 14:44:07] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 2 ms to minimize.
[2024-05-20 14:44:07] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 2 ms to minimize.
[2024-05-20 14:44:07] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 2 ms to minimize.
[2024-05-20 14:44:07] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 3 ms to minimize.
[2024-05-20 14:44:07] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2024-05-20 14:44:07] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 2 ms to minimize.
[2024-05-20 14:44:08] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 2 ms to minimize.
[2024-05-20 14:44:08] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-05-20 14:44:08] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2024-05-20 14:44:08] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 3 ms to minimize.
[2024-05-20 14:44:08] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 3 ms to minimize.
[2024-05-20 14:44:08] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-20 14:44:08] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-20 14:44:08] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-20 14:44:09] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 6 ms to minimize.
[2024-05-20 14:44:09] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-05-20 14:44:09] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 3 ms to minimize.
[2024-05-20 14:44:09] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-20 14:44:09] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2024-05-20 14:44:09] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-20 14:44:09] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-20 14:44:09] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-20 14:44:09] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-05-20 14:44:09] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
[2024-05-20 14:44:10] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-20 14:44:10] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-20 14:44:10] [INFO ] Deduced a trap composed of 62 places in 43 ms of which 2 ms to minimize.
[2024-05-20 14:44:10] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-20 14:44:10] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-05-20 14:44:10] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/962 variables, and 367 constraints, problems are : Problem set: 0 solved, 75 unsolved in 5018 ms.
Refiners :[Domain max(s): 316/482 constraints, Positive P Invariants (semi-flows): 13/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/482 constraints, PredecessorRefiner: 0/75 constraints, Known Traps: 37/37 constraints]
After SMT, in 10220ms problems are : Problem set: 0 solved, 75 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 482 transition count 320
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 1 with 191 rules applied. Total rules applied 351 place count 322 transition count 289
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 361 place count 312 transition count 289
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 361 place count 312 transition count 238
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 463 place count 261 transition count 238
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 487 place count 237 transition count 214
Iterating global reduction 3 with 24 rules applied. Total rules applied 511 place count 237 transition count 214
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 511 place count 237 transition count 199
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 541 place count 222 transition count 199
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 635 place count 175 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 639 place count 175 transition count 148
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 659 place count 175 transition count 128
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 679 place count 155 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 680 place count 154 transition count 127
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 11 rules applied. Total rules applied 691 place count 145 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 693 place count 143 transition count 125
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 693 place count 143 transition count 114
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 715 place count 132 transition count 114
Applied a total of 715 rules in 151 ms. Remains 132 /482 variables (removed 350) and now considering 114/480 (removed 366) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 132/482 places, 114/480 transitions.
RANDOM walk for 820 steps (0 resets) in 34 ms. (23 steps per ms) remains 0/75 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 197 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 13350 ms.

BK_STOP 1716216250802

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="AutoFlight-PT-05b"
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-5568"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-05b, 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 r035-smll-171620175500083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05b.tgz
mv AutoFlight-PT-05b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;