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-171683760500175.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760500175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.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.3K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 1.7M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716923546095

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 19:12:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 19:12:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:12:27] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2024-05-28 19:12:27] [INFO ] Transformed 6003 places.
[2024-05-28 19:12:27] [INFO ] Transformed 5903 transitions.
[2024-05-28 19:12:27] [INFO ] Found NUPN structural information;
[2024-05-28 19:12:27] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 683 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3435 ms. (11 steps per ms) remains 9/16 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 19:12:29] [INFO ] Flatten gal took : 663 ms
BEST_FIRST walk for 40004 steps (8 resets) in 574 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
[2024-05-28 19:12:29] [INFO ] Flatten gal took : 292 ms
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
[2024-05-28 19:12:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15460558379508337632.gal : 181 ms
[2024-05-28 19:12:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15892896388298595385.prop : 2 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/ReachabilityCardinality15460558379508337632.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15892896388298595385.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
BEST_FIRST walk for 40004 steps (8 resets) in 620 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
// Phase 1: matrix 5903 rows 6003 cols
[2024-05-28 19:12:30] [INFO ] Computed 901 invariants in 59 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Loading property file /tmp/ReachabilityCardinality15892896388298595385.prop.
At refinement iteration 2 (OVERLAPS) 5232/5396 variables, 799/963 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5396 variables, 5232/6195 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/5396 variables, 0/6195 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 607/6003 variables, 102/6297 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6003 variables, 607/6904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6003 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11906/11906 variables, and 12907 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5033 ms.
Refiners :[Domain max(s): 6003/6003 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 6003/6003 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 5232/5396 variables, 799/963 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5396 variables, 5232/6195 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-28 19:12:39] [INFO ] Deduced a trap composed of 52 places in 1969 ms of which 143 ms to minimize.
[2024-05-28 19:12:41] [INFO ] Deduced a trap composed of 35 places in 2660 ms of which 19 ms to minimize.
SMT process timed out in 11748ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 164 out of 6003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6003/6003 places, 5903/5903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 468 transitions
Trivial Post-agglo rules discarded 468 transitions
Performed 468 trivial Post agglomeration. Transition count delta: 468
Iterating post reduction 0 with 468 rules applied. Total rules applied 468 place count 6003 transition count 5435
Reduce places removed 468 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 479 rules applied. Total rules applied 947 place count 5535 transition count 5424
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 958 place count 5524 transition count 5424
Performed 496 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 496 Pre rules applied. Total rules applied 958 place count 5524 transition count 4928
Deduced a syphon composed of 496 places in 65 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 3 with 992 rules applied. Total rules applied 1950 place count 5028 transition count 4928
Discarding 671 places :
Symmetric choice reduction at 3 with 671 rule applications. Total rules 2621 place count 4357 transition count 4257
Iterating global reduction 3 with 671 rules applied. Total rules applied 3292 place count 4357 transition count 4257
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 3292 place count 4357 transition count 4006
Deduced a syphon composed of 251 places in 25 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 3 with 502 rules applied. Total rules applied 3794 place count 4106 transition count 4006
Performed 1443 Post agglomeration using F-continuation condition.Transition count delta: 1443
Deduced a syphon composed of 1443 places in 42 ms
Reduce places removed 1443 places and 0 transitions.
Iterating global reduction 3 with 2886 rules applied. Total rules applied 6680 place count 2663 transition count 2563
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 661 times.
Drop transitions (Partial Free agglomeration) removed 661 transitions
Iterating global reduction 3 with 661 rules applied. Total rules applied 7341 place count 2663 transition count 2563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7342 place count 2662 transition count 2562
Applied a total of 7342 rules in 2600 ms. Remains 2662 /6003 variables (removed 3341) and now considering 2562/5903 (removed 3341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2612 ms. Remains : 2662/6003 places, 2562/5903 transitions.
RANDOM walk for 40000 steps (8 resets) in 1268 ms. (31 steps per ms) remains 5/9 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 962 ms. (41 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 621 ms. (64 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 746 ms. (53 steps per ms) remains 4/5 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 649 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 726 ms. (55 steps per ms) remains 4/4 properties
// Phase 1: matrix 2562 rows 2662 cols
[2024-05-28 19:12:46] [INFO ] Computed 901 invariants in 70 ms
[2024-05-28 19:12:46] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2194/2282 variables, 765/765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2282 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 204/2486 variables, 71/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2486 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 18/2504 variables, 9/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2504 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2432/4936 variables, 2504/3349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4936 variables, 0/3349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 113/5049 variables, 52/3401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5049 variables, 16/3417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5049 variables, 4/3421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5049 variables, 0/3421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/5053 variables, 2/3423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5053 variables, 2/3425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5053 variables, 0/3425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 16/5069 variables, 7/3432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5069 variables, 1/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5069 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 4/5073 variables, 2/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5073 variables, 0/3435 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 89/5162 variables, 61/3496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5162 variables, 10/3506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5162 variables, 0/3506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 3/5165 variables, 3/3509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5165 variables, 3/3512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5165 variables, 0/3512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 4/5169 variables, 2/3514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/5169 variables, 4/3518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/5169 variables, 0/3518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 36/5205 variables, 22/3540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/5205 variables, 9/3549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5205 variables, 0/3549 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 13/5218 variables, 8/3557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/5218 variables, 1/3558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/5218 variables, 0/3558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 1/5219 variables, 2/3560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5219 variables, 1/3561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5219 variables, 0/3561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 5/5224 variables, 4/3565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5224 variables, 2/3567 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/5224 variables, 0/3567 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 0/5224 variables, 0/3567 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5224/5224 variables, and 3567 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5436 ms.
Refiners :[Positive P Invariants (semi-flows): 890/890 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 2662/2662 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2194/2282 variables, 765/765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:12:52] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
[2024-05-28 19:12:52] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 2 ms to minimize.
[2024-05-28 19:12:52] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:12:52] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:12:52] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 3 ms to minimize.
[2024-05-28 19:12:53] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:12:53] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:12:53] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:12:53] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:12:53] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:12:53] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-05-28 19:12:53] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-28 19:12:54] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-28 19:12:54] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2024-05-28 19:12:54] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-28 19:12:54] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-28 19:12:54] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 19:12:54] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-28 19:12:54] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-28 19:12:55] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2282 variables, 20/785 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:12:55] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-28 19:12:55] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-28 19:12:55] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-28 19:12:55] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 19:12:55] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-28 19:12:55] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 19:12:55] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2282 variables, 7/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2282 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 204/2486 variables, 71/863 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:12:56] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-05-28 19:12:56] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-28 19:12:56] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
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
[2024-05-28 19:12:56] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
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 69
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :69 after 186
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :186 after 650
At refinement iteration 6 (INCLUDED_ONLY) 0/2486 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :650 after 4.49302e+06
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :4.49302e+06 after 5.16104e+13
At refinement iteration 7 (INCLUDED_ONLY) 0/2486 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 18/2504 variables, 9/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :5.16104e+13 after 3.38012e+27
[2024-05-28 19:12:57] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 5 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :3.38012e+27 after 3.22762e+59
At refinement iteration 9 (INCLUDED_ONLY) 0/2504 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2504 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :3.22762e+59 after 2.84776e+139
At refinement iteration 11 (OVERLAPS) 2432/4936 variables, 2504/3381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4936 variables, 3/3384 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:12:59] [INFO ] Deduced a trap composed of 5 places in 428 ms of which 7 ms to minimize.
[2024-05-28 19:12:59] [INFO ] Deduced a trap composed of 6 places in 427 ms of which 7 ms to minimize.
[2024-05-28 19:13:00] [INFO ] Deduced a trap composed of 6 places in 491 ms of which 10 ms to minimize.
[2024-05-28 19:13:00] [INFO ] Deduced a trap composed of 8 places in 476 ms of which 8 ms to minimize.
[2024-05-28 19:13:01] [INFO ] Deduced a trap composed of 13 places in 479 ms of which 7 ms to minimize.
[2024-05-28 19:13:01] [INFO ] Deduced a trap composed of 5 places in 451 ms of which 7 ms to minimize.
[2024-05-28 19:13:02] [INFO ] Deduced a trap composed of 11 places in 458 ms of which 7 ms to minimize.
[2024-05-28 19:13:02] [INFO ] Deduced a trap composed of 15 places in 443 ms of which 8 ms to minimize.
[2024-05-28 19:13:03] [INFO ] Deduced a trap composed of 10 places in 457 ms of which 7 ms to minimize.
[2024-05-28 19:13:03] [INFO ] Deduced a trap composed of 7 places in 478 ms of which 7 ms to minimize.
[2024-05-28 19:13:04] [INFO ] Deduced a trap composed of 7 places in 457 ms of which 7 ms to minimize.
[2024-05-28 19:13:05] [INFO ] Deduced a trap composed of 9 places in 439 ms of which 7 ms to minimize.
[2024-05-28 19:13:05] [INFO ] Deduced a trap composed of 7 places in 417 ms of which 7 ms to minimize.
[2024-05-28 19:13:06] [INFO ] Deduced a trap composed of 12 places in 429 ms of which 7 ms to minimize.
[2024-05-28 19:13:06] [INFO ] Deduced a trap composed of 8 places in 421 ms of which 6 ms to minimize.
[2024-05-28 19:13:07] [INFO ] Deduced a trap composed of 7 places in 418 ms of which 6 ms to minimize.
[2024-05-28 19:13:07] [INFO ] Deduced a trap composed of 8 places in 468 ms of which 7 ms to minimize.
[2024-05-28 19:13:08] [INFO ] Deduced a trap composed of 9 places in 508 ms of which 8 ms to minimize.
[2024-05-28 19:13:08] [INFO ] Deduced a trap composed of 11 places in 449 ms of which 7 ms to minimize.
[2024-05-28 19:13:09] [INFO ] Deduced a trap composed of 14 places in 483 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4936 variables, 20/3404 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:13:10] [INFO ] Deduced a trap composed of 7 places in 333 ms of which 5 ms to minimize.
[2024-05-28 19:13:10] [INFO ] Deduced a trap composed of 8 places in 312 ms of which 17 ms to minimize.
[2024-05-28 19:13:11] [INFO ] Deduced a trap composed of 10 places in 316 ms of which 5 ms to minimize.
[2024-05-28 19:13:11] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 4 ms to minimize.
[2024-05-28 19:13:11] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:13:12] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 5 ms to minimize.
[2024-05-28 19:13:12] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 8 ms to minimize.
[2024-05-28 19:13:12] [INFO ] Deduced a trap composed of 12 places in 275 ms of which 5 ms to minimize.
[2024-05-28 19:13:13] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 5 ms to minimize.
[2024-05-28 19:13:13] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:13:14] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:13:14] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 5 ms to minimize.
[2024-05-28 19:13:14] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 5 ms to minimize.
[2024-05-28 19:13:15] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:13:15] [INFO ] Deduced a trap composed of 20 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:13:15] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:13:17] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/4936 variables, 20/3424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:13:17] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:13:18] [INFO ] Deduced a trap composed of 17 places in 303 ms of which 5 ms to minimize.
[2024-05-28 19:13:18] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 4 ms to minimize.
[2024-05-28 19:13:19] [INFO ] Deduced a trap composed of 17 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:13:19] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 4 ms to minimize.
[2024-05-28 19:13:19] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:13:20] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:13:20] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:13:20] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 4 ms to minimize.
[2024-05-28 19:13:21] [INFO ] Deduced a trap composed of 7 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:13:21] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:13:21] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 4 ms to minimize.
[2024-05-28 19:13:21] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 4 ms to minimize.
[2024-05-28 19:13:22] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 4 ms to minimize.
[2024-05-28 19:13:22] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 3 ms to minimize.
[2024-05-28 19:13:22] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-05-28 19:13:23] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:13:23] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:13:23] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:13:24] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/4936 variables, 20/3444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:13:24] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 3 ms to minimize.
[2024-05-28 19:13:24] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:13:25] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:13:25] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 4 ms to minimize.
[2024-05-28 19:13:25] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:13:26] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:13:26] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:13:26] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 5 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 3 ms to minimize.
[2024-05-28 19:13:27] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4936 variables, 11/3455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:13:28] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 3 ms to minimize.
[2024-05-28 19:13:28] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4936 variables, 3/3458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4936 variables, 0/3458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 113/5049 variables, 52/3510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5049 variables, 16/3526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5049 variables, 4/3530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5049 variables, 1/3531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:13:33] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 3 ms to minimize.
[2024-05-28 19:13:33] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:13:36] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:13:36] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:13:36] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
SMT process timed out in 50596ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 20979 ms.
Support contains 88 out of 2662 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2662/2662 places, 2562/2562 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2662 transition count 2558
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 2658 transition count 2558
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 8 place count 2658 transition count 2544
Deduced a syphon composed of 14 places in 10 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 36 place count 2644 transition count 2544
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 7 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 138 place count 2593 transition count 2493
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 2 with 25 rules applied. Total rules applied 163 place count 2593 transition count 2493
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 2590 transition count 2490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 167 place count 2589 transition count 2490
Applied a total of 167 rules in 490 ms. Remains 2589 /2662 variables (removed 73) and now considering 2490/2562 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 490 ms. Remains : 2589/2662 places, 2490/2562 transitions.
RANDOM walk for 40000 steps (8 resets) in 1207 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 650 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 625 ms. (63 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 644 ms. (62 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 98873 steps, run timeout after 3004 ms. (steps per millisecond=32 ) properties seen :0 out of 4
Probabilistic random walk after 98873 steps, saw 97470 distinct states, run finished after 3010 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 2490 rows 2589 cols
[2024-05-28 19:14:02] [INFO ] Computed 900 invariants in 65 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2143/2231 variables, 769/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2231 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 189/2420 variables, 68/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2420 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/2428 variables, 4/841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2428 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2359/4787 variables, 2428/3269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4787 variables, 0/3269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 112/4899 variables, 54/3323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4899 variables, 18/3341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4899 variables, 0/3341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/4900 variables, 2/3343 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4900 variables, 1/3344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4900 variables, 0/3344 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 95/4995 variables, 49/3393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4995 variables, 13/3406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4995 variables, 0/3406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 2/4997 variables, 2/3408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4997 variables, 2/3410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4997 variables, 0/3410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 4/5001 variables, 2/3412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5001 variables, 4/3416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5001 variables, 0/3416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/5003 variables, 1/3417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5003 variables, 2/3419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5003 variables, 0/3419 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/5004 variables, 1/3420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/5004 variables, 1/3421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/5004 variables, 0/3421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 47/5051 variables, 28/3449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/5051 variables, 11/3460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5051 variables, 0/3460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 1/5052 variables, 2/3462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/5052 variables, 1/3463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/5052 variables, 0/3463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 19/5071 variables, 12/3475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5071 variables, 3/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5071 variables, 0/3478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 1/5072 variables, 1/3479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5072 variables, 1/3480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/5072 variables, 0/3480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 2/5074 variables, 1/3481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/5074 variables, 2/3483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5074 variables, 0/3483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 5/5079 variables, 4/3487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/5079 variables, 2/3489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/5079 variables, 0/3489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 0/5079 variables, 0/3489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5079/5079 variables, and 3489 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6519 ms.
Refiners :[Positive P Invariants (semi-flows): 895/895 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 2589/2589 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2143/2231 variables, 769/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:09] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:14:09] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 2 ms to minimize.
[2024-05-28 19:14:09] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-05-28 19:14:09] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 3 ms to minimize.
[2024-05-28 19:14:10] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:14:10] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:14:10] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:14:10] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-05-28 19:14:10] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 3 ms to minimize.
[2024-05-28 19:14:11] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:14:11] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:14:11] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-05-28 19:14:11] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:14:11] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-05-28 19:14:11] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-28 19:14:11] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:14:12] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-28 19:14:12] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-05-28 19:14:12] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
[2024-05-28 19:14:12] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2231 variables, 20/789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:12] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-28 19:14:12] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-28 19:14:12] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-28 19:14:13] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-28 19:14:13] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-28 19:14:13] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2231 variables, 6/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2231 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 189/2420 variables, 68/863 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:13] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-28 19:14:13] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2024-05-28 19:14:14] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-28 19:14:14] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 2 ms to minimize.
[2024-05-28 19:14:14] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-05-28 19:14:14] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-28 19:14:14] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-28 19:14:14] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 19:14:14] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-28 19:14:14] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2420 variables, 10/873 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2420 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 8/2428 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:15] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2428 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2428 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2359/4787 variables, 2428/3306 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4787 variables, 3/3309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:16] [INFO ] Deduced a trap composed of 8 places in 424 ms of which 7 ms to minimize.
[2024-05-28 19:14:17] [INFO ] Deduced a trap composed of 9 places in 396 ms of which 6 ms to minimize.
[2024-05-28 19:14:17] [INFO ] Deduced a trap composed of 7 places in 432 ms of which 7 ms to minimize.
[2024-05-28 19:14:18] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 6 ms to minimize.
[2024-05-28 19:14:18] [INFO ] Deduced a trap composed of 8 places in 406 ms of which 7 ms to minimize.
[2024-05-28 19:14:19] [INFO ] Deduced a trap composed of 12 places in 394 ms of which 6 ms to minimize.
[2024-05-28 19:14:19] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 6 ms to minimize.
[2024-05-28 19:14:20] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 6 ms to minimize.
[2024-05-28 19:14:20] [INFO ] Deduced a trap composed of 9 places in 371 ms of which 6 ms to minimize.
[2024-05-28 19:14:21] [INFO ] Deduced a trap composed of 9 places in 375 ms of which 6 ms to minimize.
[2024-05-28 19:14:21] [INFO ] Deduced a trap composed of 10 places in 387 ms of which 6 ms to minimize.
[2024-05-28 19:14:22] [INFO ] Deduced a trap composed of 7 places in 401 ms of which 6 ms to minimize.
[2024-05-28 19:14:22] [INFO ] Deduced a trap composed of 9 places in 382 ms of which 6 ms to minimize.
[2024-05-28 19:14:23] [INFO ] Deduced a trap composed of 7 places in 410 ms of which 6 ms to minimize.
[2024-05-28 19:14:23] [INFO ] Deduced a trap composed of 14 places in 363 ms of which 5 ms to minimize.
[2024-05-28 19:14:24] [INFO ] Deduced a trap composed of 9 places in 368 ms of which 6 ms to minimize.
[2024-05-28 19:14:24] [INFO ] Deduced a trap composed of 18 places in 391 ms of which 6 ms to minimize.
[2024-05-28 19:14:25] [INFO ] Deduced a trap composed of 14 places in 405 ms of which 6 ms to minimize.
[2024-05-28 19:14:25] [INFO ] Deduced a trap composed of 10 places in 370 ms of which 6 ms to minimize.
[2024-05-28 19:14:25] [INFO ] Deduced a trap composed of 11 places in 358 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4787 variables, 20/3329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:26] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:14:27] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:14:27] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:14:27] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:14:28] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 5 ms to minimize.
[2024-05-28 19:14:28] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 5 ms to minimize.
[2024-05-28 19:14:29] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 4 ms to minimize.
[2024-05-28 19:14:29] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:14:29] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:14:30] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 4 ms to minimize.
[2024-05-28 19:14:30] [INFO ] Deduced a trap composed of 14 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:14:30] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:14:31] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 4 ms to minimize.
[2024-05-28 19:14:31] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:14:31] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:14:32] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 4 ms to minimize.
[2024-05-28 19:14:32] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:14:32] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 3 ms to minimize.
[2024-05-28 19:14:33] [INFO ] Deduced a trap composed of 20 places in 231 ms of which 3 ms to minimize.
[2024-05-28 19:14:33] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/4787 variables, 20/3349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:34] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:14:34] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:14:34] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:14:35] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:14:35] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:14:35] [INFO ] Deduced a trap composed of 14 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:14:36] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:14:36] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:14:36] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:14:37] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:14:37] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 4 ms to minimize.
[2024-05-28 19:14:37] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 3 ms to minimize.
[2024-05-28 19:14:37] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:14:38] [INFO ] Deduced a trap composed of 21 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:14:38] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 3 ms to minimize.
[2024-05-28 19:14:38] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:14:39] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:14:39] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:14:39] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:14:39] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/4787 variables, 20/3369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:40] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:14:40] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 4 ms to minimize.
[2024-05-28 19:14:41] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 3 ms to minimize.
[2024-05-28 19:14:41] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 3 ms to minimize.
[2024-05-28 19:14:41] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 4 ms to minimize.
[2024-05-28 19:14:41] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 4 ms to minimize.
[2024-05-28 19:14:42] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 4 ms to minimize.
[2024-05-28 19:14:42] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 3 ms to minimize.
[2024-05-28 19:14:42] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4787 variables, 9/3378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:43] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 4 ms to minimize.
[2024-05-28 19:14:44] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4787 variables, 2/3380 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:45] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 4 ms to minimize.
[2024-05-28 19:14:45] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:14:46] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 4 ms to minimize.
[2024-05-28 19:14:46] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 4 ms to minimize.
[2024-05-28 19:14:46] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 4 ms to minimize.
[2024-05-28 19:14:46] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 4 ms to minimize.
[2024-05-28 19:14:47] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:14:47] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:14:47] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 5 ms to minimize.
[2024-05-28 19:14:47] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:14:48] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4787 variables, 11/3391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:49] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4787 variables, 1/3392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:50] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4787 variables, 1/3393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4787 variables, 0/3393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 112/4899 variables, 54/3447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4899 variables, 18/3465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4899 variables, 1/3466 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:14:53] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:14:53] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:14:54] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 4 ms to minimize.
[2024-05-28 19:14:54] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 3 ms to minimize.
[2024-05-28 19:14:54] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 3 ms to minimize.
[2024-05-28 19:14:54] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 3 ms to minimize.
[2024-05-28 19:14:55] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 4 ms to minimize.
[2024-05-28 19:14:55] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:14:55] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 5 ms to minimize.
[2024-05-28 19:14:56] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 3 ms to minimize.
[2024-05-28 19:14:56] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-28 19:14:56] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 3 ms to minimize.
[2024-05-28 19:14:57] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:14:57] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 3 ms to minimize.
[2024-05-28 19:14:57] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 4 ms to minimize.
[2024-05-28 19:14:58] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 5 ms to minimize.
[2024-05-28 19:14:58] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:14:58] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 3 ms to minimize.
[2024-05-28 19:14:59] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:14:59] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/4899 variables, 20/3486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:15:00] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 4 ms to minimize.
[2024-05-28 19:15:01] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 3 ms to minimize.
[2024-05-28 19:15:02] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 3 ms to minimize.
[2024-05-28 19:15:02] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 3 ms to minimize.
[2024-05-28 19:15:02] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:15:02] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:15:03] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:15:03] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 4 ms to minimize.
[2024-05-28 19:15:03] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:15:04] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 3 ms to minimize.
[2024-05-28 19:15:04] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:15:04] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:15:04] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 3 ms to minimize.
[2024-05-28 19:15:05] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
[2024-05-28 19:15:05] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-28 19:15:05] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-05-28 19:15:05] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2024-05-28 19:15:06] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/4899 variables, 18/3504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4899 variables, 0/3504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/4900 variables, 2/3506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4900 variables, 1/3507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4900 variables, 0/3507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 95/4995 variables, 49/3556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4995 variables, 13/3569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4995 variables, 0/3569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 2/4997 variables, 2/3571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4997 variables, 2/3573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4997 variables, 0/3573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 4/5001 variables, 2/3575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5001 variables, 4/3579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/5001 variables, 0/3579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 2/5003 variables, 1/3580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/5003 variables, 2/3582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/5003 variables, 0/3582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 1/5004 variables, 1/3583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5004 variables, 1/3584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/5004 variables, 0/3584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 47/5051 variables, 28/3612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/5051 variables, 11/3623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/5051 variables, 0/3623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 1/5052 variables, 2/3625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/5052 variables, 1/3626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/5052 variables, 0/3626 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 19/5071 variables, 12/3638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/5071 variables, 3/3641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/5071 variables, 0/3641 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 1/5072 variables, 1/3642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/5072 variables, 1/3643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/5072 variables, 0/3643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 2/5074 variables, 1/3644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/5074 variables, 2/3646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/5074 variables, 0/3646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 5/5079 variables, 4/3650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/5079 variables, 2/3652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:15:20] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:15:20] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/5079 variables, 2/3654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/5079 variables, 0/3654 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 19:15:22] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2024-05-28 19:15:22] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 3 ms to minimize.
At refinement iteration 65 (OVERLAPS) 0/5079 variables, 2/3656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/5079 variables, 0/3656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5079/5079 variables, and 3656 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75017 ms.
Refiners :[Positive P Invariants (semi-flows): 895/895 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 2589/2589 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 163/163 constraints]
After SMT, in 81654ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 88 out of 2589 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2589/2589 places, 2490/2490 transitions.
Applied a total of 0 rules in 138 ms. Remains 2589 /2589 variables (removed 0) and now considering 2490/2490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 2589/2589 places, 2490/2490 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2589/2589 places, 2490/2490 transitions.
Applied a total of 0 rules in 158 ms. Remains 2589 /2589 variables (removed 0) and now considering 2490/2490 (removed 0) transitions.
[2024-05-28 19:15:24] [INFO ] Invariant cache hit.
[2024-05-28 19:15:25] [INFO ] Implicit Places using invariants in 1556 ms returned []
[2024-05-28 19:15:25] [INFO ] Invariant cache hit.
[2024-05-28 19:15:29] [INFO ] Implicit Places using invariants and state equation in 3458 ms returned []
Implicit Place search using SMT with State Equation took 5028 ms to find 0 implicit places.
[2024-05-28 19:15:29] [INFO ] Redundant transitions in 155 ms returned []
Running 2482 sub problems to find dead transitions.
[2024-05-28 19:15:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2582 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2482 unsolved
SMT process timed out in 31614ms, After SMT, problems are : Problem set: 0 solved, 2482 unsolved
Search for dead transitions found 0 dead transitions in 31646ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37005 ms. Remains : 2589/2589 places, 2490/2490 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 19:16:01] [INFO ] Flatten gal took : 207 ms
[2024-05-28 19:16:01] [INFO ] Applying decomposition
[2024-05-28 19:16:01] [INFO ] Flatten gal took : 194 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/graph16206261423115914469.txt' '-o' '/tmp/graph16206261423115914469.bin' '-w' '/tmp/graph16206261423115914469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16206261423115914469.bin' '-l' '-1' '-v' '-w' '/tmp/graph16206261423115914469.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:16:02] [INFO ] Decomposing Gal with order
[2024-05-28 19:16:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:16:04] [INFO ] Removed a total of 2300 redundant transitions.
[2024-05-28 19:16:04] [INFO ] Flatten gal took : 451 ms
[2024-05-28 19:16:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2024-05-28 19:16:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11748929745639172629.gal : 72 ms
[2024-05-28 19:16:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5231365090900945593.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/ReachabilityCardinality11748929745639172629.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5231365090900945593.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/ReachabilityCardinality5231365090900945593.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 320924
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :320924 after 1.66448e+10
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.66448e+10 after 7.45346e+11
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5.02735e+16 after 6.9871e+65
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :6.9871e+65 after 3.64522e+280
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :5.93748e+282 after 5.93748e+282
ITS-tools command line returned an error code 137
[2024-05-28 19:31:59] [INFO ] Flatten gal took : 141 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18392248380836125074
[2024-05-28 19:31:59] [INFO ] Too many transitions (2490) to apply POR reductions. Disabling POR matrices.
[2024-05-28 19:31:59] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18392248380836125074
[2024-05-28 19:31:59] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin18392248380836125074;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 19:31:59] [INFO ] Flatten gal took : 162 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/graph12277511806796205084.txt' '-o' '/tmp/graph12277511806796205084.bin' '-w' '/tmp/graph12277511806796205084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12277511806796205084.bin' '-l' '-1' '-v' '-w' '/tmp/graph12277511806796205084.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:32:00] [INFO ] Decomposing Gal with order
[2024-05-28 19:32:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:32:00] [INFO ] Removed a total of 1958 redundant transitions.
[2024-05-28 19:32:00] [INFO ] Flatten gal took : 204 ms
[2024-05-28 19:32:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2490 labels/synchronizations in 402 ms.
[2024-05-28 19:32:01] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13714900288792040666.gal : 34 ms
[2024-05-28 19:32:01] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13989369953323640251.prop : 2 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/ReachabilityFireability13714900288792040666.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13989369953323640251.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/ReachabilityFireability13989369953323640251.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 30
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :30 after 42
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :42 after 942
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :942 after 2670
Compilation finished in 8543 ms.
Running link step : cd /tmp/ltsmin18392248380836125074;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin18392248380836125074;'/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' 'ShieldIIPsPT100BReachabilityFireability202400==true'
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2670 after 2670
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin18392248380836125074;'/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' 'ShieldIIPsPT100BReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin18392248380836125074;'/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' 'ShieldIIPsPT100BReachabilityFireability202404==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin18392248380836125074;'/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' 'ShieldIIPsPT100BReachabilityFireability202404==true'
Running LTSmin : cd /tmp/ltsmin18392248380836125074;'/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' 'ShieldIIPsPT100BReachabilityFireability202408==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin18392248380836125074;'/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' 'ShieldIIPsPT100BReachabilityFireability202408==true'
Running LTSmin : cd /tmp/ltsmin18392248380836125074;'/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' 'ShieldIIPsPT100BReachabilityFireability202411==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin18392248380836125074;'/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' 'ShieldIIPsPT100BReachabilityFireability202411==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin18392248380836125074;'/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' 'ShieldIIPsPT100BReachabilityFireability202400==true'
Detected timeout of ITS tools.
[2024-05-28 19:58:32] [INFO ] Applying decomposition
[2024-05-28 19:58:32] [INFO ] Flatten gal took : 348 ms
[2024-05-28 19:58:32] [INFO ] Decomposing Gal with order
[2024-05-28 19:58:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:58:34] [INFO ] Removed a total of 2279 redundant transitions.
[2024-05-28 19:58:34] [INFO ] Flatten gal took : 387 ms
[2024-05-28 19:58:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4926 labels/synchronizations in 3350 ms.
[2024-05-28 19:58:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8952913914271702551.gal : 261 ms
[2024-05-28 19:58:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12700840797370899972.prop : 2 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/ReachabilityFireability8952913914271702551.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12700840797370899972.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/ReachabilityFireability12700840797370899972.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :9 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 11523

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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