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

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPs-PT-100B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716923526107

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
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
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 19:12:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 19:12:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:12:07] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2024-05-28 19:12:07] [INFO ] Transformed 6003 places.
[2024-05-28 19:12:07] [INFO ] Transformed 5903 transitions.
[2024-05-28 19:12:07] [INFO ] Found NUPN structural information;
[2024-05-28 19:12:08] [INFO ] Parsed PT model containing 6003 places and 5903 transitions and 17806 arcs in 794 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2540 ms. (15 steps per ms) remains 10/14 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
[2024-05-28 19:12:09] [INFO ] Flatten gal took : 758 ms
BEST_FIRST walk for 40003 steps (8 resets) in 729 ms. (54 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
[2024-05-28 19:12:09] [INFO ] Flatten gal took : 358 ms
// Phase 1: matrix 5903 rows 6003 cols
[2024-05-28 19:12:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13879920980537205684.gal : 124 ms
[2024-05-28 19:12:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17850528942701510683.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/ReachabilityCardinality13879920980537205684.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17850528942701510683.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2024-05-28 19:12:10] [INFO ] Computed 901 invariants in 87 ms

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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality17850528942701510683.prop.
At refinement iteration 2 (OVERLAPS) 2396/2585 variables, 319/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2585 variables, 2396/2904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2585 variables, 0/2904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 3418/6003 variables, 582/3486 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6003 variables, 3418/6904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6003 variables, 0/6904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 5903/11906 variables, 6003/12907 constraints. Problems are: Problem set: 0 solved, 10 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, 10 unsolved in 5055 ms.
Refiners :[Domain max(s): 6003/6003 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 6003/6003 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 189/189 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2396/2585 variables, 319/508 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2585 variables, 2396/2904 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-28 19:12:16] [INFO ] Deduced a trap composed of 23 places in 565 ms of which 69 ms to minimize.
[2024-05-28 19:12:17] [INFO ] Deduced a trap composed of 39 places in 486 ms of which 9 ms to minimize.
[2024-05-28 19:12:17] [INFO ] Deduced a trap composed of 20 places in 477 ms of which 7 ms to minimize.
[2024-05-28 19:12:18] [INFO ] Deduced a trap composed of 32 places in 492 ms of which 8 ms to minimize.
[2024-05-28 19:12:18] [INFO ] Deduced a trap composed of 30 places in 435 ms of which 7 ms to minimize.
[2024-05-28 19:12:19] [INFO ] Deduced a trap composed of 33 places in 421 ms of which 7 ms to minimize.
[2024-05-28 19:12:19] [INFO ] Deduced a trap composed of 15 places in 438 ms of which 8 ms to minimize.
[2024-05-28 19:12:20] [INFO ] Deduced a trap composed of 23 places in 431 ms of which 7 ms to minimize.
[2024-05-28 19:12:20] [INFO ] Deduced a trap composed of 22 places in 415 ms of which 7 ms to minimize.
SMT process timed out in 10586ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 189 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 436 transitions
Trivial Post-agglo rules discarded 436 transitions
Performed 436 trivial Post agglomeration. Transition count delta: 436
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 6003 transition count 5467
Reduce places removed 436 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 468 rules applied. Total rules applied 904 place count 5567 transition count 5435
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 936 place count 5535 transition count 5435
Performed 494 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 494 Pre rules applied. Total rules applied 936 place count 5535 transition count 4941
Deduced a syphon composed of 494 places in 24 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 3 with 988 rules applied. Total rules applied 1924 place count 5041 transition count 4941
Discarding 647 places :
Symmetric choice reduction at 3 with 647 rule applications. Total rules 2571 place count 4394 transition count 4294
Iterating global reduction 3 with 647 rules applied. Total rules applied 3218 place count 4394 transition count 4294
Performed 247 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 247 Pre rules applied. Total rules applied 3218 place count 4394 transition count 4047
Deduced a syphon composed of 247 places in 21 ms
Reduce places removed 247 places and 0 transitions.
Iterating global reduction 3 with 494 rules applied. Total rules applied 3712 place count 4147 transition count 4047
Performed 1428 Post agglomeration using F-continuation condition.Transition count delta: 1428
Deduced a syphon composed of 1428 places in 14 ms
Reduce places removed 1428 places and 0 transitions.
Iterating global reduction 3 with 2856 rules applied. Total rules applied 6568 place count 2719 transition count 2619
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 653 times.
Drop transitions (Partial Free agglomeration) removed 653 transitions
Iterating global reduction 3 with 653 rules applied. Total rules applied 7221 place count 2719 transition count 2619
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7222 place count 2718 transition count 2618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7223 place count 2717 transition count 2618
Applied a total of 7223 rules in 2517 ms. Remains 2717 /6003 variables (removed 3286) and now considering 2618/5903 (removed 3285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2527 ms. Remains : 2717/6003 places, 2618/5903 transitions.
RANDOM walk for 40000 steps (8 resets) in 1501 ms. (26 steps per ms) remains 6/10 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 526 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 5/6 properties
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 529 ms. (75 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 463 ms. (86 steps per ms) remains 5/5 properties
// Phase 1: matrix 2618 rows 2717 cols
[2024-05-28 19:12:24] [INFO ] Computed 900 invariants in 69 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 702/830 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/830 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1700/2530 variables, 610/829 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2530 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/2556 variables, 13/842 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2556 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2499/5055 variables, 2556/3398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5055 variables, 0/3398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 105/5160 variables, 56/3454 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5160 variables, 19/3473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5160 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/5162 variables, 1/3474 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5162 variables, 0/3474 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 2/5164 variables, 1/3475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5164 variables, 0/3475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 93/5257 variables, 56/3531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/5257 variables, 14/3545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5257 variables, 0/3545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 3/5260 variables, 4/3549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5260 variables, 3/3552 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5260 variables, 0/3552 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 4/5264 variables, 2/3554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5264 variables, 4/3558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5264 variables, 0/3558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 31/5295 variables, 18/3576 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5295 variables, 6/3582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/5295 variables, 0/3582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 2/5297 variables, 3/3585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/5297 variables, 2/3587 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/5297 variables, 0/3587 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (OVERLAPS) 26/5323 variables, 13/3600 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5323 variables, 4/3604 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/5323 variables, 0/3604 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (OVERLAPS) 9/5332 variables, 6/3610 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/5332 variables, 1/3611 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/5332 variables, 1/3612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5332 variables, 0/3612 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (OVERLAPS) 1/5333 variables, 1/3613 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/5333 variables, 1/3614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5333 variables, 0/3614 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (OVERLAPS) 2/5335 variables, 2/3616 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/5335 variables, 1/3617 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/5335 variables, 0/3617 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (OVERLAPS) 0/5335 variables, 0/3617 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5335/5335 variables, and 3617 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7851 ms.
Refiners :[Positive P Invariants (semi-flows): 886/886 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2717/2717 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 702/830 variables, 219/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:32] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-28 19:12:32] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-28 19:12:32] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-28 19:12:32] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-28 19:12:33] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-28 19:12:33] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-05-28 19:12:33] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 4 ms to minimize.
[2024-05-28 19:12:33] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-28 19:12:33] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-28 19:12:33] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-28 19:12:33] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/830 variables, 11/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:33] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-28 19:12:34] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/830 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:34] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-28 19:12:34] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/830 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1700/2530 variables, 610/844 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:35] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 7 ms to minimize.
[2024-05-28 19:12:35] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:12:35] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 3 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :36 after 69
Invariant property ShieldIIPs-PT-100B-ReachabilityCardinality-2024-13 does not hold.
[2024-05-28 19:12:35] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 4 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :69 after 186
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :186 after 578
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :578 after 38655
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :38655 after 1.50834e+08
[2024-05-28 19:12:36] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 3 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :1.50834e+08 after 5.81902e+13
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :5.81902e+13 after 1.21008e+30
[2024-05-28 19:12:36] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 3 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :1.21008e+30 after 3.318e+60
[2024-05-28 19:12:36] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 3 ms to minimize.
Reachability property ShieldIIPs-PT-100B-ReachabilityCardinality-2024-09 is true.
[2024-05-28 19:12:36] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 4 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :3.318e+60 after 1.35816e+140
[2024-05-28 19:12:36] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 4 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.35816e+140 after 1.21732e+238
[2024-05-28 19:12:37] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 8 ms to minimize.
[2024-05-28 19:12:37] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 3 ms to minimize.
[2024-05-28 19:12:37] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 3 ms to minimize.
[2024-05-28 19:12:37] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 4 ms to minimize.
[2024-05-28 19:12:38] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:12:38] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 3 ms to minimize.
[2024-05-28 19:12:38] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 4 ms to minimize.
[2024-05-28 19:12:38] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-28 19:12:38] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:12:39] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 8 ms to minimize.
[2024-05-28 19:12:39] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2530 variables, 20/864 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:39] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:12:39] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:12:39] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:12:40] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-05-28 19:12:40] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-28 19:12:40] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:12:40] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 4 ms to minimize.
[2024-05-28 19:12:40] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 3 ms to minimize.
[2024-05-28 19:12:41] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 3 ms to minimize.
[2024-05-28 19:12:41] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 3 ms to minimize.
[2024-05-28 19:12:41] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:12:41] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 11 ms to minimize.
[2024-05-28 19:12:41] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-05-28 19:12:42] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:12:42] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:12:42] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 2 ms to minimize.
[2024-05-28 19:12:42] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:12:42] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 3 ms to minimize.
[2024-05-28 19:12:43] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 2 ms to minimize.
[2024-05-28 19:12:43] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2530 variables, 20/884 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:43] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
[2024-05-28 19:12:43] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:12:43] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:12:43] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
[2024-05-28 19:12:44] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 3 ms to minimize.
[2024-05-28 19:12:44] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-05-28 19:12:44] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 2 ms to minimize.
[2024-05-28 19:12:44] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 3 ms to minimize.
[2024-05-28 19:12:44] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2024-05-28 19:12:45] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-05-28 19:12:45] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 3 ms to minimize.
[2024-05-28 19:12:45] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 3 ms to minimize.
[2024-05-28 19:12:45] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2530 variables, 13/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:45] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2530 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:46] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:12:46] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 2 ms to minimize.
[2024-05-28 19:12:46] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:12:46] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 3 ms to minimize.
[2024-05-28 19:12:47] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:12:47] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-05-28 19:12:47] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:12:47] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2530 variables, 8/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:48] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2530 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2530 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 26/2556 variables, 13/920 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:48] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 2 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:12:49] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:12:50] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2556 variables, 7/927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2556 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2499/5055 variables, 2556/3483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5055 variables, 2/3485 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:12:52] [INFO ] Deduced a trap composed of 7 places in 550 ms of which 8 ms to minimize.
[2024-05-28 19:12:52] [INFO ] Deduced a trap composed of 8 places in 462 ms of which 7 ms to minimize.
[2024-05-28 19:12:53] [INFO ] Deduced a trap composed of 9 places in 470 ms of which 9 ms to minimize.
[2024-05-28 19:12:54] [INFO ] Deduced a trap composed of 14 places in 460 ms of which 6 ms to minimize.
[2024-05-28 19:12:54] [INFO ] Deduced a trap composed of 10 places in 434 ms of which 6 ms to minimize.
[2024-05-28 19:12:55] [INFO ] Deduced a trap composed of 9 places in 416 ms of which 6 ms to minimize.
[2024-05-28 19:12:55] [INFO ] Deduced a trap composed of 10 places in 437 ms of which 6 ms to minimize.
[2024-05-28 19:12:56] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 6 ms to minimize.
[2024-05-28 19:12:56] [INFO ] Deduced a trap composed of 10 places in 368 ms of which 6 ms to minimize.
[2024-05-28 19:12:57] [INFO ] Deduced a trap composed of 13 places in 374 ms of which 6 ms to minimize.
[2024-05-28 19:12:57] [INFO ] Deduced a trap composed of 11 places in 347 ms of which 5 ms to minimize.
[2024-05-28 19:12:57] [INFO ] Deduced a trap composed of 9 places in 365 ms of which 6 ms to minimize.
[2024-05-28 19:12:58] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 5 ms to minimize.
[2024-05-28 19:12:58] [INFO ] Deduced a trap composed of 12 places in 360 ms of which 6 ms to minimize.
[2024-05-28 19:12:59] [INFO ] Deduced a trap composed of 8 places in 345 ms of which 6 ms to minimize.
[2024-05-28 19:12:59] [INFO ] Deduced a trap composed of 14 places in 333 ms of which 6 ms to minimize.
[2024-05-28 19:13:00] [INFO ] Deduced a trap composed of 11 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:13:00] [INFO ] Deduced a trap composed of 12 places in 338 ms of which 5 ms to minimize.
[2024-05-28 19:13:00] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 6 ms to minimize.
[2024-05-28 19:13:01] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/5055 variables, 20/3505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:13:02] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 6 ms to minimize.
[2024-05-28 19:13:02] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 6 ms to minimize.
[2024-05-28 19:13:03] [INFO ] Deduced a trap composed of 10 places in 369 ms of which 6 ms to minimize.
[2024-05-28 19:13:03] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 5 ms to minimize.
[2024-05-28 19:13:04] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:13:04] [INFO ] Deduced a trap composed of 12 places in 356 ms of which 5 ms to minimize.
[2024-05-28 19:13:04] [INFO ] Deduced a trap composed of 16 places in 300 ms of which 4 ms to minimize.
[2024-05-28 19:13:05] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:13:05] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 5 ms to minimize.
[2024-05-28 19:13:06] [INFO ] Deduced a trap composed of 18 places in 287 ms of which 4 ms to minimize.
[2024-05-28 19:13:06] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 4 ms to minimize.
[2024-05-28 19:13:06] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 5 ms to minimize.
[2024-05-28 19:13:07] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 5 ms to minimize.
[2024-05-28 19:13:07] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 5 ms to minimize.
[2024-05-28 19:13:07] [INFO ] Deduced a trap composed of 13 places in 284 ms of which 5 ms to minimize.
[2024-05-28 19:13:08] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 5 ms to minimize.
[2024-05-28 19:13:08] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:13:09] [INFO ] Deduced a trap composed of 14 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:13:09] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 4 ms to minimize.
[2024-05-28 19:13:09] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/5055 variables, 20/3525 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:13:10] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 5 ms to minimize.
[2024-05-28 19:13:11] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 5 ms to minimize.
[2024-05-28 19:13:11] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 5 ms to minimize.
[2024-05-28 19:13:11] [INFO ] Deduced a trap composed of 12 places in 279 ms of which 5 ms to minimize.
[2024-05-28 19:13:12] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 4 ms to minimize.
[2024-05-28 19:13:12] [INFO ] Deduced a trap composed of 11 places in 287 ms of which 4 ms to minimize.
[2024-05-28 19:13:12] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 5 ms to minimize.
[2024-05-28 19:13:13] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 6 ms to minimize.
[2024-05-28 19:13:13] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 4 ms to minimize.
[2024-05-28 19:13:13] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:13:14] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:13:14] [INFO ] Deduced a trap composed of 16 places in 252 ms of which 5 ms to minimize.
[2024-05-28 19:13:14] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 4 ms to minimize.
[2024-05-28 19:13:15] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:13:15] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:13:15] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:13:16] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 4 ms to minimize.
[2024-05-28 19:13:17] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/5055 variables, 20/3545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5055/5335 variables, and 3545 constraints, problems are : Problem set: 0 solved, 5 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 829/886 constraints, Generalized P Invariants (flows): 13/14 constraints, State Equation: 2556/2717 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 145/145 constraints]
After SMT, in 53035ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 128 out of 2717 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2717/2717 places, 2618/2618 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 2717 transition count 2609
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 2708 transition count 2609
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 2708 transition count 2604
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 2703 transition count 2604
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 7 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 110 place count 2662 transition count 2563
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 128 place count 2662 transition count 2563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 2661 transition count 2562
Applied a total of 129 rules in 397 ms. Remains 2661 /2717 variables (removed 56) and now considering 2562/2618 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 2661/2717 places, 2562/2618 transitions.
RANDOM walk for 40000 steps (8 resets) in 1567 ms. (25 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 687 ms. (58 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 702 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 842 ms. (47 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 767 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 677 ms. (59 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 88428 steps, run timeout after 3002 ms. (steps per millisecond=29 ) properties seen :0 out of 5
Probabilistic random walk after 88428 steps, saw 86487 distinct states, run finished after 3008 ms. (steps per millisecond=29 ) properties seen :0
// Phase 1: matrix 2562 rows 2661 cols
[2024-05-28 19:13:22] [INFO ] Computed 900 invariants in 67 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 680/808 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/808 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1676/2484 variables, 615/833 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2484 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 16/2500 variables, 8/841 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2500 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2441/4941 variables, 2500/3341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4941 variables, 0/3341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 109/5050 variables, 56/3397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5050 variables, 19/3416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5050 variables, 0/3416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/5051 variables, 1/3417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5051 variables, 1/3418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/5051 variables, 0/3418 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/5053 variables, 1/3419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/5053 variables, 0/3419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 94/5147 variables, 56/3475 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/5147 variables, 15/3490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/5147 variables, 0/3490 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 3/5150 variables, 4/3494 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5150 variables, 3/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5150 variables, 0/3497 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 4/5154 variables, 2/3499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5154 variables, 4/3503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/5154 variables, 0/3503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 30/5184 variables, 18/3521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/5184 variables, 7/3528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/5184 variables, 0/3528 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 1/5185 variables, 2/3530 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/5185 variables, 1/3531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/5185 variables, 0/3531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 26/5211 variables, 13/3544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/5211 variables, 4/3548 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/5211 variables, 0/3548 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 35 (OVERLAPS) 9/5220 variables, 6/3554 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/5220 variables, 1/3555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5220 variables, 1/3556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5220 variables, 0/3556 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 1/5221 variables, 1/3557 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5221 variables, 1/3558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/5221 variables, 0/3558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 2/5223 variables, 2/3560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/5223 variables, 1/3561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5223 variables, 0/3561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 45 (OVERLAPS) 0/5223 variables, 0/3561 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5223/5223 variables, and 3561 constraints, problems are : Problem set: 0 solved, 5 unsolved in 6992 ms.
Refiners :[Positive P Invariants (semi-flows): 891/891 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 2661/2661 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 680/808 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
[2024-05-28 19:13:29] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2024-05-28 19:13:30] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:13:31] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/808 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/808 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1676/2484 variables, 615/845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:13:31] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 2 ms to minimize.
[2024-05-28 19:13:31] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 3 ms to minimize.
[2024-05-28 19:13:32] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:13:32] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 3 ms to minimize.
[2024-05-28 19:13:32] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:13:32] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-05-28 19:13:32] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-05-28 19:13:33] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 5 ms to minimize.
[2024-05-28 19:13:33] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 3 ms to minimize.
[2024-05-28 19:13:33] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 3 ms to minimize.
[2024-05-28 19:13:33] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-05-28 19:13:33] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 2 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 3 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 11 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 2 ms to minimize.
[2024-05-28 19:13:34] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 3 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 2 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2484 variables, 20/865 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:13:35] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 2 ms to minimize.
[2024-05-28 19:13:36] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 2 ms to minimize.
[2024-05-28 19:13:36] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 2 ms to minimize.
[2024-05-28 19:13:36] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:13:36] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-05-28 19:13:36] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:13:37] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 2 ms to minimize.
[2024-05-28 19:13:37] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:13:37] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-05-28 19:13:37] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 2 ms to minimize.
[2024-05-28 19:13:37] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-28 19:13:37] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 2 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 3 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-28 19:13:38] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 2 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2484 variables, 20/885 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2024-05-28 19:13:39] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:13:40] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-05-28 19:13:40] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 2 ms to minimize.
[2024-05-28 19:13:40] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:13:40] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 2 ms to minimize.
[2024-05-28 19:13:40] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 2 ms to minimize.
[2024-05-28 19:13:40] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:13:41] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 2 ms to minimize.
[2024-05-28 19:13:41] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2484 variables, 12/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2484 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 16/2500 variables, 8/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:13:41] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 3 ms to minimize.
[2024-05-28 19:13:42] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-05-28 19:13:42] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-05-28 19:13:42] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2500 variables, 4/909 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:13:42] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2500 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2500 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2441/4941 variables, 2500/3410 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4941 variables, 2/3412 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:13:44] [INFO ] Deduced a trap composed of 7 places in 560 ms of which 7 ms to minimize.
[2024-05-28 19:13:45] [INFO ] Deduced a trap composed of 7 places in 537 ms of which 7 ms to minimize.
[2024-05-28 19:13:46] [INFO ] Deduced a trap composed of 6 places in 520 ms of which 7 ms to minimize.
[2024-05-28 19:13:46] [INFO ] Deduced a trap composed of 12 places in 498 ms of which 6 ms to minimize.
[2024-05-28 19:13:47] [INFO ] Deduced a trap composed of 9 places in 501 ms of which 7 ms to minimize.
[2024-05-28 19:13:47] [INFO ] Deduced a trap composed of 8 places in 504 ms of which 8 ms to minimize.
[2024-05-28 19:13:48] [INFO ] Deduced a trap composed of 8 places in 568 ms of which 7 ms to minimize.
[2024-05-28 19:13:49] [INFO ] Deduced a trap composed of 7 places in 538 ms of which 7 ms to minimize.
[2024-05-28 19:13:49] [INFO ] Deduced a trap composed of 6 places in 520 ms of which 8 ms to minimize.
[2024-05-28 19:13:50] [INFO ] Deduced a trap composed of 5 places in 549 ms of which 8 ms to minimize.
[2024-05-28 19:13:51] [INFO ] Deduced a trap composed of 11 places in 540 ms of which 8 ms to minimize.
[2024-05-28 19:13:51] [INFO ] Deduced a trap composed of 13 places in 525 ms of which 7 ms to minimize.
[2024-05-28 19:13:52] [INFO ] Deduced a trap composed of 12 places in 526 ms of which 7 ms to minimize.
[2024-05-28 19:13:52] [INFO ] Deduced a trap composed of 10 places in 528 ms of which 7 ms to minimize.
[2024-05-28 19:13:53] [INFO ] Deduced a trap composed of 11 places in 521 ms of which 7 ms to minimize.
[2024-05-28 19:13:54] [INFO ] Deduced a trap composed of 10 places in 550 ms of which 8 ms to minimize.
[2024-05-28 19:13:54] [INFO ] Deduced a trap composed of 9 places in 548 ms of which 7 ms to minimize.
[2024-05-28 19:13:55] [INFO ] Deduced a trap composed of 11 places in 551 ms of which 8 ms to minimize.
[2024-05-28 19:13:56] [INFO ] Deduced a trap composed of 7 places in 515 ms of which 8 ms to minimize.
[2024-05-28 19:13:56] [INFO ] Deduced a trap composed of 11 places in 516 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/4941 variables, 20/3432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:13:57] [INFO ] Deduced a trap composed of 7 places in 375 ms of which 5 ms to minimize.
[2024-05-28 19:13:58] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 6 ms to minimize.
[2024-05-28 19:13:58] [INFO ] Deduced a trap composed of 6 places in 359 ms of which 5 ms to minimize.
[2024-05-28 19:13:59] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 5 ms to minimize.
[2024-05-28 19:13:59] [INFO ] Deduced a trap composed of 14 places in 361 ms of which 6 ms to minimize.
[2024-05-28 19:13:59] [INFO ] Deduced a trap composed of 11 places in 356 ms of which 7 ms to minimize.
[2024-05-28 19:14:00] [INFO ] Deduced a trap composed of 11 places in 361 ms of which 5 ms to minimize.
[2024-05-28 19:14:00] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 6 ms to minimize.
[2024-05-28 19:14:01] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 6 ms to minimize.
[2024-05-28 19:14:01] [INFO ] Deduced a trap composed of 11 places in 332 ms of which 5 ms to minimize.
[2024-05-28 19:14:02] [INFO ] Deduced a trap composed of 18 places in 337 ms of which 5 ms to minimize.
[2024-05-28 19:14:02] [INFO ] Deduced a trap composed of 12 places in 334 ms of which 6 ms to minimize.
[2024-05-28 19:14:02] [INFO ] Deduced a trap composed of 15 places in 327 ms of which 8 ms to minimize.
[2024-05-28 19:14:03] [INFO ] Deduced a trap composed of 10 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:14:03] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 5 ms to minimize.
[2024-05-28 19:14:04] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:14:04] [INFO ] Deduced a trap composed of 6 places in 334 ms of which 5 ms to minimize.
[2024-05-28 19:14:04] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 5 ms to minimize.
[2024-05-28 19:14:05] [INFO ] Deduced a trap composed of 16 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:14:05] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4941 variables, 20/3452 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:14:06] [INFO ] Deduced a trap composed of 7 places in 367 ms of which 5 ms to minimize.
[2024-05-28 19:14:07] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 5 ms to minimize.
[2024-05-28 19:14:07] [INFO ] Deduced a trap composed of 6 places in 341 ms of which 6 ms to minimize.
[2024-05-28 19:14:08] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:14:08] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 5 ms to minimize.
[2024-05-28 19:14:08] [INFO ] Deduced a trap composed of 7 places in 351 ms of which 5 ms to minimize.
[2024-05-28 19:14:09] [INFO ] Deduced a trap composed of 19 places in 330 ms of which 5 ms to minimize.
[2024-05-28 19:14:09] [INFO ] Deduced a trap composed of 11 places in 315 ms of which 5 ms to minimize.
[2024-05-28 19:14:10] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:14:10] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:14:11] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:14:11] [INFO ] Deduced a trap composed of 9 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:14:11] [INFO ] Deduced a trap composed of 14 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:14:12] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 5 ms to minimize.
[2024-05-28 19:14:12] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:14:12] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 6 ms to minimize.
[2024-05-28 19:14:13] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 5 ms to minimize.
[2024-05-28 19:14:13] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:14:14] [INFO ] Deduced a trap composed of 11 places in 284 ms of which 5 ms to minimize.
[2024-05-28 19:14:14] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4941 variables, 20/3472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:14:15] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:14:15] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 4 ms to minimize.
[2024-05-28 19:14:15] [INFO ] Deduced a trap composed of 14 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:14:16] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 4 ms to minimize.
[2024-05-28 19:14:16] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:14:16] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 4 ms to minimize.
[2024-05-28 19:14:17] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:14:17] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 4 ms to minimize.
[2024-05-28 19:14:17] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:14:18] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 3 ms to minimize.
[2024-05-28 19:14:18] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 3 ms to minimize.
[2024-05-28 19:14:18] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:14:19] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 3 ms to minimize.
[2024-05-28 19:14:19] [INFO ] Deduced a trap composed of 11 places in 245 ms of which 4 ms to minimize.
[2024-05-28 19:14:19] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:14:20] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:14:20] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:14:20] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 3 ms to minimize.
[2024-05-28 19:14:20] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:14:21] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4941 variables, 20/3492 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:14:22] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:14:22] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 3 ms to minimize.
[2024-05-28 19:14:22] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 4 ms to minimize.
[2024-05-28 19:14:22] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 3 ms to minimize.
[2024-05-28 19:14:23] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:14:23] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 3 ms to minimize.
[2024-05-28 19:14:23] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2024-05-28 19:14:24] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 3 ms to minimize.
[2024-05-28 19:14:24] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 4 ms to minimize.
[2024-05-28 19:14:24] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 4 ms to minimize.
[2024-05-28 19:14:24] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2024-05-28 19:14:25] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-05-28 19:14:25] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 3 ms to minimize.
[2024-05-28 19:14:25] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 3 ms to minimize.
[2024-05-28 19:14:25] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 3 ms to minimize.
[2024-05-28 19:14:26] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 3 ms to minimize.
[2024-05-28 19:14:26] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:14:27] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:14:27] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 4 ms to minimize.
[2024-05-28 19:14:27] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4941 variables, 20/3512 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:14:28] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:14:28] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:14:29] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 4 ms to minimize.
[2024-05-28 19:14:29] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:14:29] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:14:30] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 4 ms to minimize.
[2024-05-28 19:14:30] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:14:30] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 3 ms to minimize.
[2024-05-28 19:14:31] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 4 ms to minimize.
[2024-05-28 19:14:31] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 4 ms to minimize.
[2024-05-28 19:14:31] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 3 ms to minimize.
[2024-05-28 19:14:31] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 4 ms to minimize.
[2024-05-28 19:14:32] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 4 ms to minimize.
[2024-05-28 19:14:32] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-05-28 19:14:32] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 3 ms to minimize.
[2024-05-28 19:14:33] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 3 ms to minimize.
[2024-05-28 19:14:33] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:14:33] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 4 ms to minimize.
[2024-05-28 19:14:34] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 5 ms to minimize.
[2024-05-28 19:14:34] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4941 variables, 20/3532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:14:35] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:14:35] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:14:35] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 4 ms to minimize.
[2024-05-28 19:14:36] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:14:36] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:14:37] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:14:37] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:14:37] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 4 ms to minimize.
[2024-05-28 19:14:38] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/4941 variables, 9/3541 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:14:39] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 4 ms to minimize.
[2024-05-28 19:14:39] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 3 ms to minimize.
[2024-05-28 19:14:39] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:14:40] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 4 ms to minimize.
[2024-05-28 19:14:40] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 4 ms to minimize.
[2024-05-28 19:14:40] [INFO ] Deduced a trap composed of 20 places in 213 ms of which 3 ms to minimize.
[2024-05-28 19:14:41] [INFO ] Deduced a trap composed of 17 places in 203 ms of which 3 ms to minimize.
[2024-05-28 19:14:41] [INFO ] Deduced a trap composed of 20 places in 205 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/4941 variables, 8/3549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 19:14:42] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 3 ms to minimize.
[2024-05-28 19:14:42] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 3 ms to minimize.
[2024-05-28 19:14:43] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 3 ms to minimize.
[2024-05-28 19:14:43] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 3 ms to minimize.
[2024-05-28 19:14:43] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 4 ms to minimize.
[2024-05-28 19:14:44] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2024-05-28 19:14:44] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 3 ms to minimize.
[2024-05-28 19:14:44] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 4 ms to minimize.
SMT process timed out in 82343ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11756 ms.
Support contains 128 out of 2661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2661/2661 places, 2562/2562 transitions.
Applied a total of 0 rules in 98 ms. Remains 2661 /2661 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 2661/2661 places, 2562/2562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2661/2661 places, 2562/2562 transitions.
Applied a total of 0 rules in 84 ms. Remains 2661 /2661 variables (removed 0) and now considering 2562/2562 (removed 0) transitions.
[2024-05-28 19:14:56] [INFO ] Invariant cache hit.
[2024-05-28 19:14:58] [INFO ] Implicit Places using invariants in 1962 ms returned []
[2024-05-28 19:14:58] [INFO ] Invariant cache hit.
[2024-05-28 19:15:02] [INFO ] Implicit Places using invariants and state equation in 3728 ms returned []
Implicit Place search using SMT with State Equation took 5709 ms to find 0 implicit places.
[2024-05-28 19:15:02] [INFO ] Redundant transitions in 139 ms returned []
Running 2557 sub problems to find dead transitions.
[2024-05-28 19:15:02] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2657 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 2557 unsolved
SMT process timed out in 31549ms, After SMT, problems are : Problem set: 0 solved, 2557 unsolved
Search for dead transitions found 0 dead transitions in 31578ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37529 ms. Remains : 2661/2661 places, 2562/2562 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 19:15:34] [INFO ] Flatten gal took : 185 ms
[2024-05-28 19:15:34] [INFO ] Applying decomposition
[2024-05-28 19:15:34] [INFO ] Flatten gal took : 181 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/graph16923236315345388272.txt' '-o' '/tmp/graph16923236315345388272.bin' '-w' '/tmp/graph16923236315345388272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16923236315345388272.bin' '-l' '-1' '-v' '-w' '/tmp/graph16923236315345388272.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:15:35] [INFO ] Decomposing Gal with order
[2024-05-28 19:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:15:37] [INFO ] Removed a total of 2300 redundant transitions.
[2024-05-28 19:15:37] [INFO ] Flatten gal took : 558 ms
[2024-05-28 19:15:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 32 ms.
[2024-05-28 19:15:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16534170267524117729.gal : 95 ms
[2024-05-28 19:15:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16067144793473270879.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/ReachabilityCardinality16534170267524117729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16067144793473270879.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/ReachabilityCardinality16067144793473270879.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 1095
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1095 after 3.97434e+11
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :3.97434e+11 after 4.18597e+33
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :4.18597e+33 after 2.20683e+224
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :5.15696e+276 after 5.99023e+277
Reachability property ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12 is true.
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07 is true.
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05 is true.
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04 is true.
FORMULA ShieldIIPs-PT-100B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.99023e+277 after 3.19794e+291
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.19794e+291 after 3.19794e+291
ITS-tools command line returned an error code 137
[2024-05-28 19:28:38] [INFO ] Flatten gal took : 104 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18010919663139352132
[2024-05-28 19:28:38] [INFO ] Too many transitions (2562) to apply POR reductions. Disabling POR matrices.
[2024-05-28 19:28:38] [INFO ] Built C files in 124ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18010919663139352132
[2024-05-28 19:28:38] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin18010919663139352132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 19:28:38] [INFO ] Flatten gal took : 121 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/graph731624959325132765.txt' '-o' '/tmp/graph731624959325132765.bin' '-w' '/tmp/graph731624959325132765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph731624959325132765.bin' '-l' '-1' '-v' '-w' '/tmp/graph731624959325132765.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:28:39] [INFO ] Decomposing Gal with order
[2024-05-28 19:28:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:28:39] [INFO ] Removed a total of 1972 redundant transitions.
[2024-05-28 19:28:39] [INFO ] Flatten gal took : 143 ms
[2024-05-28 19:28:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2303 labels/synchronizations in 182 ms.
[2024-05-28 19:28:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15144314336548048934.gal : 101 ms
[2024-05-28 19:28:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15965313273634654634.prop : 42 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/ReachabilityCardinality15144314336548048934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15965313273634654634.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/ReachabilityCardinality15965313273634654634.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8 after 56
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :56 after 109064
Compilation finished in 8795 ms.
Running link step : cd /tmp/ltsmin18010919663139352132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin18010919663139352132;'/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' 'ShieldIIPsPT100BReachabilityCardinality202411==true'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin18010919663139352132;'/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' 'ShieldIIPsPT100BReachabilityCardinality202411==true'
Retrying LTSmin with larger timeout 28800 s
Running LTSmin : cd /tmp/ltsmin18010919663139352132;'/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' 'ShieldIIPsPT100BReachabilityCardinality202411==true'
Detected timeout of ITS tools.
[2024-05-28 19:54:11] [INFO ] Applying decomposition
[2024-05-28 19:54:11] [INFO ] Flatten gal took : 270 ms
[2024-05-28 19:54:11] [INFO ] Decomposing Gal with order
[2024-05-28 19:54:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:54:13] [INFO ] Removed a total of 2262 redundant transitions.
[2024-05-28 19:54:13] [INFO ] Flatten gal took : 411 ms
[2024-05-28 19:54:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4852 labels/synchronizations in 925 ms.
[2024-05-28 19:54:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17526185306201819979.gal : 168 ms
[2024-05-28 19:54:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15943146962150607525.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/ReachabilityCardinality17526185306201819979.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15943146962150607525.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/ReachabilityCardinality15943146962150607525.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 87
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :87 after 249
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :249 after 2.57191e+07
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2.57191e+07 after 2.39981e+22

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760500174"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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