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.r136-tall-171631131900102.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 Dekker-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631131900102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 20:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 11 20:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 20:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 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 247K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-00
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-01
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-02
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-03
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-04
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-05
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-06
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-07
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-08
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-09
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-10
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-11
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-12
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-13
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-14
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716336099186

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-22 00:01:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:01:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:01:40] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-22 00:01:40] [INFO ] Transformed 100 places.
[2024-05-22 00:01:40] [INFO ] Transformed 440 transitions.
[2024-05-22 00:01:40] [INFO ] Found NUPN structural information;
[2024-05-22 00:01:40] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:01:41] [INFO ] Flatten gal took : 241 ms
RANDOM walk for 40000 steps (8 resets) in 2157 ms. (18 steps per ms) remains 6/10 properties
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:01:41] [INFO ] Flatten gal took : 53 ms
[2024-05-22 00:01:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17410384639269279802.gal : 82 ms
[2024-05-22 00:01:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18219649788096354538.prop : 2 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/ReachabilityCardinality17410384639269279802.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18219649788096354538.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 781 ms. (51 steps per ms) remains 6/6 properties

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
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality18219649788096354538.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 16
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :16 after 128
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :128 after 8192
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1029 ms. (38 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 5/6 properties
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-22 00:01:42] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2024-05-22 00:01:42] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 00:01:42] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem Dekker-PT-020-ReachabilityCardinality-2024-10 is UNSAT
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 14/85 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 7/92 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 22/93 variables, 25/117 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 22/139 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 7/146 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/94 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/100 variables, 6/154 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 6/160 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/100 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 80/180 variables, 100/260 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/180 variables, 20/280 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/180 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/180 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 280 constraints, problems are : Problem set: 1 solved, 4 unsolved in 453 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 100/100 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 64/64 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 8/72 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/78 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 8 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:01:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 11/89 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 5/94 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/95 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem Dekker-PT-020-ReachabilityCardinality-2024-09 is UNSAT
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 24/88 variables, 29/124 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 24/148 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 6/154 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
Problem Dekker-PT-020-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 8/162 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:01:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :8192 after 524380
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 6/168 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/89 variables, 1/169 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 1/170 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/89 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 9/98 variables, 8/178 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/98 variables, 9/187 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/98 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/100 variables, 2/189 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/100 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/100 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 80/180 variables, 100/291 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/180 variables, 20/311 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/180 variables, 2/313 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 7 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/180 variables, 8/321 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/180 variables, 1/322 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-22 00:01:44] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 8 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/180 variables, 1/323 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/180 variables, 0/323 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/180 variables, 0/323 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 323 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1874 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 100/100 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 41/41 constraints]
After SMT, in 2425ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 238 ms.
Support contains 53 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 32 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 100/100 places, 440/440 transitions.
RANDOM walk for 40000 steps (8 resets) in 412 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :524380 after 589824
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.15343e+07,4.73247,9156,2,329,11,15599,12,0,1026,4457,0
Total reachable state count : 11534336

Verifying 6 reachability properties.
Invariant property Dekker-PT-020-ReachabilityCardinality-2024-00 does not hold.
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-020-ReachabilityCardinality-2024-00,16384,4.73808,9464,2,143,11,15599,12,0,1080,4457,0
Invariant property Dekker-PT-020-ReachabilityCardinality-2024-04 does not hold.
FORMULA Dekker-PT-020-ReachabilityCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-020-ReachabilityCardinality-2024-04,12288,4.7421,9464,2,229,11,15599,12,0,1103,4457,0
Invariant property Dekker-PT-020-ReachabilityCardinality-2024-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-020-ReachabilityCardinality-2024-05,0,4.7441,9464,1,0,11,15599,12,0,1128,4457,0
Invariant property Dekker-PT-020-ReachabilityCardinality-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-020-ReachabilityCardinality-2024-09,0,4.74454,9464,1,0,11,15599,12,0,1129,4457,0
Reachability property Dekker-PT-020-ReachabilityCardinality-2024-10 does not hold.
No reachable states exhibit your property : Dekker-PT-020-ReachabilityCardinality-2024-10

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-020-ReachabilityCardinality-2024-10,0,4.74788,9464,1,0,11,15599,12,0,1164,4457,0
Reachability property Dekker-PT-020-ReachabilityCardinality-2024-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-020-ReachabilityCardinality-2024-15,221184,4.75023,9464,2,405,11,15599,12,0,1169,4457,0
Interrupted probabilistic random walk after 572796 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :0 out of 2
Probabilistic random walk after 572796 steps, saw 311307 distinct states, run finished after 3013 ms. (steps per millisecond=190 ) properties seen :0
All properties solved without resorting to model-checking.
Total runtime 7808 ms.

BK_STOP 1716336108144

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is Dekker-PT-020, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631131900102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-020.tgz
mv Dekker-PT-020 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;