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-171683761100430.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-005B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761100430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K 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 53K 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.7K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 13 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 13 11:33 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 86K 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-005B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPs-PT-005B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716964778132

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 06:39:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 06:39:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 06:39:39] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-29 06:39:39] [INFO ] Transformed 343 places.
[2024-05-29 06:39:39] [INFO ] Transformed 318 transitions.
[2024-05-29 06:39:39] [INFO ] Found NUPN structural information;
[2024-05-29 06:39:39] [INFO ] Parsed PT model containing 343 places and 318 transitions and 876 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 06:39:40] [INFO ] Flatten gal took : 132 ms
[2024-05-29 06:39:40] [INFO ] Flatten gal took : 40 ms
RANDOM walk for 40000 steps (44 resets) in 1818 ms. (21 steps per ms) remains 3/12 properties
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
[2024-05-29 06:39:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16339165023156258497.gal : 21 ms
[2024-05-29 06:39:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9143561111582499064.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/ReachabilityCardinality16339165023156258497.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9143561111582499064.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/ReachabilityCardinality9143561111582499064.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :14 after 113
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :113 after 1138
Reachability property ShieldPPPs-PT-005B-ReachabilityCardinality-2024-14 is true.
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1138 after 641849
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :641849 after 3.63285e+08
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.63285e+08 after 4.62643e+12
BEST_FIRST walk for 40004 steps (8 resets) in 773 ms. (51 steps per ms) remains 2/3 properties
FORMULA ShieldPPPs-PT-005B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/2 properties
// Phase 1: matrix 318 rows 343 cols
[2024-05-29 06:39:40] [INFO ] Computed 56 invariants in 18 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 41/44 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 299/343 variables, 52/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 299/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 06:39:40] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 28 ms to minimize.
[2024-05-29 06:39:41] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 4 ms to minimize.
[2024-05-29 06:39:41] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2024-05-29 06:39:41] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 1 ms to minimize.
[2024-05-29 06:39:41] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:39:41] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 0 ms to minimize.
[2024-05-29 06:39:41] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 7/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 318/661 variables, 343/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 06:39:42] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 3 ms to minimize.
[2024-05-29 06:39:42] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-29 06:39:42] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 6 ms to minimize.
[2024-05-29 06:39:42] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 8 ms to minimize.
[2024-05-29 06:39:42] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/661 variables, 5/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/661 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 661/661 variables, and 754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1916 ms.
Refiners :[Domain max(s): 343/343 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 41/44 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 299/343 variables, 52/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 299/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 12/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 06:39:42] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 1 ms to minimize.
[2024-05-29 06:39:42] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 318/661 variables, 343/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/661 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 06:39:43] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:39:43] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:39:43] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 1 ms to minimize.
[2024-05-29 06:39:43] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-29 06:39:43] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-29 06:39:44] [INFO ] Deduced a trap composed of 17 places in 810 ms of which 1 ms to minimize.
[2024-05-29 06:39:45] [INFO ] Deduced a trap composed of 38 places in 1059 ms of which 2 ms to minimize.
[2024-05-29 06:39:45] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-29 06:39:45] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:39:45] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:39:45] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 0 ms to minimize.
[2024-05-29 06:39:45] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:39:45] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 13/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/661 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/661 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 661/661 variables, and 770 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3445 ms.
Refiners :[Domain max(s): 343/343 constraints, Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 constraints]
After SMT, in 5423ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 3 out of 343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 343/343 places, 318/318 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 343 transition count 282
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 307 transition count 282
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 72 place count 307 transition count 257
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 122 place count 282 transition count 257
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 155 place count 249 transition count 224
Iterating global reduction 2 with 33 rules applied. Total rules applied 188 place count 249 transition count 224
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 188 place count 249 transition count 211
Deduced a syphon composed of 13 places in 23 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 214 place count 236 transition count 211
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 366 place count 160 transition count 135
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 2 with 42 rules applied. Total rules applied 408 place count 160 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 409 place count 159 transition count 134
Applied a total of 409 rules in 250 ms. Remains 159 /343 variables (removed 184) and now considering 134/318 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 159/343 places, 134/318 transitions.
RANDOM walk for 40000 steps (8 resets) in 703 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1306260 steps, run timeout after 3001 ms. (steps per millisecond=435 ) properties seen :0 out of 1
Probabilistic random walk after 1306260 steps, saw 547623 distinct states, run finished after 3004 ms. (steps per millisecond=434 ) properties seen :0
// Phase 1: matrix 134 rows 159 cols
[2024-05-29 06:39:49] [INFO ] Computed 56 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/44 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/94 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/97 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/103 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 44/147 variables, 28/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/147 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 06:39:49] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:39:49] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/147 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/147 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/150 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/150 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/150 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/156 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/156 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/156 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 43/199 variables, 22/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/199 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 06:39:49] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:39:49] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/199 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (OVERLAPS) 2/201 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/201 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/205 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/205 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 29/234 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/234 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/234 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/234 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 24/258 variables, 14/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/258 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/258 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/260 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/260 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 1/261 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/261 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/261 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 18/279 variables, 11/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/279 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/279 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 14/293 variables, 9/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/293 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/293 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 0/293 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/44 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/94 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/97 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/97 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 06:39:49] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-29 06:39:50] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/103 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/103 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/147 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/147 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/147 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/150 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/150 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/150 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/156 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/156 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/156 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 43/199 variables, 22/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/199 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/199 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/199 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/201 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/201 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 06:39:50] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 7 ms to minimize.
[2024-05-29 06:39:50] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/201 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/201 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/205 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/205 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 29/234 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/234 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/234 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/234 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 24/258 variables, 14/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/258 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 06:39:50] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:39:50] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/258 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/258 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 2/260 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/260 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 1/261 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/261 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/261 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 18/279 variables, 11/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/279 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/279 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 14/293 variables, 9/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/293 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 06:39:50] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 06:39:50] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/293 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/293 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 0/293 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 1049ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 159/159 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-29 06:39:50] [INFO ] Invariant cache hit.
[2024-05-29 06:39:50] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-29 06:39:50] [INFO ] Invariant cache hit.
[2024-05-29 06:39:50] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-05-29 06:39:50] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-29 06:39:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:39:51] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 28 ms to minimize.
[2024-05-29 06:39:52] [INFO ] Deduced a trap composed of 4 places in 743 ms of which 0 ms to minimize.
[2024-05-29 06:39:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:39:53] [INFO ] Deduced a trap composed of 6 places in 677 ms of which 1 ms to minimize.
[2024-05-29 06:39:53] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-29 06:39:53] [INFO ] Deduced a trap composed of 6 places in 585 ms of which 1 ms to minimize.
[2024-05-29 06:39:53] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2024-05-29 06:39:53] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 06:39:53] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:39:53] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:39:53] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 2 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 7 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 06:39:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 4 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 15/90 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:39:55] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:39:56] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 134/293 variables, 159/262 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:39:58] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:39:58] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:39:58] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2024-05-29 06:40:00] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:40:00] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 06:40:00] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:40:01] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:40:01] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/293 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/293 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:40:04] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/293 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 131 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4.62643e+12 after 4.27388e+13
[2024-05-29 06:40:05] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/293 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:40:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 06:40:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:40:06] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/293 variables, 3/280 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/293 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 21 (OVERLAPS) 0/293 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 280 constraints, problems are : Problem set: 0 solved, 131 unsolved in 17409 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 63/118 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 1/159 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 134/293 variables, 159/280 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 131/411 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:40:10] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:40:11] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:40:12] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 3/414 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:40:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:40:14] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:40:15] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:40:21] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:40:21] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/293 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-29 06:40:26] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.27388e+13 after 4.27388e+13
At refinement iteration 14 (OVERLAPS) 0/293 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 16 (OVERLAPS) 0/293 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 420 constraints, problems are : Problem set: 0 solved, 131 unsolved in 27529 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 74/74 constraints]
After SMT, in 45016ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 45018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45451 ms. Remains : 159/159 places, 134/134 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 06:40:36] [INFO ] Flatten gal took : 20 ms
[2024-05-29 06:40:36] [INFO ] Applying decomposition
[2024-05-29 06:40:36] [INFO ] Flatten gal took : 16 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/graph15841846837048673574.txt' '-o' '/tmp/graph15841846837048673574.bin' '-w' '/tmp/graph15841846837048673574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15841846837048673574.bin' '-l' '-1' '-v' '-w' '/tmp/graph15841846837048673574.weights' '-q' '0' '-e' '0.001'
[2024-05-29 06:40:36] [INFO ] Decomposing Gal with order
[2024-05-29 06:40:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 06:40:36] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-29 06:40:36] [INFO ] Flatten gal took : 55 ms
[2024-05-29 06:40:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 06:40:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13451958307317418580.gal : 8 ms
[2024-05-29 06:40:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6201669729266558028.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/ReachabilityCardinality13451958307317418580.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6201669729266558028.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/ReachabilityCardinality6201669729266558028.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 63
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :63 after 1.40618e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.26181e+12 after 2.89597e+14
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2.89597e+14 after 5.49969e+14
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.49969e+14 after 8.46236e+22
Detected timeout of ITS tools.
[2024-05-29 07:10:36] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6717841084002657569
[2024-05-29 07:10:36] [INFO ] Applying decomposition
[2024-05-29 07:10:36] [INFO ] Flatten gal took : 6 ms
[2024-05-29 07:10:36] [INFO ] Computing symmetric may disable matrix : 134 transitions.
[2024-05-29 07:10:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:10:36] [INFO ] Computing symmetric may enable matrix : 134 transitions.
[2024-05-29 07:10:36] [INFO ] Computation of Complete enable matrix. took 1 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/graph8896916441234808229.txt' '-o' '/tmp/graph8896916441234808229.bin' '-w' '/tmp/graph8896916441234808229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8896916441234808229.bin' '-l' '-1' '-v' '-w' '/tmp/graph8896916441234808229.weights' '-q' '0' '-e' '0.001'
[2024-05-29 07:10:36] [INFO ] Decomposing Gal with order
[2024-05-29 07:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 07:10:36] [INFO ] Computing Do-Not-Accords matrix : 134 transitions.
[2024-05-29 07:10:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 07:10:36] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-29 07:10:36] [INFO ] Flatten gal took : 13 ms
[2024-05-29 07:10:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 12 ms.
[2024-05-29 07:10:36] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6717841084002657569
[2024-05-29 07:10:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1957944961276785571.gal : 3 ms
[2024-05-29 07:10:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2406396441634727625.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/ReachabilityCardinality1957944961276785571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2406396441634727625.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 ...307
Running compilation step : cd /tmp/ltsmin6717841084002657569;'/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'
Loading property file /tmp/ReachabilityCardinality2406396441634727625.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 654
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :654 after 2382
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2382 after 5.40395e+06
Compilation finished in 448 ms.
Running link step : cd /tmp/ltsmin6717841084002657569;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6717841084002657569;'/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' 'ShieldPPPsPT005BReachabilityCardinality202403==true'
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5.40395e+06 after 6.79818e+12
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6.87691e+18 after 1.14961e+19
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.173: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.173: Initializing POR dependencies: labels 135, guards 134
pins2lts-mc-linux64( 2/ 8), 0.174: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.178: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.190: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.198: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.208: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.208: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.206: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.267: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 0.318: "ShieldPPPsPT005BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.320: "ShieldPPPsPT005BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.318: "ShieldPPPsPT005BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.320: There are 135 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.320: State length is 159, there are 134 groups
pins2lts-mc-linux64( 0/ 8), 0.320: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.320: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.320: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.320: Visible groups: 0 / 134, labels: 1 / 135
pins2lts-mc-linux64( 0/ 8), 0.320: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.320: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.321: "ShieldPPPsPT005BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.319: "ShieldPPPsPT005BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.321: "ShieldPPPsPT005BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.321: "ShieldPPPsPT005BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.320: "ShieldPPPsPT005BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.333: ~7 levels ~960 states ~2744 transitions
pins2lts-mc-linux64( 0/ 8), 0.393: ~10 levels ~1920 states ~6296 transitions
pins2lts-mc-linux64( 2/ 8), 0.441: ~5 levels ~3840 states ~16928 transitions
pins2lts-mc-linux64( 4/ 8), 0.488: ~6 levels ~7680 states ~35608 transitions
pins2lts-mc-linux64( 2/ 8), 0.612: ~8 levels ~15360 states ~73288 transitions
pins2lts-mc-linux64( 6/ 8), 0.871: ~9 levels ~30720 states ~151768 transitions
pins2lts-mc-linux64( 7/ 8), 1.339: ~12 levels ~61440 states ~279448 transitions
pins2lts-mc-linux64( 4/ 8), 2.173: ~13 levels ~122880 states ~661400 transitions
pins2lts-mc-linux64( 7/ 8), 3.583: ~15 levels ~245760 states ~1247280 transitions
pins2lts-mc-linux64( 7/ 8), 5.888: ~17 levels ~491520 states ~2646400 transitions
pins2lts-mc-linux64( 5/ 8), 10.850: ~18 levels ~983040 states ~5630720 transitions
pins2lts-mc-linux64( 7/ 8), 20.062: ~19 levels ~1966080 states ~11668976 transitions
pins2lts-mc-linux64( 7/ 8), 39.304: ~21 levels ~3932160 states ~24879416 transitions
pins2lts-mc-linux64( 7/ 8), 77.135: ~22 levels ~7864320 states ~51079616 transitions
pins2lts-mc-linux64( 7/ 8), 157.175: ~23 levels ~15728640 states ~107249864 transitions
pins2lts-mc-linux64( 7/ 8), 334.720: ~24 levels ~31457280 states ~226418704 transitions
pins2lts-mc-linux64( 7/ 8), 745.119: ~26 levels ~62914560 states ~458458176 transitions
pins2lts-mc-linux64( 7/ 8), 1005.776: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1005.871:
pins2lts-mc-linux64( 0/ 8), 1005.871: mean standard work distribution: 4.1% (states) 0.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 1005.871:
pins2lts-mc-linux64( 0/ 8), 1005.871: Explored 77486809 states 626062513 transitions, fanout: 8.080
pins2lts-mc-linux64( 0/ 8), 1005.871: Total exploration time 1005.550 sec (1005.460 sec minimum, 1005.487 sec on average)
pins2lts-mc-linux64( 0/ 8), 1005.871: States per second: 77059, Transitions per second: 622607
pins2lts-mc-linux64( 0/ 8), 1005.871: Ignoring proviso: 37892303
pins2lts-mc-linux64( 0/ 8), 1005.871:
pins2lts-mc-linux64( 0/ 8), 1005.871: Queue width: 8B, total height: 56731118, memory: 432.82MB
pins2lts-mc-linux64( 0/ 8), 1005.871: Tree memory: 1090.1MB, 8.5 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 1005.872: Tree fill ratio (roots/leafs): 99.0%/25.0%
pins2lts-mc-linux64( 0/ 8), 1005.872: Stored 135 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1005.872: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1005.872: Est. total memory use: 1522.9MB (~1456.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6717841084002657569;'/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' 'ShieldPPPsPT005BReachabilityCardinality202403==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6717841084002657569;'/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' 'ShieldPPPsPT005BReachabilityCardinality202403==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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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