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-171683761000399.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 ShieldPPPs-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-171683761000399
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16: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:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 52K 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 ShieldPPPs-PT-003B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-003B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716955939212

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 04:12:20] [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-29 04:12:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:12:20] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-29 04:12:20] [INFO ] Transformed 207 places.
[2024-05-29 04:12:20] [INFO ] Transformed 192 transitions.
[2024-05-29 04:12:20] [INFO ] Found NUPN structural information;
[2024-05-29 04:12:20] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (72 resets) in 1159 ms. (34 steps per ms) remains 3/16 properties
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 04:12:21] [INFO ] Flatten gal took : 110 ms
[2024-05-29 04:12:21] [INFO ] Flatten gal took : 34 ms
BEST_FIRST walk for 40002 steps (9 resets) in 474 ms. (84 steps per ms) remains 2/3 properties
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-29 04:12:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3897300196208669094.gal : 23 ms
BEST_FIRST walk for 40004 steps (10 resets) in 344 ms. (115 steps per ms) remains 1/2 properties
FORMULA ShieldPPPs-PT-003B-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-29 04:12:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15141875812136540210.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/ReachabilityCardinality3897300196208669094.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15141875812136540210.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/ReachabilityCardinality15141875812136540210.prop.
BEST_FIRST walk for 40004 steps (12 resets) in 467 ms. (85 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 111
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :111 after 1136
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1136 after 641847
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :641847 after 1.3341e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.3341e+08 after 1.33447e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.33447e+08 after 1.3346e+08
// Phase 1: matrix 192 rows 207 cols
[2024-05-29 04:12:21] [INFO ] Computed 34 invariants in 20 ms
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.3346e+08 after 1.33534e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.33534e+08 after 1.3862e+08
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 137/183 variables, 27/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 137/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/207 variables, 7/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 24/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 192/399 variables, 207/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/399 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 448 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Domain max(s): 207/207 constraints, Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 137/183 variables, 27/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 137/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 04:12:22] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 8 ms to minimize.
[2024-05-29 04:12:22] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:12:22] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 04:12:22] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/207 variables, 7/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 24/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 192/399 variables, 207/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.3862e+08 after 8.392e+09
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/399 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 624 ms.
Refiners :[Domain max(s): 207/207 constraints, Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1065ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 46 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 192/192 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 207 transition count 179
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 194 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 193 transition count 178
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 28 place count 193 transition count 165
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 54 place count 180 transition count 165
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 69 place count 165 transition count 150
Iterating global reduction 3 with 15 rules applied. Total rules applied 84 place count 165 transition count 150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 84 place count 165 transition count 148
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 163 transition count 148
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 152 place count 131 transition count 116
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 131 transition count 116
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 130 transition count 115
Applied a total of 159 rules in 95 ms. Remains 130 /207 variables (removed 77) and now considering 115/192 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 130/207 places, 115/192 transitions.
RANDOM walk for 40000 steps (109 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (24 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.392e+09 after 8.42455e+09
Interrupted probabilistic random walk after 1980027 steps, run timeout after 3001 ms. (steps per millisecond=659 ) properties seen :0 out of 1
Probabilistic random walk after 1980027 steps, saw 419143 distinct states, run finished after 3005 ms. (steps per millisecond=658 ) properties seen :0
// Phase 1: matrix 115 rows 130 cols
[2024-05-29 04:12:25] [INFO ] Computed 34 invariants in 1 ms
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.42455e+09 after 1.99184e+10
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/115 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/124 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/239 variables, 124/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/245 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/115 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 04:12:26] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:12:26] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:12:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/124 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 115/239 variables, 124/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 04:12:26] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:12:26] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/245 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 656ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 46 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 115/115 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 130/130 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 115/115 transitions.
Applied a total of 0 rules in 12 ms. Remains 130 /130 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-29 04:12:26] [INFO ] Invariant cache hit.
[2024-05-29 04:12:26] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-29 04:12:26] [INFO ] Invariant cache hit.
[2024-05-29 04:12:26] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-29 04:12:26] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-29 04:12:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 8/130 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 04:12:27] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:28] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:12:28] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-29 04:12:28] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 107 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.99184e+10 after 9.47282e+10
At refinement iteration 6 (OVERLAPS) 115/245 variables, 130/178 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:29] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:12:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:12:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:12:29] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
[2024-05-29 04:12:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 7 ms to minimize.
[2024-05-29 04:12:29] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
[2024-05-29 04:12:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:12:29] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 04:12:29] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 9/187 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:30] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:30] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:12:30] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:12:30] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:12:30] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-05-29 04:12:30] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 5/193 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:31] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 194 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6167 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 8/130 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 17/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 115/245 variables, 130/194 constraints. Problems are: Problem set: 0 solved, 107 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :9.47282e+10 after 4.2671e+12
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 107/301 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:34] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2024-05-29 04:12:34] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 04:12:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 04:12:34] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:12:35] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 04:12:35] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:12:35] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:12:35] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 8/309 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:36] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:12:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:12:36] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:39] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:12:39] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:12:39] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:40] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:44] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 04:12:44] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 10 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :3.74364e+14 after 7.42804e+15
[2024-05-29 04:12:45] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/245 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:47] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-05-29 04:12:47] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:49] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-29 04:12:49] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:12:50] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:12:50] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/245 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:52] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/245 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:55] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/245 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-29 04:12:56] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:12:56] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:12:56] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/245 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/245 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 20 (OVERLAPS) 0/245 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 330 constraints, problems are : Problem set: 0 solved, 107 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 59/59 constraints]
After SMT, in 36215ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 36218ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36454 ms. Remains : 130/130 places, 115/115 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 04:13:03] [INFO ] Flatten gal took : 15 ms
[2024-05-29 04:13:03] [INFO ] Applying decomposition
[2024-05-29 04:13:03] [INFO ] Flatten gal took : 13 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/graph3354926966211764570.txt' '-o' '/tmp/graph3354926966211764570.bin' '-w' '/tmp/graph3354926966211764570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3354926966211764570.bin' '-l' '-1' '-v' '-w' '/tmp/graph3354926966211764570.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:13:03] [INFO ] Decomposing Gal with order
[2024-05-29 04:13:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:13:03] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-29 04:13:03] [INFO ] Flatten gal took : 41 ms
[2024-05-29 04:13:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 04:13:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17290624287495401369.gal : 5 ms
[2024-05-29 04:13:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17270213242835105516.prop : 0 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/ReachabilityCardinality17290624287495401369.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17270213242835105516.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/ReachabilityCardinality17270213242835105516.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 95
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :95 after 1.92554e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.61231e+08 after 1.09017e+09
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.09017e+09 after 7.73288e+11
Detected timeout of ITS tools.
[2024-05-29 04:43:03] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
[2024-05-29 04:43:03] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin15688329299021030790
[2024-05-29 04:43:03] [INFO ] Flatten gal took : 17 ms
[2024-05-29 04:43:03] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2024-05-29 04:43:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:43:03] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2024-05-29 04:43:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:43:03] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2024-05-29 04:43:03] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph13671750393169000814.txt' '-o' '/tmp/graph13671750393169000814.bin' '-w' '/tmp/graph13671750393169000814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13671750393169000814.bin' '-l' '-1' '-v' '-w' '/tmp/graph13671750393169000814.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:43:03] [INFO ] Decomposing Gal with order
[2024-05-29 04:43:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:43:03] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15688329299021030790
[2024-05-29 04:43:03] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-29 04:43:03] [INFO ] Flatten gal took : 11 ms
[2024-05-29 04:43:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2024-05-29 04:43:03] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6068569830174444863.gal : 2 ms
[2024-05-29 04:43:03] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10537243340819063942.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/ReachabilityFireability6068569830174444863.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10537243340819063942.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 ...308
Loading property file /tmp/ReachabilityFireability10537243340819063942.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 108
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :108 after 324
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3888 after 66096
Running compilation step : cd /tmp/ltsmin15688329299021030790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 533 ms.
Running link step : cd /tmp/ltsmin15688329299021030790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15688329299021030790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT003BReachabilityFireability202414==true'
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6.69833e+10 after 9.97916e+10
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.010: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Initializing POR dependencies: labels 116, guards 115
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.132: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 6/ 8), 0.132: "ShieldPPPsPT003BReachabilityFireability202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.143: "ShieldPPPsPT003BReachabilityFireability202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.143: There are 116 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.143: State length is 130, there are 115 groups
pins2lts-mc-linux64( 0/ 8), 0.143: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.143: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.143: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.143: Visible groups: 0 / 115, labels: 1 / 116
pins2lts-mc-linux64( 0/ 8), 0.143: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.143: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.133: "ShieldPPPsPT003BReachabilityFireability202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.135: "ShieldPPPsPT003BReachabilityFireability202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.135: "ShieldPPPsPT003BReachabilityFireability202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.135: "ShieldPPPsPT003BReachabilityFireability202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.133: "ShieldPPPsPT003BReachabilityFireability202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.134: "ShieldPPPsPT003BReachabilityFireability202414==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.416: ~5 levels ~960 states ~7816 transitions
pins2lts-mc-linux64( 0/ 8), 0.436: ~6 levels ~1920 states ~14576 transitions
pins2lts-mc-linux64( 0/ 8), 0.643: ~7 levels ~3840 states ~33080 transitions
pins2lts-mc-linux64( 2/ 8), 0.729: ~3 levels ~7680 states ~54000 transitions
pins2lts-mc-linux64( 2/ 8), 0.912: ~4 levels ~15360 states ~116248 transitions
pins2lts-mc-linux64( 2/ 8), 1.220: ~6 levels ~30720 states ~241808 transitions
pins2lts-mc-linux64( 7/ 8), 2.112: ~6 levels ~61440 states ~557016 transitions
pins2lts-mc-linux64( 5/ 8), 2.950: ~11 levels ~122880 states ~1010312 transitions
pins2lts-mc-linux64( 5/ 8), 3.893: ~12 levels ~245760 states ~2024016 transitions
pins2lts-mc-linux64( 2/ 8), 5.647: ~14 levels ~491520 states ~3900944 transitions
pins2lts-mc-linux64( 5/ 8), 8.296: ~18 levels ~983040 states ~7801896 transitions
pins2lts-mc-linux64( 1/ 8), 13.220: ~21 levels ~1966080 states ~14661592 transitions
pins2lts-mc-linux64( 1/ 8), 23.654: ~24 levels ~3932160 states ~29905312 transitions
pins2lts-mc-linux64( 1/ 8), 45.671: ~26 levels ~7864320 states ~60066176 transitions
pins2lts-mc-linux64( 4/ 8), 92.179: ~29 levels ~15728640 states ~123860256 transitions
pins2lts-mc-linux64( 6/ 8), 185.468: ~32 levels ~31457280 states ~275967656 transitions
pins2lts-mc-linux64( 6/ 8), 397.665: ~34 levels ~62914560 states ~556917232 transitions
pins2lts-mc-linux64( 2/ 8), 800.873: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 800.896:
pins2lts-mc-linux64( 0/ 8), 800.896: mean standard work distribution: 7.8% (states) 3.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 800.896:
pins2lts-mc-linux64( 0/ 8), 800.896: Explored 100771571 states 930924351 transitions, fanout: 9.238
pins2lts-mc-linux64( 0/ 8), 800.896: Total exploration time 800.740 sec (800.740 sec minimum, 800.740 sec on average)
pins2lts-mc-linux64( 0/ 8), 800.896: States per second: 125848, Transitions per second: 1162580
pins2lts-mc-linux64( 0/ 8), 800.896: Ignoring proviso: 31398214
pins2lts-mc-linux64( 0/ 8), 800.896:
pins2lts-mc-linux64( 0/ 8), 800.896: Queue width: 8B, total height: 34485128, memory: 263.10MB
pins2lts-mc-linux64( 0/ 8), 800.896: Tree memory: 1030.0MB, 8.0 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 800.896: Tree fill ratio (roots/leafs): 99.0%/2.0%
pins2lts-mc-linux64( 0/ 8), 800.896: Stored 115 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 800.896: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 800.896: Est. total memory use: 1293.1MB (~1287.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15688329299021030790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT003BReachabilityFireability202414==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15688329299021030790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT003BReachabilityFireability202414==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPs-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 ShieldPPPs-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-171683761000399"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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