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.r079-tall-171620515800098.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 CANInsertWithFailure-PT-080, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r079-tall-171620515800098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 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 39M 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 1716213972420

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CANInsertWithFailure-PT-080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-20 14:06:13] [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:06:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:06:14] [INFO ] Load time of PNML (sax parser for PT used): 991 ms
[2024-05-20 14:06:14] [INFO ] Transformed 13764 places.
[2024-05-20 14:06:14] [INFO ] Transformed 38880 transitions.
[2024-05-20 14:06:14] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1231 ms.
RANDOM walk for 40000 steps (20 resets) in 6698 ms. (5 steps per ms) remains 10621/13764 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 66 ms. (1 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 37 ms. (3 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 15 ms. (7 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 26 ms. (4 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 56 ms. (2 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 30 ms. (4 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 20 ms. (5 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 19 ms. (6 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 17 ms. (6 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 26 ms. (4 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 12 ms. (9 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 24 ms. (4 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 10621/10621 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 10621/10621 properties
// Phase 1: matrix 38880 rows 13764 cols
[2024-05-20 14:06:18] [INFO ] Flatten gal took : 1723 ms
[2024-05-20 14:06:19] [INFO ] Flatten gal took : 860 ms
[2024-05-20 14:06:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9270549639284125049.gal : 189 ms
[2024-05-20 14:06:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15423800178693220909.prop : 39 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/ReachabilityCardinality9270549639284125049.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15423800178693220909.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/ReachabilityCardinality15423800178693220909.prop.
[2024-05-20 14:06:28] [INFO ] Computed 83 invariants in 10644 ms
[2024-05-20 14:06:28] [INFO ] State equation strengthened by 12720 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10621/52644 variables, and 0 constraints, problems are : Problem set: 0 solved, 10621 unsolved in 5249 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13764 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 10621/10621 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10621 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10621/52644 variables, and 0 constraints, problems are : Problem set: 0 solved, 10621 unsolved in 5315 ms.
Refiners :[Positive P Invariants (semi-flows): 0/81 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/13764 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 0/10621 constraints, Known Traps: 0/0 constraints]
After SMT, in 64311ms problems are : Problem set: 0 solved, 10621 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10621 out of 13764 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Graph (complete) has 52401 edges and 13764 vertex of which 13763 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.193 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 321 place count 13763 transition count 38560
Reduce places removed 320 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 322 rules applied. Total rules applied 643 place count 13443 transition count 38558
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 645 place count 13441 transition count 38558
Performed 789 Post agglomeration using F-continuation condition.Transition count delta: 789
Deduced a syphon composed of 789 places in 20 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 3 with 1578 rules applied. Total rules applied 2223 place count 12652 transition count 37769
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2224 place count 12652 transition count 37768
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2225 place count 12651 transition count 37768
Partial Free-agglomeration rule applied 1565 times.
Drop transitions (Partial Free agglomeration) removed 1565 transitions
Iterating global reduction 4 with 1565 rules applied. Total rules applied 3790 place count 12651 transition count 37768
Applied a total of 3790 rules in 4674 ms. Remains 12651 /13764 variables (removed 1113) and now considering 37768/38880 (removed 1112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4705 ms. Remains : 12651/13764 places, 37768/38880 transitions.
RANDOM walk for 720697 steps (928 resets) in 120018 ms. (6 steps per ms) remains 22/10621 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2504 ms. (159 steps per ms) remains 20/22 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2081 ms. (192 steps per ms) remains 17/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1717 ms. (232 steps per ms) remains 15/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1689 ms. (236 steps per ms) remains 14/15 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1553 ms. (257 steps per ms) remains 14/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1707 ms. (234 steps per ms) remains 12/14 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1167 ms. (342 steps per ms) remains 8/12 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1186 ms. (336 steps per ms) remains 7/8 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1170 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1223 ms. (326 steps per ms) remains 4/7 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1162 ms. (343 steps per ms) remains 4/4 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1279 ms. (312 steps per ms) remains 3/4 properties
[2024-05-20 14:08:02] [INFO ] Flow matrix only has 37459 transitions (discarded 309 similar events)
// Phase 1: matrix 37459 rows 12651 cols
[2024-05-20 14:08:11] [INFO ] Computed 82 invariants in 8505 ms
[2024-05-20 14:08:11] [INFO ] State equation strengthened by 15465 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 12488/12491 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12491 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 156/12647 variables, 78/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12647 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/12649 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12649 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 37459/50108 variables, 12649/12731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 50108/50110 variables, and 28196 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45112 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 12649/12651 constraints, ReadFeed: 15465/15465 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 12488/12491 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 14:08:58] [INFO ] Deduced a trap composed of 5 places in 752 ms of which 42 ms to minimize.
[2024-05-20 14:08:59] [INFO ] Deduced a trap composed of 5 places in 708 ms of which 4 ms to minimize.
[2024-05-20 14:09:00] [INFO ] Deduced a trap composed of 5 places in 676 ms of which 3 ms to minimize.
[2024-05-20 14:09:01] [INFO ] Deduced a trap composed of 5 places in 637 ms of which 3 ms to minimize.
[2024-05-20 14:09:02] [INFO ] Deduced a trap composed of 5 places in 649 ms of which 3 ms to minimize.
[2024-05-20 14:09:03] [INFO ] Deduced a trap composed of 5 places in 707 ms of which 3 ms to minimize.
[2024-05-20 14:09:03] [INFO ] Deduced a trap composed of 5 places in 637 ms of which 3 ms to minimize.
[2024-05-20 14:09:04] [INFO ] Deduced a trap composed of 5 places in 624 ms of which 3 ms to minimize.
[2024-05-20 14:09:05] [INFO ] Deduced a trap composed of 5 places in 640 ms of which 2 ms to minimize.
[2024-05-20 14:09:06] [INFO ] Deduced a trap composed of 5 places in 669 ms of which 3 ms to minimize.
[2024-05-20 14:09:07] [INFO ] Deduced a trap composed of 5 places in 626 ms of which 3 ms to minimize.
[2024-05-20 14:09:07] [INFO ] Deduced a trap composed of 5 places in 646 ms of which 2 ms to minimize.
[2024-05-20 14:09:08] [INFO ] Deduced a trap composed of 5 places in 642 ms of which 3 ms to minimize.
[2024-05-20 14:09:09] [INFO ] Deduced a trap composed of 5 places in 640 ms of which 2 ms to minimize.
[2024-05-20 14:09:10] [INFO ] Deduced a trap composed of 5 places in 618 ms of which 2 ms to minimize.
[2024-05-20 14:09:10] [INFO ] Deduced a trap composed of 5 places in 618 ms of which 3 ms to minimize.
[2024-05-20 14:09:11] [INFO ] Deduced a trap composed of 5 places in 635 ms of which 3 ms to minimize.
[2024-05-20 14:09:12] [INFO ] Deduced a trap composed of 5 places in 630 ms of which 2 ms to minimize.
[2024-05-20 14:09:13] [INFO ] Deduced a trap composed of 5 places in 631 ms of which 3 ms to minimize.
[2024-05-20 14:09:14] [INFO ] Deduced a trap composed of 5 places in 649 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12491 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 14:09:14] [INFO ] Deduced a trap composed of 5 places in 621 ms of which 2 ms to minimize.
[2024-05-20 14:09:15] [INFO ] Deduced a trap composed of 5 places in 623 ms of which 3 ms to minimize.
[2024-05-20 14:09:16] [INFO ] Deduced a trap composed of 3 places in 635 ms of which 2 ms to minimize.
[2024-05-20 14:09:17] [INFO ] Deduced a trap composed of 5 places in 624 ms of which 2 ms to minimize.
[2024-05-20 14:09:17] [INFO ] Deduced a trap composed of 5 places in 625 ms of which 2 ms to minimize.
[2024-05-20 14:09:18] [INFO ] Deduced a trap composed of 5 places in 634 ms of which 2 ms to minimize.
[2024-05-20 14:09:19] [INFO ] Deduced a trap composed of 5 places in 609 ms of which 3 ms to minimize.
[2024-05-20 14:09:20] [INFO ] Deduced a trap composed of 5 places in 615 ms of which 2 ms to minimize.
[2024-05-20 14:09:21] [INFO ] Deduced a trap composed of 5 places in 604 ms of which 3 ms to minimize.
[2024-05-20 14:09:21] [INFO ] Deduced a trap composed of 5 places in 614 ms of which 2 ms to minimize.
[2024-05-20 14:09:22] [INFO ] Deduced a trap composed of 5 places in 613 ms of which 3 ms to minimize.
[2024-05-20 14:09:23] [INFO ] Deduced a trap composed of 5 places in 624 ms of which 2 ms to minimize.
[2024-05-20 14:09:24] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 3 ms to minimize.
[2024-05-20 14:09:24] [INFO ] Deduced a trap composed of 5 places in 615 ms of which 2 ms to minimize.
[2024-05-20 14:09:25] [INFO ] Deduced a trap composed of 5 places in 617 ms of which 6 ms to minimize.
[2024-05-20 14:09:26] [INFO ] Deduced a trap composed of 5 places in 612 ms of which 2 ms to minimize.
[2024-05-20 14:09:27] [INFO ] Deduced a trap composed of 5 places in 607 ms of which 2 ms to minimize.
[2024-05-20 14:09:28] [INFO ] Deduced a trap composed of 5 places in 613 ms of which 2 ms to minimize.
[2024-05-20 14:09:28] [INFO ] Deduced a trap composed of 5 places in 616 ms of which 2 ms to minimize.
[2024-05-20 14:09:29] [INFO ] Deduced a trap composed of 5 places in 605 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/12491 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 14:09:30] [INFO ] Deduced a trap composed of 5 places in 647 ms of which 2 ms to minimize.
[2024-05-20 14:09:31] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 2 ms to minimize.
[2024-05-20 14:09:31] [INFO ] Deduced a trap composed of 5 places in 610 ms of which 2 ms to minimize.
[2024-05-20 14:09:32] [INFO ] Deduced a trap composed of 5 places in 609 ms of which 2 ms to minimize.
[2024-05-20 14:09:33] [INFO ] Deduced a trap composed of 5 places in 608 ms of which 2 ms to minimize.
[2024-05-20 14:09:34] [INFO ] Deduced a trap composed of 5 places in 610 ms of which 2 ms to minimize.
[2024-05-20 14:09:34] [INFO ] Deduced a trap composed of 5 places in 610 ms of which 2 ms to minimize.
[2024-05-20 14:09:35] [INFO ] Deduced a trap composed of 5 places in 624 ms of which 1 ms to minimize.
[2024-05-20 14:09:36] [INFO ] Deduced a trap composed of 5 places in 616 ms of which 2 ms to minimize.
[2024-05-20 14:09:37] [INFO ] Deduced a trap composed of 5 places in 615 ms of which 2 ms to minimize.
[2024-05-20 14:09:38] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 3 ms to minimize.
[2024-05-20 14:09:38] [INFO ] Deduced a trap composed of 5 places in 605 ms of which 2 ms to minimize.
[2024-05-20 14:09:39] [INFO ] Deduced a trap composed of 5 places in 606 ms of which 2 ms to minimize.
[2024-05-20 14:09:40] [INFO ] Deduced a trap composed of 5 places in 608 ms of which 2 ms to minimize.
[2024-05-20 14:09:41] [INFO ] Deduced a trap composed of 5 places in 601 ms of which 2 ms to minimize.
[2024-05-20 14:09:41] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 2 ms to minimize.
SMT process timed out in 99305ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 12651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12651/12651 places, 37768/37768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 12651 transition count 37534
Reduce places removed 234 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 235 rules applied. Total rules applied 469 place count 12417 transition count 37533
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 470 place count 12416 transition count 37533
Performed 5529 Post agglomeration using F-continuation condition.Transition count delta: 5529
Deduced a syphon composed of 5529 places in 14 ms
Reduce places removed 5529 places and 0 transitions.
Iterating global reduction 3 with 11058 rules applied. Total rules applied 11528 place count 6887 transition count 32004
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11530 place count 6887 transition count 32002
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11532 place count 6885 transition count 32002
Partial Free-agglomeration rule applied 4925 times.
Drop transitions (Partial Free agglomeration) removed 4925 transitions
Iterating global reduction 4 with 4925 rules applied. Total rules applied 16457 place count 6885 transition count 32002
Applied a total of 16457 rules in 15703 ms. Remains 6885 /12651 variables (removed 5766) and now considering 32002/37768 (removed 5766) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15719 ms. Remains : 6885/12651 places, 32002/37768 transitions.
RANDOM walk for 218472 steps (454 resets) in 14175 ms. (15 steps per ms) remains 0/3 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 13764 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 228834 ms.

BK_STOP 1716214202553

--------------------
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="CANInsertWithFailure-PT-080"
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 CANInsertWithFailure-PT-080, 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 r079-tall-171620515800098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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