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-171683760800302.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 ShieldIIPt-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-171683760800302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 512K 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 ShieldIIPt-PT-030B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716936652210

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 22:50:53] [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-28 22:50:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:50:53] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-28 22:50:53] [INFO ] Transformed 2103 places.
[2024-05-28 22:50:53] [INFO ] Transformed 1953 transitions.
[2024-05-28 22:50:53] [INFO ] Found NUPN structural information;
[2024-05-28 22:50:53] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2224 ms. (17 steps per ms) remains 9/15 properties
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 22:50:54] [INFO ] Flatten gal took : 246 ms
BEST_FIRST walk for 40003 steps (8 resets) in 550 ms. (72 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
[2024-05-28 22:50:54] [INFO ] Flatten gal took : 188 ms
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 9/9 properties
[2024-05-28 22:50:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10698302000692922802.gal : 84 ms
[2024-05-28 22:50:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17435232139526508201.prop : 4 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/ReachabilityCardinality10698302000692922802.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17435232139526508201.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 ...330
Loading property file /tmp/ReachabilityCardinality17435232139526508201.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 1124 ms. (35 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
// Phase 1: matrix 1953 rows 2103 cols
[2024-05-28 22:50:55] [INFO ] Computed 271 invariants in 42 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 136/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ShieldIIPt-PT-030B-ReachabilityCardinality-2024-15 is UNSAT
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1909/2045 variables, 262/398 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2045 variables, 1909/2307 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2045 variables, 0/2307 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 58/2103 variables, 9/2316 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2103 variables, 58/2374 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2103 variables, 0/2374 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :36 after 136
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :136 after 671
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :671 after 90101
At refinement iteration 8 (OVERLAPS) 1953/4056 variables, 2103/4477 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :90101 after 2.31482e+09
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :2.31482e+09 after 4.68295e+19
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :4.68295e+19 after 5.67854e+39
At refinement iteration 9 (INCLUDED_ONLY) 0/4056 variables, 0/4477 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/4056 variables, 0/4477 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4056/4056 variables, and 4477 constraints, problems are : Problem set: 1 solved, 8 unsolved in 2990 ms.
Refiners :[Domain max(s): 2103/2103 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 2103/2103 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem ShieldIIPt-PT-030B-ReachabilityCardinality-2024-07 is UNSAT
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1915/2045 variables, 262/392 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2045 variables, 1915/2307 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-28 22:50:59] [INFO ] Deduced a trap composed of 12 places in 449 ms of which 62 ms to minimize.
[2024-05-28 22:50:59] [INFO ] Deduced a trap composed of 21 places in 351 ms of which 7 ms to minimize.
[2024-05-28 22:51:00] [INFO ] Deduced a trap composed of 23 places in 311 ms of which 6 ms to minimize.
[2024-05-28 22:51:00] [INFO ] Deduced a trap composed of 25 places in 287 ms of which 6 ms to minimize.
[2024-05-28 22:51:00] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 5 ms to minimize.
[2024-05-28 22:51:01] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 6 ms to minimize.
[2024-05-28 22:51:01] [INFO ] Deduced a trap composed of 20 places in 285 ms of which 5 ms to minimize.
[2024-05-28 22:51:01] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 6 ms to minimize.
[2024-05-28 22:51:02] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 7 ms to minimize.
[2024-05-28 22:51:02] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 6 ms to minimize.
[2024-05-28 22:51:02] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 5 ms to minimize.
[2024-05-28 22:51:03] [INFO ] Deduced a trap composed of 27 places in 271 ms of which 5 ms to minimize.
[2024-05-28 22:51:03] [INFO ] Deduced a trap composed of 41 places in 287 ms of which 5 ms to minimize.
[2024-05-28 22:51:03] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 5 ms to minimize.
SMT process timed out in 8285ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 438 transitions
Trivial Post-agglo rules discarded 438 transitions
Performed 438 trivial Post agglomeration. Transition count delta: 438
Iterating post reduction 0 with 438 rules applied. Total rules applied 438 place count 2103 transition count 1515
Reduce places removed 438 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 452 rules applied. Total rules applied 890 place count 1665 transition count 1501
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 904 place count 1651 transition count 1501
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 904 place count 1651 transition count 1371
Deduced a syphon composed of 130 places in 7 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 1164 place count 1521 transition count 1371
Discarding 188 places :
Symmetric choice reduction at 3 with 188 rule applications. Total rules 1352 place count 1333 transition count 1183
Iterating global reduction 3 with 188 rules applied. Total rules applied 1540 place count 1333 transition count 1183
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 1540 place count 1333 transition count 1104
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 1698 place count 1254 transition count 1104
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 2 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 2598 place count 804 transition count 654
Renaming transitions due to excessive name length > 1024 char.
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2754 place count 726 transition count 699
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2755 place count 726 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2756 place count 726 transition count 697
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2762 place count 726 transition count 691
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2768 place count 720 transition count 691
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 5 with 23 rules applied. Total rules applied 2791 place count 720 transition count 691
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2792 place count 720 transition count 691
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2793 place count 719 transition count 690
Applied a total of 2793 rules in 757 ms. Remains 719 /2103 variables (removed 1384) and now considering 690/1953 (removed 1263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 767 ms. Remains : 719/2103 places, 690/1953 transitions.
RANDOM walk for 40000 steps (8 resets) in 549 ms. (72 steps per ms) remains 6/7 properties
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
// Phase 1: matrix 690 rows 719 cols
[2024-05-28 22:51:05] [INFO ] Computed 271 invariants in 4 ms
[2024-05-28 22:51:05] [INFO ] State equation strengthened by 216 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 606/699 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/717 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 689/1406 variables, 717/987 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1406 variables, 215/1202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1406 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/1409 variables, 2/1204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1409 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1409 variables, 1/1206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1409 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1409 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1409/1409 variables, and 1206 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 719/719 constraints, ReadFeed: 216/216 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 606/699 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:51:06] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-28 22:51:06] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
[2024-05-28 22:51:06] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-28 22:51:06] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:51:06] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-05-28 22:51:06] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 2 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:51:07] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:51:08] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/699 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:51:08] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:51:08] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:51:08] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-05-28 22:51:08] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-28 22:51:08] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-28 22:51:08] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:51:08] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-05-28 22:51:08] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18/717 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 689/1406 variables, 717/1015 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1406 variables, 215/1230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1406 variables, 5/1235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:51:10] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 3 ms to minimize.
[2024-05-28 22:51:10] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-28 22:51:10] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1406 variables, 3/1238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1406 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/1409 variables, 2/1240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1409 variables, 1/1241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1409 variables, 1/1242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1409 variables, 1/1243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:51:12] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1409 variables, 1/1244 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:51:13] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1409 variables, 1/1245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1409 variables, 0/1245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1409 variables, 0/1245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1409/1409 variables, and 1245 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9030 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 719/719 constraints, ReadFeed: 216/216 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 33/33 constraints]
After SMT, in 10334ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 9763 ms.
Support contains 93 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 719 transition count 684
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 713 transition count 683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 712 transition count 683
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 30 place count 704 transition count 675
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 702 transition count 675
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 702 transition count 673
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 700 transition count 673
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 700 transition count 673
Applied a total of 40 rules in 126 ms. Remains 700 /719 variables (removed 19) and now considering 673/690 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 700/719 places, 673/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 506 ms. (78 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 292 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 165111 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 6
Probabilistic random walk after 165111 steps, saw 93874 distinct states, run finished after 3014 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 673 rows 700 cols
[2024-05-28 22:51:28] [INFO ] Computed 271 invariants in 4 ms
[2024-05-28 22:51:28] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 587/680 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/698 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/698 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 672/1370 variables, 698/968 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1370 variables, 219/1187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1370 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/1373 variables, 2/1189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1373 variables, 1/1190 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1373 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1373 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1373 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1373/1373 variables, and 1191 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 700/700 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 587/680 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:51:30] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-28 22:51:30] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:51:30] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:51:30] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:51:30] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:51:30] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:51:30] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:51:30] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 8 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 19/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-28 22:51:31] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:51:32] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-05-28 22:51:32] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-28 22:51:32] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:51:32] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:51:32] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:51:32] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-28 22:51:32] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/680 variables, 10/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/680 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 18/698 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 672/1370 variables, 698/997 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1370 variables, 219/1216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1370 variables, 5/1221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:51:34] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-28 22:51:34] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1370 variables, 2/1223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1370 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/1373 variables, 2/1225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1373 variables, 1/1226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1373 variables, 1/1227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1373 variables, 1/1228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 22:51:35] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1373 variables, 1/1229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1373 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1373 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1373/1373 variables, and 1229 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7189 ms.
Refiners :[Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 700/700 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 32/32 constraints]
After SMT, in 8489ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4359 ms.
Support contains 93 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 673/673 transitions.
Applied a total of 0 rules in 16 ms. Remains 700 /700 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 700/700 places, 673/673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 673/673 transitions.
Applied a total of 0 rules in 14 ms. Remains 700 /700 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2024-05-28 22:51:41] [INFO ] Invariant cache hit.
[2024-05-28 22:51:42] [INFO ] Implicit Places using invariants in 544 ms returned [684]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 552 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 699/700 places, 673/673 transitions.
Applied a total of 0 rules in 14 ms. Remains 699 /699 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 605 ms. Remains : 699/700 places, 673/673 transitions.
RANDOM walk for 40000 steps (8 resets) in 824 ms. (48 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 478 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 318 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 5/6 properties
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
// Phase 1: matrix 673 rows 699 cols
[2024-05-28 22:51:43] [INFO ] Computed 270 invariants in 3 ms
[2024-05-28 22:51:43] [INFO ] State equation strengthened by 218 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 591/680 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/697 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 672/1369 variables, 697/966 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1369 variables, 217/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1369 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 3/1372 variables, 2/1185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1372 variables, 1/1186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1372 variables, 1/1187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1372 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1372 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1372/1372 variables, and 1187 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 699/699 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 591/680 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:51:44] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:51:44] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:51:44] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:51:44] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:51:44] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 18/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/680 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 17/697 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:51:45] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:51:46] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:51:46] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-28 22:51:46] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 672/1369 variables, 697/988 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 217/1205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 4/1209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:51:47] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:51:47] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-28 22:51:47] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-28 22:51:48] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-28 22:51:48] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-28 22:51:48] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-28 22:51:48] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1369 variables, 7/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1369 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/1372 variables, 2/1218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1372 variables, 1/1219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1372 variables, 1/1220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1372 variables, 1/1221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:51:49] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:51:50] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1372 variables, 2/1223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1372 variables, 0/1223 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:51:51] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:51:51] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:51:51] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-28 22:51:51] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/1372 variables, 4/1227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:51:51] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:51:52] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1372 variables, 2/1229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1372 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1372 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1372/1372 variables, and 1229 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8835 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 699/699 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 37/37 constraints]
After SMT, in 9997ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6031 ms.
Support contains 89 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 673/673 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 694 transition count 668
Applied a total of 10 rules in 33 ms. Remains 694 /699 variables (removed 5) and now considering 668/673 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 694/699 places, 668/673 transitions.
RANDOM walk for 40000 steps (8 resets) in 432 ms. (92 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 173974 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 5
Probabilistic random walk after 173974 steps, saw 100905 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 668 rows 694 cols
[2024-05-28 22:52:03] [INFO ] Computed 270 invariants in 16 ms
[2024-05-28 22:52:03] [INFO ] State equation strengthened by 218 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 586/675 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/675 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/692 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 667/1359 variables, 692/961 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1359 variables, 217/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1359 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 3/1362 variables, 2/1180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1362 variables, 1/1181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1362 variables, 1/1182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1362 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1362 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1362/1362 variables, and 1182 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1049 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 694/694 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 586/675 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:52:04] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:52:05] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-28 22:52:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-28 22:52:05] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
[2024-05-28 22:52:05] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:52:05] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:52:05] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/675 variables, 18/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/675 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 17/692 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 667/1359 variables, 692/979 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1359 variables, 217/1196 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1359 variables, 4/1200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:52:07] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1359 variables, 1/1201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1359 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/1362 variables, 2/1203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1362 variables, 1/1204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1362 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1362 variables, 1/1206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:52:09] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1362 variables, 1/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 22:52:10] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-28 22:52:10] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-28 22:52:10] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-28 22:52:10] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-28 22:52:10] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:52:11] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-05-28 22:52:11] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1362 variables, 7/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1362 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/1362 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1362/1362 variables, and 1214 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8864 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 694/694 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 27/27 constraints]
After SMT, in 9951ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4501 ms.
Support contains 89 out of 694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 668/668 transitions.
Applied a total of 0 rules in 13 ms. Remains 694 /694 variables (removed 0) and now considering 668/668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 694/694 places, 668/668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 668/668 transitions.
Applied a total of 0 rules in 12 ms. Remains 694 /694 variables (removed 0) and now considering 668/668 (removed 0) transitions.
[2024-05-28 22:52:17] [INFO ] Invariant cache hit.
[2024-05-28 22:52:17] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-28 22:52:17] [INFO ] Invariant cache hit.
[2024-05-28 22:52:18] [INFO ] State equation strengthened by 218 read => feed constraints.
[2024-05-28 22:52:19] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
[2024-05-28 22:52:19] [INFO ] Redundant transitions in 33 ms returned []
Running 666 sub problems to find dead transitions.
[2024-05-28 22:52:19] [INFO ] Invariant cache hit.
[2024-05-28 22:52:19] [INFO ] State equation strengthened by 218 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/692 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (OVERLAPS) 2/694 variables, 269/270 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 22:52:32] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-28 22:52:32] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-28 22:52:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-28 22:52:32] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-28 22:52:32] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 22:52:32] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 22:52:32] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-28 22:52:33] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-28 22:52:41] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 22:52:42] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-28 22:52:42] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-28 22:52:42] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-28 22:52:42] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-28 22:52:43] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 22:52:43] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-28 22:52:43] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 22:52:44] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-28 22:52:44] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 22:52:48] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 694/1362 variables, and 311 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 0/694 constraints, ReadFeed: 0/218 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 666 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/692 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 2 (OVERLAPS) 2/694 variables, 269/270 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 41/311 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 22:53:02] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-28 22:53:03] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 22:53:04] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 4 ms to minimize.
[2024-05-28 22:53:04] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 22:53:04] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 5/316 constraints. Problems are: Problem set: 0 solved, 666 unsolved
[2024-05-28 22:53:05] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 7 (OVERLAPS) 668/1362 variables, 694/1011 constraints. Problems are: Problem set: 0 solved, 666 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1362 variables, 218/1229 constraints. Problems are: Problem set: 0 solved, 666 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1362/1362 variables, and 1895 constraints, problems are : Problem set: 0 solved, 666 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 270/270 constraints, State Equation: 694/694 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 666/666 constraints, Known Traps: 47/47 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 666 unsolved
Search for dead transitions found 0 dead transitions in 60301ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62380 ms. Remains : 694/694 places, 668/668 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 108 times.
Drop transitions (Partial Free agglomeration) removed 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 108 place count 694 transition count 668
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 694 transition count 666
Applied a total of 110 rules in 38 ms. Remains 694 /694 variables (removed 0) and now considering 666/668 (removed 2) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 666 rows 694 cols
[2024-05-28 22:53:19] [INFO ] Computed 270 invariants in 2 ms
[2024-05-28 22:53:20] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-28 22:53:20] [INFO ] [Nat]Absence check using 270 positive place invariants in 43 ms returned sat
[2024-05-28 22:53:20] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-28 22:53:20] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-28 22:53:21] [INFO ] After 510ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-28 22:53:21] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-05-28 22:53:21] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-28 22:53:21] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-05-28 22:53:21] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-28 22:53:21] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-28 22:53:21] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-28 22:53:22] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-28 22:53:22] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:53:22] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2024-05-28 22:53:22] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-05-28 22:53:22] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-28 22:53:22] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-28 22:53:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1253 ms
[2024-05-28 22:53:22] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-28 22:53:23] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 3 ms to minimize.
[2024-05-28 22:53:23] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 2 ms to minimize.
[2024-05-28 22:53:23] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 22:53:23] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-05-28 22:53:23] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-28 22:53:23] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-05-28 22:53:23] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-28 22:53:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 998 ms
[2024-05-28 22:53:24] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:53:24] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-28 22:53:24] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-28 22:53:24] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-28 22:53:24] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-28 22:53:24] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-28 22:53:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 604 ms
TRAPS : Iteration 1
[2024-05-28 22:53:24] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-28 22:53:24] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-28 22:53:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2024-05-28 22:53:25] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-28 22:53:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-28 22:53:25] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-28 22:53:25] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-28 22:53:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2024-05-28 22:53:25] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-28 22:53:25] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 22:53:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
TRAPS : Iteration 2
[2024-05-28 22:53:26] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-28 22:53:26] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 22:53:26] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-28 22:53:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 359 ms
[2024-05-28 22:53:26] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-28 22:53:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-28 22:53:27] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-28 22:53:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
TRAPS : Iteration 3
[2024-05-28 22:53:27] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-28 22:53:27] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-28 22:53:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
TRAPS : Iteration 4
[2024-05-28 22:53:28] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 3 ms to minimize.
[2024-05-28 22:53:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-05-28 22:53:28] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 3 ms to minimize.
[2024-05-28 22:53:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2024-05-28 22:53:28] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-28 22:53:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
TRAPS : Iteration 5
[2024-05-28 22:53:29] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-28 22:53:29] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-05-28 22:53:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
TRAPS : Iteration 6
[2024-05-28 22:53:30] [INFO ] After 9699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-28 22:53:30] [INFO ] After 10916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2024-05-28 22:53:31] [INFO ] Flatten gal took : 47 ms
[2024-05-28 22:53:31] [INFO ] Flatten gal took : 41 ms
[2024-05-28 22:53:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6814357026848153702.gal : 6 ms
[2024-05-28 22:53:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5131184767697537894.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/ReachabilityCardinality6814357026848153702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5131184767697537894.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/ReachabilityCardinality5131184767697537894.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :32 after 182
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :182 after 3962
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :3962 after 1.4256e+06
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1.4256e+06 after 2.15551e+11
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-2024-10 is true.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.15551e+11 after 9.36216e+13
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-2024-08 is true.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :9.36216e+13 after 9.36216e+13
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :9.36216e+13 after 9.36216e+13
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :9.36216e+13 after 9.36216e+13
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :9.36216e+13 after 9.36221e+13
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :9.36221e+13 after 9.38529e+13
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :9.38529e+13 after 6.00003e+14
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :6.00003e+14 after 3.97275e+18
Detected timeout of ITS tools.
[2024-05-28 22:53:46] [INFO ] Flatten gal took : 29 ms
[2024-05-28 22:53:46] [INFO ] Applying decomposition
[2024-05-28 22:53:46] [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/graph18112572128066337643.txt' '-o' '/tmp/graph18112572128066337643.bin' '-w' '/tmp/graph18112572128066337643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18112572128066337643.bin' '-l' '-1' '-v' '-w' '/tmp/graph18112572128066337643.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:53:46] [INFO ] Decomposing Gal with order
[2024-05-28 22:53:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:53:46] [INFO ] Removed a total of 365 redundant transitions.
[2024-05-28 22:53:46] [INFO ] Flatten gal took : 86 ms
[2024-05-28 22:53:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 61 ms.
[2024-05-28 22:53:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6245773239538502477.gal : 11 ms
[2024-05-28 22:53:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2355437887940814082.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/ReachabilityCardinality6245773239538502477.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2355437887940814082.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/ReachabilityCardinality2355437887940814082.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :2 after 3
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3 after 32
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :32 after 1982
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1982 after 1.4256e+06
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.4256e+06 after 4.09546e+12
Invariant property ShieldIIPt-PT-030B-ReachabilityCardinality-2024-14 does not hold.
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-2024-01 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.0675e+15 after 1.54924e+39
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 41969 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 22:54:01] [INFO ] Flatten gal took : 44 ms
[2024-05-28 22:54:01] [INFO ] Applying decomposition
[2024-05-28 22:54:01] [INFO ] Flatten gal took : 43 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/graph7428841462128309263.txt' '-o' '/tmp/graph7428841462128309263.bin' '-w' '/tmp/graph7428841462128309263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7428841462128309263.bin' '-l' '-1' '-v' '-w' '/tmp/graph7428841462128309263.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:54:02] [INFO ] Decomposing Gal with order
[2024-05-28 22:54:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:54:02] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-28 22:54:02] [INFO ] Flatten gal took : 104 ms
[2024-05-28 22:54:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-28 22:54:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8530876370238860977.gal : 20 ms
[2024-05-28 22:54:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15587052864828050385.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/ReachabilityCardinality8530876370238860977.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15587052864828050385.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15587052864828050385.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 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 9321
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :9321 after 4.49281e+15
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :4.49281e+15 after 1.5006e+90
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-2024-10 is true.
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-2024-08 is true.
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-030B-ReachabilityCardinality-2024-01 is true.
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.5006e+90 after 7.8711e+105
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7.8711e+105 after 5.4303e+108
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5.4303e+108 after 4.37295e+109
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4.37295e+109 after 4.37305e+109
ITS-tools command line returned an error code 137
[2024-05-28 23:09:11] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6093780357834745275
[2024-05-28 23:09:11] [INFO ] Computing symmetric may disable matrix : 668 transitions.
[2024-05-28 23:09:11] [INFO ] Applying decomposition
[2024-05-28 23:09:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:09:11] [INFO ] Computing symmetric may enable matrix : 668 transitions.
[2024-05-28 23:09:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 23:09:11] [INFO ] Flatten gal took : 49 ms
[2024-05-28 23:09:11] [INFO ] Computing Do-Not-Accords matrix : 668 transitions.
[2024-05-28 23:09:11] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14425540992717806920.txt' '-o' '/tmp/graph14425540992717806920.bin' '-w' '/tmp/graph14425540992717806920.weights'
[2024-05-28 23:09:11] [INFO ] Built C files in 344ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6093780357834745275
Running compilation step : cd /tmp/ltsmin6093780357834745275;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14425540992717806920.bin' '-l' '-1' '-v' '-w' '/tmp/graph14425540992717806920.weights' '-q' '0' '-e' '0.001'
[2024-05-28 23:09:11] [INFO ] Decomposing Gal with order
[2024-05-28 23:09:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 23:09:11] [INFO ] Removed a total of 497 redundant transitions.
[2024-05-28 23:09:11] [INFO ] Flatten gal took : 81 ms
[2024-05-28 23:09:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 222 labels/synchronizations in 17 ms.
[2024-05-28 23:09:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10383368156163067305.gal : 11 ms
[2024-05-28 23:09:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality643402106170545700.prop : 12 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/ReachabilityCardinality10383368156163067305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality643402106170545700.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/ReachabilityCardinality643402106170545700.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 662
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :662 after 158402
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :158402 after 5.13216e+09
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.44838e+15 after 2.51061e+49
Compilation finished in 2383 ms.
Running link step : cd /tmp/ltsmin6093780357834745275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6093780357834745275;'/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' 'ShieldIIPtPT030BReachabilityCardinality202400==true'
WARNING : LTSmin timed out (>360 s) on command cd /tmp/ltsmin6093780357834745275;'/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' 'ShieldIIPtPT030BReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin6093780357834745275;'/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' 'ShieldIIPtPT030BReachabilityCardinality202414==true'
WARNING : LTSmin timed out (>360 s) on command cd /tmp/ltsmin6093780357834745275;'/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' 'ShieldIIPtPT030BReachabilityCardinality202414==true'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin6093780357834745275;'/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' 'ShieldIIPtPT030BReachabilityCardinality202400==true'
Detected timeout of ITS tools.
[2024-05-28 23:35:16] [INFO ] Applying decomposition
[2024-05-28 23:35:16] [INFO ] Flatten gal took : 73 ms
[2024-05-28 23:35:17] [INFO ] Decomposing Gal with order
[2024-05-28 23:35:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 23:35:17] [INFO ] Removed a total of 597 redundant transitions.
[2024-05-28 23:35:17] [INFO ] Flatten gal took : 88 ms
[2024-05-28 23:35:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 82 ms.
[2024-05-28 23:35:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14422855118200323132.gal : 23 ms
[2024-05-28 23:35:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12358132358325535167.prop : 4 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/ReachabilityCardinality14422855118200323132.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12358132358325535167.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12358132358325535167.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 5
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :5 after 19802
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :19802 after 3.0793e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3.44838e+15 after 1.84581e+21

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-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 ShieldIIPt-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-171683760800302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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