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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 569K 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 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717016440231

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 21:00:41] [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 21:00:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:00:41] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-05-29 21:00:41] [INFO ] Transformed 2343 places.
[2024-05-29 21:00:41] [INFO ] Transformed 2133 transitions.
[2024-05-29 21:00:41] [INFO ] Found NUPN structural information;
[2024-05-29 21:00:41] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1829 ms. (21 steps per ms) remains 8/13 properties
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 8/8 properties
[2024-05-29 21:00:42] [INFO ] Flatten gal took : 312 ms
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
[2024-05-29 21:00:42] [INFO ] Flatten gal took : 136 ms
BEST_FIRST walk for 40003 steps (8 resets) in 360 ms. (110 steps per ms) remains 8/8 properties
[2024-05-29 21:00:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15756905173806286333.gal : 73 ms
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
[2024-05-29 21:00:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14843279364312569898.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15756905173806286333.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14843279364312569898.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 8/8 properties

its-reach command run as :

BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
// Phase 1: matrix 2133 rows 2343 cols
[2024-05-29 21:00:42] [INFO ] Computed 331 invariants in 30 ms
Loading property file /tmp/ReachabilityCardinality14843279364312569898.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem ShieldPPPt-PT-030B-ReachabilityCardinality-2024-06 is UNSAT
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2214/2343 variables, 331/460 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2343 variables, 2214/2674 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2343 variables, 0/2674 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2133/4476 variables, 2343/5017 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4476 variables, 0/5017 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 36
At refinement iteration 7 (OVERLAPS) 0/4476 variables, 0/5017 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :36 after 53
After SMT solving in domain Real declared 4476/4476 variables, and 5017 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2630 ms.
Refiners :[Domain max(s): 2343/2343 constraints, Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 2343/2343 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :53 after 863
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :863 after 356981
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :356981 after 9.83797e+09
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :9.83797e+09 after 6.90677e+16
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :6.90677e+16 after 1.21274e+32
At refinement iteration 2 (OVERLAPS) 2249/2343 variables, 331/425 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2343 variables, 2249/2674 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-29 21:00:46] [INFO ] Deduced a trap composed of 32 places in 573 ms of which 78 ms to minimize.
[2024-05-29 21:00:47] [INFO ] Deduced a trap composed of 30 places in 470 ms of which 8 ms to minimize.
[2024-05-29 21:00:47] [INFO ] Deduced a trap composed of 18 places in 446 ms of which 7 ms to minimize.
[2024-05-29 21:00:48] [INFO ] Deduced a trap composed of 20 places in 460 ms of which 9 ms to minimize.
[2024-05-29 21:00:48] [INFO ] Deduced a trap composed of 23 places in 429 ms of which 8 ms to minimize.
[2024-05-29 21:00:49] [INFO ] Deduced a trap composed of 29 places in 461 ms of which 10 ms to minimize.
[2024-05-29 21:00:49] [INFO ] Deduced a trap composed of 20 places in 421 ms of which 8 ms to minimize.
[2024-05-29 21:00:50] [INFO ] Deduced a trap composed of 20 places in 431 ms of which 8 ms to minimize.
[2024-05-29 21:00:50] [INFO ] Deduced a trap composed of 24 places in 454 ms of which 9 ms to minimize.
SMT process timed out in 7908ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 506 rules applied. Total rules applied 506 place count 2343 transition count 1627
Reduce places removed 506 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 536 rules applied. Total rules applied 1042 place count 1837 transition count 1597
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1072 place count 1807 transition count 1597
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 1072 place count 1807 transition count 1475
Deduced a syphon composed of 122 places in 3 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 1316 place count 1685 transition count 1475
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 1514 place count 1487 transition count 1277
Iterating global reduction 3 with 198 rules applied. Total rules applied 1712 place count 1487 transition count 1277
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1712 place count 1487 transition count 1199
Deduced a syphon composed of 78 places in 5 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 1868 place count 1409 transition count 1199
Performed 462 Post agglomeration using F-continuation condition.Transition count delta: 462
Deduced a syphon composed of 462 places in 3 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 3 with 924 rules applied. Total rules applied 2792 place count 947 transition count 737
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 2940 place count 873 transition count 737
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 2945 place count 873 transition count 732
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2950 place count 868 transition count 732
Partial Free-agglomeration rule applied 71 times.
Drop transitions (Partial Free agglomeration) removed 71 transitions
Iterating global reduction 4 with 71 rules applied. Total rules applied 3021 place count 868 transition count 732
Applied a total of 3021 rules in 702 ms. Remains 868 /2343 variables (removed 1475) and now considering 732/2133 (removed 1401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 716 ms. Remains : 868/2343 places, 732/2133 transitions.
RANDOM walk for 40000 steps (8 resets) in 1647 ms. (24 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 146457 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 7
Probabilistic random walk after 146457 steps, saw 116843 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
// Phase 1: matrix 732 rows 868 cols
[2024-05-29 21:00:55] [INFO ] Computed 331 invariants in 9 ms
[2024-05-29 21:00:55] [INFO ] State equation strengthened by 167 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 774/868 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 732/1600 variables, 868/1199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1600 variables, 167/1366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1600 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/1600 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1600/1600 variables, and 1366 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 868/868 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 774/868 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 21:00:56] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-29 21:00:57] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-29 21:00:58] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-29 21:00:58] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 21:00:58] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-29 21:00:58] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-29 21:00:58] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 21:00:58] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 732/1600 variables, 868/1220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1600 variables, 167/1387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1600 variables, 7/1394 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 21:00:59] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-29 21:01:00] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 2 ms to minimize.
[2024-05-29 21:01:00] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1600 variables, 3/1397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-29 21:01:00] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1600 variables, 1/1398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1600 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/1600 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1600/1600 variables, and 1398 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5698 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 868/868 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 25/25 constraints]
After SMT, in 6810ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2989 ms.
Support contains 94 out of 868 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 732/732 transitions.
Applied a total of 0 rules in 112 ms. Remains 868 /868 variables (removed 0) and now considering 732/732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 868/868 places, 732/732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 732/732 transitions.
Applied a total of 0 rules in 35 ms. Remains 868 /868 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2024-05-29 21:01:05] [INFO ] Invariant cache hit.
[2024-05-29 21:01:05] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-29 21:01:05] [INFO ] Invariant cache hit.
[2024-05-29 21:01:06] [INFO ] State equation strengthened by 167 read => feed constraints.
[2024-05-29 21:01:07] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2458 ms to find 0 implicit places.
[2024-05-29 21:01:08] [INFO ] Redundant transitions in 53 ms returned []
Running 731 sub problems to find dead transitions.
[2024-05-29 21:01:08] [INFO ] Invariant cache hit.
[2024-05-29 21:01:08] [INFO ] State equation strengthened by 167 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 1 (OVERLAPS) 1/868 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-05-29 21:01:24] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:01:24] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 2 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-29 21:01:25] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 21:01:26] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 21:01:26] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 21:01:26] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 21:01:26] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-05-29 21:01:28] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:01:28] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 11 ms to minimize.
[2024-05-29 21:01:28] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:01:28] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 21:01:28] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:01:28] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-29 21:01:28] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 21:01:28] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:01:28] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:01:30] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 3 ms to minimize.
[2024-05-29 21:01:31] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-29 21:01:31] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-29 21:01:31] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-05-29 21:01:31] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-29 21:01:31] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-29 21:01:31] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 3 ms to minimize.
[2024-05-29 21:01:31] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-29 21:01:31] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-29 21:01:31] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-29 21:01:32] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 731 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 868/1600 variables, and 371 constraints, problems are : Problem set: 0 solved, 731 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/868 constraints, ReadFeed: 0/167 constraints, PredecessorRefiner: 731/731 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 731 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 1 (OVERLAPS) 1/868 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 40/371 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-05-29 21:01:49] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 21:01:49] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:01:49] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:01:49] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 21:01:49] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:01:49] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 21:01:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:01:49] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 21:01:49] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 21:01:49] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:01:50] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-29 21:01:50] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 21:01:50] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 21:01:50] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-29 21:01:50] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-29 21:01:51] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-05-29 21:01:51] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-29 21:01:51] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-29 21:01:51] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-29 21:01:51] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/868 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-05-29 21:01:55] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:01:55] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 3 ms to minimize.
[2024-05-29 21:01:55] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-29 21:01:55] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-29 21:01:56] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-05-29 21:01:56] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:01:56] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-29 21:01:56] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:01:56] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-29 21:01:56] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:01:57] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2024-05-29 21:01:57] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-29 21:01:57] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-29 21:01:57] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:01:57] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:01:57] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-29 21:01:57] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2024-05-29 21:01:57] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-29 21:01:58] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-29 21:01:58] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/868 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-05-29 21:02:01] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-29 21:02:02] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-29 21:02:04] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:02:05] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/1600 variables, and 415 constraints, problems are : Problem set: 0 solved, 731 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/868 constraints, ReadFeed: 0/167 constraints, PredecessorRefiner: 0/731 constraints, Known Traps: 84/84 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 731 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62801 ms. Remains : 868/868 places, 732/732 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 153 times.
Drop transitions (Partial Free agglomeration) removed 153 transitions
Iterating global reduction 0 with 153 rules applied. Total rules applied 153 place count 868 transition count 732
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 868 transition count 731
Applied a total of 154 rules in 65 ms. Remains 868 /868 variables (removed 0) and now considering 731/732 (removed 1) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 731 rows 868 cols
[2024-05-29 21:02:08] [INFO ] Computed 331 invariants in 4 ms
[2024-05-29 21:02:08] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 21:02:08] [INFO ] [Nat]Absence check using 331 positive place invariants in 44 ms returned sat
[2024-05-29 21:02:09] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 21:02:09] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-05-29 21:02:10] [INFO ] After 716ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-05-29 21:02:10] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 3 ms to minimize.
[2024-05-29 21:02:10] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-29 21:02:10] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-29 21:02:10] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-29 21:02:10] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-29 21:02:11] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 3 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2320 ms
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-05-29 21:02:12] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 2 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-29 21:02:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1202 ms
[2024-05-29 21:02:14] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-29 21:02:14] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-29 21:02:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2024-05-29 21:02:14] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-05-29 21:02:14] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-05-29 21:02:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
TRAPS : Iteration 1
[2024-05-29 21:02:15] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 3 ms to minimize.
[2024-05-29 21:02:15] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 5 ms to minimize.
[2024-05-29 21:02:15] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 21:02:15] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-29 21:02:15] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-29 21:02:15] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-29 21:02:15] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1231 ms
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-29 21:02:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 512 ms
[2024-05-29 21:02:16] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 21:02:17] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-29 21:02:17] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-29 21:02:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
[2024-05-29 21:02:17] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-29 21:02:17] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-29 21:02:17] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-29 21:02:17] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:02:17] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 21:02:17] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:02:17] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-29 21:02:18] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 21:02:18] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-29 21:02:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 947 ms
[2024-05-29 21:02:18] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-29 21:02:18] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-05-29 21:02:18] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 21:02:18] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 21:02:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 469 ms
TRAPS : Iteration 2
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 394 ms
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-29 21:02:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 553 ms
[2024-05-29 21:02:20] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-29 21:02:20] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-29 21:02:20] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-29 21:02:20] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-29 21:02:21] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-29 21:02:21] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-29 21:02:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 858 ms
[2024-05-29 21:02:21] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 3 ms to minimize.
[2024-05-29 21:02:21] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-29 21:02:21] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-29 21:02:21] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-29 21:02:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 606 ms
TRAPS : Iteration 3
[2024-05-29 21:02:22] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-29 21:02:22] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-29 21:02:22] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-29 21:02:22] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-29 21:02:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 563 ms
[2024-05-29 21:02:22] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 441 ms
[2024-05-29 21:02:23] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-29 21:02:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
TRAPS : Iteration 4
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-29 21:02:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
TRAPS : Iteration 5
[2024-05-29 21:02:25] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-29 21:02:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2024-05-29 21:02:25] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-29 21:02:25] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-29 21:02:26] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-29 21:02:26] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-29 21:02:26] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-29 21:02:26] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-29 21:02:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 800 ms
[2024-05-29 21:02:27] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-29 21:02:27] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2024-05-29 21:02:27] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-05-29 21:02:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 458 ms
TRAPS : Iteration 6
[2024-05-29 21:02:28] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-29 21:02:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2024-05-29 21:02:28] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-29 21:02:28] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 3 ms to minimize.
[2024-05-29 21:02:28] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-29 21:02:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 418 ms
[2024-05-29 21:02:29] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-29 21:02:29] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 3 ms to minimize.
[2024-05-29 21:02:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
TRAPS : Iteration 7
[2024-05-29 21:02:29] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-29 21:02:29] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-29 21:02:29] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-29 21:02:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 445 ms
[2024-05-29 21:02:30] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-29 21:02:30] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-29 21:02:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2024-05-29 21:02:30] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-29 21:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
TRAPS : Iteration 8
[2024-05-29 21:02:31] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 2 ms to minimize.
[2024-05-29 21:02:31] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 3 ms to minimize.
[2024-05-29 21:02:32] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 3 ms to minimize.
[2024-05-29 21:02:32] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 3 ms to minimize.
[2024-05-29 21:02:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 746 ms
[2024-05-29 21:02:32] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-29 21:02:32] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 3 ms to minimize.
[2024-05-29 21:02:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2024-05-29 21:02:33] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-29 21:02:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2024-05-29 21:02:33] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-29 21:02:33] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-29 21:02:33] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-29 21:02:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 469 ms
TRAPS : Iteration 9
[2024-05-29 21:02:34] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-29 21:02:34] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-29 21:02:34] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 3 ms to minimize.
[2024-05-29 21:02:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 437 ms
[2024-05-29 21:02:35] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-05-29 21:02:35] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-29 21:02:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
TRAPS : Iteration 10
[2024-05-29 21:02:35] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 3 ms to minimize.
[2024-05-29 21:02:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2024-05-29 21:02:36] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 3 ms to minimize.
[2024-05-29 21:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-05-29 21:02:36] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 3 ms to minimize.
[2024-05-29 21:02:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-05-29 21:02:37] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 4 ms to minimize.
[2024-05-29 21:02:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
TRAPS : Iteration 11
[2024-05-29 21:02:38] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-29 21:02:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2024-05-29 21:02:38] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-29 21:02:38] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-29 21:02:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
TRAPS : Iteration 12
[2024-05-29 21:02:39] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 3 ms to minimize.
[2024-05-29 21:02:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
TRAPS : Iteration 13
[2024-05-29 21:02:41] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 2 ms to minimize.
[2024-05-29 21:02:41] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-29 21:02:41] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 5 ms to minimize.
[2024-05-29 21:02:41] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-29 21:02:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 662 ms
[2024-05-29 21:02:42] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-29 21:02:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
TRAPS : Iteration 14
[2024-05-29 21:02:43] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-29 21:02:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
TRAPS : Iteration 15
[2024-05-29 21:02:44] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-29 21:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2024-05-29 21:02:45] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-29 21:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
TRAPS : Iteration 16
[2024-05-29 21:02:45] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 2 ms to minimize.
[2024-05-29 21:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2024-05-29 21:02:46] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 2 ms to minimize.
[2024-05-29 21:02:46] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-05-29 21:02:46] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-29 21:02:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 504 ms
[2024-05-29 21:02:46] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 3 ms to minimize.
[2024-05-29 21:02:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
TRAPS : Iteration 17
[2024-05-29 21:02:47] [INFO ] After 38297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-05-29 21:02:48] [INFO ] After 40222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2024-05-29 21:02:48] [INFO ] Flatten gal took : 45 ms
[2024-05-29 21:02:48] [INFO ] Flatten gal took : 42 ms
[2024-05-29 21:02:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8084977452336565421.gal : 7 ms
[2024-05-29 21:02:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6122840316436555316.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/ReachabilityCardinality8084977452336565421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6122840316436555316.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6122840316436555316.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :8 after 13
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :13 after 19
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :19 after 58
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :58 after 1624
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :1624 after 48610
Detected timeout of ITS tools.
[2024-05-29 21:03:03] [INFO ] Flatten gal took : 33 ms
[2024-05-29 21:03:03] [INFO ] Applying decomposition
[2024-05-29 21:03:03] [INFO ] Flatten gal took : 28 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/graph3367083531780527313.txt' '-o' '/tmp/graph3367083531780527313.bin' '-w' '/tmp/graph3367083531780527313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3367083531780527313.bin' '-l' '-1' '-v' '-w' '/tmp/graph3367083531780527313.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:03:04] [INFO ] Decomposing Gal with order
[2024-05-29 21:03:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:03:04] [INFO ] Removed a total of 192 redundant transitions.
[2024-05-29 21:03:04] [INFO ] Flatten gal took : 99 ms
[2024-05-29 21:03:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 40 ms.
[2024-05-29 21:03:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3264111258473637947.gal : 16 ms
[2024-05-29 21:03:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality237626116244434244.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/ReachabilityCardinality3264111258473637947.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality237626116244434244.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 ...306
Loading property file /tmp/ReachabilityCardinality237626116244434244.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :2 after 5
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :5 after 1970
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :1970 after 9746
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :9746 after 145826
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :2.89082e+17 after 4.34681e+18
Reachability property ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14 is true.
Reachability property ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10 is true.
Invariant property ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03 does not hold.
Reachability property ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02 is true.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :4.34681e+18 after 1.32438e+50
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 71237 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 21:03:19] [INFO ] Flatten gal took : 54 ms
[2024-05-29 21:03:19] [INFO ] Applying decomposition
[2024-05-29 21:03:19] [INFO ] Flatten gal took : 52 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/graph6163239589673574097.txt' '-o' '/tmp/graph6163239589673574097.bin' '-w' '/tmp/graph6163239589673574097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6163239589673574097.bin' '-l' '-1' '-v' '-w' '/tmp/graph6163239589673574097.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:03:19] [INFO ] Decomposing Gal with order
[2024-05-29 21:03:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:03:20] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-29 21:03:20] [INFO ] Flatten gal took : 109 ms
[2024-05-29 21:03:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 21:03:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7584316473152586846.gal : 20 ms
[2024-05-29 21:03:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8436712328053103362.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/ReachabilityCardinality7584316473152586846.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8436712328053103362.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
Loading property file /tmp/ReachabilityCardinality8436712328053103362.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 2130
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :2130 after 91367
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :2.41733e+09 after 1.48123e+92
Reachability property ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10 is true.
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02 is true.
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1.48123e+92 after 9.92355e+98
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :9.92355e+98 after 9.92355e+98
ITS-tools command line returned an error code 137
[2024-05-29 21:11:17] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4540845083126383747
[2024-05-29 21:11:17] [INFO ] Applying decomposition
[2024-05-29 21:11:17] [INFO ] Computing symmetric may disable matrix : 732 transitions.
[2024-05-29 21:11:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:11:17] [INFO ] Computing symmetric may enable matrix : 732 transitions.
[2024-05-29 21:11:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:11:17] [INFO ] Flatten gal took : 23 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/graph2431298528921790143.txt' '-o' '/tmp/graph2431298528921790143.bin' '-w' '/tmp/graph2431298528921790143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2431298528921790143.bin' '-l' '-1' '-v' '-w' '/tmp/graph2431298528921790143.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:11:17] [INFO ] Decomposing Gal with order
[2024-05-29 21:11:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:11:17] [INFO ] Computing Do-Not-Accords matrix : 732 transitions.
[2024-05-29 21:11:17] [INFO ] Removed a total of 357 redundant transitions.
[2024-05-29 21:11:17] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:11:17] [INFO ] Flatten gal took : 40 ms
[2024-05-29 21:11:17] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4540845083126383747
Running compilation step : cd /tmp/ltsmin4540845083126383747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' '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'
[2024-05-29 21:11:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 47 ms.
[2024-05-29 21:11:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5179711221264167850.gal : 15 ms
[2024-05-29 21:11:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8150058599797772721.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/ReachabilityCardinality5179711221264167850.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8150058599797772721.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
Loading property file /tmp/ReachabilityCardinality8150058599797772721.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 151
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :151 after 1999
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1999 after 86743
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :86743 after 1.28327e+07
Reachability property ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14 is true.
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1.28327e+07 after 3.9025e+43
Compilation finished in 2392 ms.
Running link step : cd /tmp/ltsmin4540845083126383747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>102 s) on command cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202403==true'
WARNING : LTSmin timed out (>102 s) on command cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202403==true'
Running LTSmin : cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202405==true'
WARNING : LTSmin timed out (>102 s) on command cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202405==true'
Running LTSmin : cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202408==true'
WARNING : LTSmin timed out (>102 s) on command cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202408==true'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202401==true'
WARNING : LTSmin timed out (>822 s) on command cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202401==true'
Running LTSmin : cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202403==true'
ITS-tools command line returned an error code 137
[2024-05-29 21:33:32] [INFO ] Applying decomposition
[2024-05-29 21:33:32] [INFO ] Flatten gal took : 49 ms
[2024-05-29 21:33:32] [INFO ] Decomposing Gal with order
[2024-05-29 21:33:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:33:33] [INFO ] Removed a total of 363 redundant transitions.
[2024-05-29 21:33:33] [INFO ] Flatten gal took : 81 ms
[2024-05-29 21:33:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 282 ms.
[2024-05-29 21:33:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6001915676267615399.gal : 25 ms
[2024-05-29 21:33:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality45264506329344578.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/ReachabilityCardinality6001915676267615399.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality45264506329344578.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 ...305
Loading property file /tmp/ReachabilityCardinality45264506329344578.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :2 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 998
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :998 after 9746
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :9746 after 145826
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :145826 after 5.50499e+15
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5.50499e+15 after 6.70949e+18
Reachability property ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08 is true.
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05 is true.
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03 does not hold.
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6.70949e+18 after 2.61592e+50
pins2lts-mc-linux64, 0.000: Registering PINS so language module
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.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.083: Initializing POR dependencies: labels 739, guards 732
pins2lts-mc-linux64( 2/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.102: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.113: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 13.944: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 0/ 8), 13.965: "ShieldPPPtPT030BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 13.963: "ShieldPPPtPT030BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 13.966: There are 739 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 13.966: State length is 868, there are 732 groups
pins2lts-mc-linux64( 0/ 8), 13.966: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 13.966: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 13.966: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 13.966: Visible groups: 0 / 732, labels: 1 / 739
pins2lts-mc-linux64( 0/ 8), 13.966: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 13.966: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 13.965: "ShieldPPPtPT030BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 13.963: "ShieldPPPtPT030BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 13.964: "ShieldPPPtPT030BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 13.964: "ShieldPPPtPT030BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 13.965: "ShieldPPPtPT030BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 13.964: "ShieldPPPtPT030BReachabilityCardinality202403==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 14.019: ~56 levels ~960 states ~1872 transitions
pins2lts-mc-linux64( 0/ 8), 14.072: ~57 levels ~1920 states ~5392 transitions
pins2lts-mc-linux64( 0/ 8), 14.206: ~59 levels ~3840 states ~13048 transitions
pins2lts-mc-linux64( 0/ 8), 14.467: ~60 levels ~7680 states ~28056 transitions
pins2lts-mc-linux64( 1/ 8), 14.957: ~14 levels ~15360 states ~52072 transitions
pins2lts-mc-linux64( 1/ 8), 15.711: ~15 levels ~30720 states ~107776 transitions
pins2lts-mc-linux64( 1/ 8), 17.214: ~16 levels ~61440 states ~229416 transitions
pins2lts-mc-linux64( 1/ 8), 20.482: ~18 levels ~122880 states ~513056 transitions
pins2lts-mc-linux64( 1/ 8), 26.683: ~19 levels ~245760 states ~1078208 transitions
pins2lts-mc-linux64( 1/ 8), 40.115: ~20 levels ~491520 states ~2375720 transitions
pins2lts-mc-linux64( 1/ 8), 68.371: ~21 levels ~983040 states ~5183552 transitions
pins2lts-mc-linux64( 1/ 8), 131.012: ~22 levels ~1966080 states ~11273280 transitions
pins2lts-mc-linux64( 2/ 8), 257.380: ~21 levels ~3932160 states ~24542576 transitions
pins2lts-mc-linux64( 1/ 8), 515.996: ~25 levels ~7864320 states ~51369688 transitions
pins2lts-mc-linux64( 4/ 8), 535.390: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 535.585:
pins2lts-mc-linux64( 0/ 8), 535.585: mean standard work distribution: 4.7% (states) 2.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 535.585:
pins2lts-mc-linux64( 0/ 8), 535.585: Explored 7651631 states 54584910 transitions, fanout: 7.134
pins2lts-mc-linux64( 0/ 8), 535.585: Total exploration time 521.610 sec (521.460 sec minimum, 521.516 sec on average)
pins2lts-mc-linux64( 0/ 8), 535.585: States per second: 14669, Transitions per second: 104647
pins2lts-mc-linux64( 0/ 8), 535.585: Ignoring proviso: 4976264
pins2lts-mc-linux64( 0/ 8), 535.585:
pins2lts-mc-linux64( 0/ 8), 535.585: Queue width: 8B, total height: 6696430, memory: 51.09MB
pins2lts-mc-linux64( 0/ 8), 535.585: Tree memory: 365.5MB, 26.7 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 535.585: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 535.585: Stored 793 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 535.585: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 535.585: Est. total memory use: 416.6MB (~1075.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202403==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4540845083126383747;'/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' 'ShieldPPPtPT030BReachabilityCardinality202403==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:121)
at java.base/java.lang.Thread.run(Thread.java:840)
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.61592e+50 after 1.11183e+57
Detected timeout of ITS tools.
[2024-05-29 21:57:05] [INFO ] Flatten gal took : 22 ms
[2024-05-29 21:57:05] [INFO ] Input system was already deterministic with 732 transitions.
[2024-05-29 21:57:05] [INFO ] Transformed 868 places.
[2024-05-29 21:57:05] [INFO ] Transformed 732 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 21:57:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8974362031114214397.gal : 4 ms
[2024-05-29 21:57:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11673617088159155027.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/ReachabilityCardinality8974362031114214397.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11673617088159155027.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...374
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityCardinality11673617088159155027.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 166
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :166 after 7426
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7426 after 84398
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :84398 after 86350
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :86350 after 234307
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :234307 after 2.61389e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.61389e+06 after 7.92586e+09
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7.92586e+09 after 5.21545e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.21545e+11 after 3.41736e+15
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.41736e+15 after 1.90801e+18
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.90801e+18 after 1.94132e+23
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.94132e+23 after 1.84881e+27

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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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-171683761600654"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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