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.r356-tall-171683760200047.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 ShieldIIPs-PT-003B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760200047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K 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.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 14:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 49K May 18 16:43 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 ShieldIIPs-PT-003B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-003B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716879775143

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 07:02:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 07:02:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:02:56] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-28 07:02:56] [INFO ] Transformed 183 places.
[2024-05-28 07:02:56] [INFO ] Transformed 180 transitions.
[2024-05-28 07:02:56] [INFO ] Found NUPN structural information;
[2024-05-28 07:02:56] [INFO ] Parsed PT model containing 183 places and 180 transitions and 540 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (87 resets) in 1274 ms. (31 steps per ms) remains 6/16 properties
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 07:02:57] [INFO ] Flatten gal took : 173 ms
[2024-05-28 07:02:57] [INFO ] Flatten gal took : 57 ms
BEST_FIRST walk for 40003 steps (12 resets) in 866 ms. (46 steps per ms) remains 6/6 properties
[2024-05-28 07:02:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1856731812103469782.gal : 20 ms
BEST_FIRST walk for 40004 steps (15 resets) in 291 ms. (137 steps per ms) remains 6/6 properties
[2024-05-28 07:02:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3852895900087862718.prop : 5 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/ReachabilityCardinality1856731812103469782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3852895900087862718.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 ...328
Loading property file /tmp/ReachabilityCardinality3852895900087862718.prop.
BEST_FIRST walk for 40004 steps (16 resets) in 647 ms. (61 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 111
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :111 after 1136
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1136 after 641847
BEST_FIRST walk for 40003 steps (13 resets) in 541 ms. (73 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 294 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 213 ms. (186 steps per ms) remains 5/6 properties
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 180 rows 183 cols
[2024-05-28 07:02:58] [INFO ] Computed 28 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem ShieldIIPs-PT-003B-ReachabilityFireability-2024-05 is UNSAT
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem ShieldIIPs-PT-003B-ReachabilityFireability-2024-10 is UNSAT
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 79/183 variables, 28/132 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 79/211 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/211 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 180/363 variables, 183/394 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 394 constraints, problems are : Problem set: 2 solved, 3 unsolved in 799 ms.
Refiners :[Domain max(s): 183/183 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 67/67 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 116/183 variables, 28/95 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 116/211 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-28 07:02:59] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 46 ms to minimize.
[2024-05-28 07:02:59] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 2 ms to minimize.
[2024-05-28 07:02:59] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2024-05-28 07:02:59] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-28 07:02:59] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
Problem ShieldIIPs-PT-003B-ReachabilityFireability-2024-02 is UNSAT
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 16 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-28 07:03:00] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 18/229 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/229 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 180/363 variables, 183/412 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 2/414 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-28 07:03:01] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:03:01] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:03:01] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 3/417 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/417 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/363 variables, 0/417 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 417 constraints, problems are : Problem set: 3 solved, 2 unsolved in 2355 ms.
Refiners :[Domain max(s): 183/183 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 21/21 constraints]
After SMT, in 3365ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 595 ms.
Support contains 43 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 180/180 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 0 with 8 rules applied. Total rules applied 8 place count 183 transition count 172
Reduce places removed 8 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 13 rules applied. Total rules applied 21 place count 175 transition count 167
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 26 place count 170 transition count 167
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 26 place count 170 transition count 153
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 54 place count 156 transition count 153
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 69 place count 141 transition count 138
Iterating global reduction 3 with 15 rules applied. Total rules applied 84 place count 141 transition count 138
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 144 place count 111 transition count 108
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 111 transition count 108
Applied a total of 152 rules in 50 ms. Remains 111 /183 variables (removed 72) and now considering 108/180 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 111/183 places, 108/180 transitions.
RANDOM walk for 40000 steps (137 resets) in 402 ms. (99 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (28 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (20 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1317690 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :0 out of 2
Probabilistic random walk after 1317690 steps, saw 251549 distinct states, run finished after 3008 ms. (steps per millisecond=438 ) properties seen :0
// Phase 1: matrix 108 rows 111 cols
[2024-05-28 07:03:05] [INFO ] Computed 28 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 108/219 variables, 111/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/219 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 139 constraints, problems are : Problem set: 0 solved, 2 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:03:05] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:03:05] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:03:05] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:03:05] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 108/219 variables, 111/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 07:03:05] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:03:05] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:03:05] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 683ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 371 ms.
Support contains 43 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 111/111 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-28 07:03:06] [INFO ] Invariant cache hit.
[2024-05-28 07:03:06] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 07:03:06] [INFO ] Invariant cache hit.
[2024-05-28 07:03:06] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-28 07:03:06] [INFO ] Redundant transitions in 16 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-28 07:03:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 2 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 5 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:03:07] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:03:08] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:03:08] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:08] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:03:08] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/219 variables, 111/161 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:09] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:03:09] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:03:09] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:03:09] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:03:09] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:10] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 10 ms to minimize.
[2024-05-28 07:03:10] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:03:10] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:11] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:11] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:03:11] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:03:11] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:03:11] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:03:11] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:12] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:03:12] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:12] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:03:12] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:03:12] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:03:12] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:03:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:03:13] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:03:13] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:03:13] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:03:13] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:03:13] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 10/187 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:13] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:03:13] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:03:13] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:03:13] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:14] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:03:14] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:03:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:14] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-28 07:03:15] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:03:15] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:03:15] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:03:15] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:15] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:03:15] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:03:15] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:16] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:16] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:17] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:03:17] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:03:17] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:03:17] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:18] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:03:18] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:18] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:03:18] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/219 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:19] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/219 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/219 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:20] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/219 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/219 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:21] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:03:21] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:03:21] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:03:21] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:03:21] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:03:21] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:03:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/219 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:22] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:03:22] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:03:22] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/219 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/219 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:23] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/219 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:24] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:03:24] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/219 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/219 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:25] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:03:25] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 32 (OVERLAPS) 0/219 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/219 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:03:26] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 34 (OVERLAPS) 0/219 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/219 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 36 (OVERLAPS) 0/219 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 233 constraints, problems are : Problem set: 0 solved, 107 unsolved in 21416 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 94/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:28] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/219 variables, 111/234 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 107/341 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-28 07:03:30] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:03:30] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/219 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 343 constraints, problems are : Problem set: 0 solved, 107 unsolved in 7582 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 97/97 constraints]
After SMT, in 29048ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 29050ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29293 ms. Remains : 111/111 places, 108/108 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 07:03:35] [INFO ] Flatten gal took : 17 ms
[2024-05-28 07:03:35] [INFO ] Applying decomposition
[2024-05-28 07:03:35] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7237681936391440052.txt' '-o' '/tmp/graph7237681936391440052.bin' '-w' '/tmp/graph7237681936391440052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7237681936391440052.bin' '-l' '-1' '-v' '-w' '/tmp/graph7237681936391440052.weights' '-q' '0' '-e' '0.001'
[2024-05-28 07:03:35] [INFO ] Decomposing Gal with order
[2024-05-28 07:03:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 07:03:35] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-28 07:03:36] [INFO ] Flatten gal took : 44 ms
[2024-05-28 07:03:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 07:03:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14914985586577828166.gal : 7 ms
[2024-05-28 07:03:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18118495376455322834.prop : 1 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/ReachabilityCardinality14914985586577828166.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18118495376455322834.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality18118495376455322834.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 667
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :667 after 20419
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7.06031e+06 after 1.40564e+08
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6.15684e+08 after 1.30532e+09
Invariant property ShieldIIPs-PT-003B-ReachabilityFireability-2024-06 does not hold.
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.30108e+14 after 2.94742e+14
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\_mod\_flat,7.82693e+16,86.1535,1011048,9880,79,1.3078e+06,600,550,3.67638e+06,60,4578,0
Total reachable state count : 78269256214251495

Verifying 2 reachability properties.
Reachability property ShieldIIPs-PT-003B-ReachabilityFireability-2024-03 does not hold.
FORMULA ShieldIIPs-PT-003B-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ShieldIIPs-PT-003B-ReachabilityFireability-2024-03

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPs-PT-003B-ReachabilityFireability-2024-03,0,86.577,1011048,1,0,1.3078e+06,600,591,3.67638e+06,70,4578,18456
Invariant property ShieldIIPs-PT-003B-ReachabilityFireability-2024-06 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPs-PT-003B-ReachabilityFireability-2024-06,2.44944e+06,86.6796,1011048,148,23,1.3078e+06,600,694,3.67638e+06,72,4578,36284
All properties solved without resorting to model-checking.
Total runtime 126575 ms.

BK_STOP 1716879902937

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ShieldIIPs-PT-003B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPs-PT-003B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760200047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-003B.tgz
mv ShieldIIPs-PT-003B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;