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-171620175500073.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-04b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-smll-171620175500073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 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 91K 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 1716216145762

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-20 14:42:28] [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:42:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:42:28] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2024-05-20 14:42:28] [INFO ] Transformed 390 places.
[2024-05-20 14:42:28] [INFO ] Transformed 388 transitions.
[2024-05-20 14:42:28] [INFO ] Found NUPN structural information;
[2024-05-20 14:42:28] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 463 ms.
Structural test allowed to assert that 231 places are NOT stable. Took 20 ms.
[2024-05-20 14:42:29] [INFO ] Flatten gal took : 192 ms
[2024-05-20 14:42:30] [INFO ] Flatten gal took : 99 ms
[2024-05-20 14:42:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17846715243835872124.gal : 58 ms
[2024-05-20 14:42:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8743641825023922668.prop : 4 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/ReachabilityCardinality17846715243835872124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8743641825023922668.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 ...329
Loading property file /tmp/ReachabilityCardinality8743641825023922668.prop.
SDD proceeding with computation,159 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,159 properties remain. new max is 8
SDD size :3 after 8
RANDOM walk for 40000 steps (197 resets) in 4955 ms. (8 steps per ms) remains 52/159 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
SDD proceeding with computation,159 properties remain. new max is 16
SDD size :8 after 17
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
SDD proceeding with computation,159 properties remain. new max is 32
SDD size :17 after 29
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
SDD proceeding with computation,159 properties remain. new max is 64
SDD size :29 after 471
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
SDD proceeding with computation,159 properties remain. new max is 128
SDD size :471 after 198981
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
SDD proceeding with computation,159 properties remain. new max is 256
SDD size :198981 after 3.86947e+10
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
SDD proceeding with computation,159 properties remain. new max is 512
SDD size :3.86947e+10 after 1.99419e+17
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 52/52 properties
// Phase 1: matrix 388 rows 390 cols
[2024-05-20 14:42:31] [INFO ] Computed 28 invariants in 43 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 185/237 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 185/247 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Invariant property smplace_389 does not hold.
Invariant property smplace_377 does not hold.
Invariant property smplace_360 does not hold.
Invariant property smplace_343 does not hold.
Invariant property smplace_326 does not hold.
Invariant property smplace_312 does not hold.
Invariant property smplace_276 does not hold.
Invariant property smplace_275 does not hold.
Invariant property smplace_274 does not hold.
Invariant property smplace_142 does not hold.
Invariant property smplace_140 does not hold.
Invariant property smplace_103 does not hold.
Invariant property smplace_101 does not hold.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 52 unsolved
SDD proceeding with computation,146 properties remain. new max is 512
SDD size :9.65089e+21 after 9.65091e+21
At refinement iteration 5 (OVERLAPS) 146/383 variables, 17/264 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 146/410 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 7/390 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 7/418 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 388/778 variables, 390/808 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/778 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 52 unsolved
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 Real declared 778/778 variables, and 808 constraints, problems are : Problem set: 0 solved, 52 unsolved in 5050 ms.
Refiners :[Domain max(s): 390/390 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 185/237 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 185/247 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-20 14:42:36] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 19 ms to minimize.
[2024-05-20 14:42:37] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 6 ms to minimize.
[2024-05-20 14:42:37] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-20 14:42:37] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 4/251 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 146/383 variables, 17/268 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 146/414 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-20 14:42:38] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-20 14:42:38] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-20 14:42:38] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-20 14:42:39] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 7/390 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 7/426 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-20 14:42:40] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 2 ms to minimize.
[2024-05-20 14:42:40] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 3 ms to minimize.
[2024-05-20 14:42:40] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 14 ms to minimize.
[2024-05-20 14:42:40] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 3 ms to minimize.
[2024-05-20 14:42:40] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
[2024-05-20 14:42:40] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-20 14:42:41] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-05-20 14:42:41] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 4 ms to minimize.
[2024-05-20 14:42:41] [INFO ] Deduced a trap composed of 62 places in 224 ms of which 4 ms to minimize.
SMT process timed out in 10217ms, After SMT, problems are : Problem set: 0 solved, 52 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 390 transition count 259
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 154 rules applied. Total rules applied 283 place count 261 transition count 234
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 291 place count 253 transition count 234
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 291 place count 253 transition count 193
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 373 place count 212 transition count 193
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 395 place count 190 transition count 171
Iterating global reduction 3 with 22 rules applied. Total rules applied 417 place count 190 transition count 171
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 417 place count 190 transition count 159
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 441 place count 178 transition count 159
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 521 place count 138 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 524 place count 138 transition count 116
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 540 place count 138 transition count 100
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 556 place count 122 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 557 place count 121 transition count 99
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 13 rules applied. Total rules applied 570 place count 112 transition count 95
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 574 place count 108 transition count 95
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 574 place count 108 transition count 85
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 594 place count 98 transition count 85
Applied a total of 594 rules in 184 ms. Remains 98 /390 variables (removed 292) and now considering 85/388 (removed 303) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 98/390 places, 85/388 transitions.
RANDOM walk for 603 steps (0 resets) in 33 ms. (17 steps per ms) remains 0/52 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 160 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 13428 ms.

BK_STOP 1716216161821

--------------------
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-04b"
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-04b, 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-171620175500073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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