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-171683760500167.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-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760500167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:13 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 868K 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-100A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716920498173

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 18:21:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 18:21:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:21:39] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-05-28 18:21:39] [INFO ] Transformed 2503 places.
[2024-05-28 18:21:39] [INFO ] Transformed 2403 transitions.
[2024-05-28 18:21:39] [INFO ] Found NUPN structural information;
[2024-05-28 18:21:39] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 376 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3013 ms. (13 steps per ms) remains 8/16 properties
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1200 ms. (33 steps per ms) remains 8/8 properties
[2024-05-28 18:21:41] [INFO ] Flatten gal took : 870 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1575 ms. (25 steps per ms) remains 8/8 properties
[2024-05-28 18:21:41] [INFO ] Flatten gal took : 404 ms
[2024-05-28 18:21:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16578743151843978797.gal : 109 ms
[2024-05-28 18:21:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15597842717833934479.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16578743151843978797.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15597842717833934479.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (8 resets) in 1067 ms. (37 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 875 ms. (45 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality15597842717833934479.prop.
BEST_FIRST walk for 40003 steps (8 resets) in 852 ms. (46 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 922 ms. (43 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 710 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 645 ms. (61 steps per ms) remains 8/8 properties
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-28 18:21:43] [INFO ] Computed 901 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 569/898 variables, 285/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/898 variables, 569/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/898 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1605/2503 variables, 616/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 1605/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 2403/4906 variables, 2503/5907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4906/4906 variables, and 5907 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3419 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 569/898 variables, 285/614 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/898 variables, 569/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/898 variables, 0/1183 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1605/2503 variables, 616/1799 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 1605/3404 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-28 18:21:47] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 15 ms to minimize.
[2024-05-28 18:21:48] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-28 18:21:48] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-28 18:21:48] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:21:48] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:21:48] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:21:48] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 18:21:48] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 8/3412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2503 variables, 0/3412 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 2403/4906 variables, 2503/5915 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :5 after 16
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :16 after 33
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :33 after 66
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :66 after 131
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :131 after 260
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :260 after 906
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :906 after 36549
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :36549 after 57334
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :57334 after 948345
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4906/4906 variables, and 5923 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5017 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints]
After SMT, in 8696ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 329 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :948345 after 1.61321e+08
Partial Free-agglomeration rule applied 551 times.
Drop transitions (Partial Free agglomeration) removed 551 transitions
Iterating global reduction 0 with 551 rules applied. Total rules applied 555 place count 2501 transition count 2401
Applied a total of 555 rules in 597 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 611 ms. Remains : 2501/2503 places, 2401/2403 transitions.
RANDOM walk for 40000 steps (8 resets) in 1703 ms. (23 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 787 ms. (50 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 738 ms. (54 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1.61321e+08 after 3.81321e+09
BEST_FIRST walk for 40004 steps (8 resets) in 646 ms. (61 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 645 ms. (61 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 672 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 790 ms. (50 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 710 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 711 ms. (56 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :3.81321e+09 after 1.08579e+12
Interrupted probabilistic random walk after 151497 steps, run timeout after 6001 ms. (steps per millisecond=25 ) properties seen :1 out of 8
Probabilistic random walk after 151497 steps, saw 141391 distinct states, run finished after 6004 ms. (steps per millisecond=25 ) properties seen :1
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-28 18:22:00] [INFO ] Computed 901 invariants in 49 ms
[2024-05-28 18:22:00] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 328/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 568/896 variables, 284/612 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 568/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1554/2450 variables, 591/1771 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :1.08579e+12 after 2.23143e+13
At refinement iteration 6 (INCLUDED_ONLY) 0/2450 variables, 1554/3325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2450 variables, 0/3325 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 51/2501 variables, 26/3351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 51/3402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3515 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 875/875 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 328/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/328 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 568/896 variables, 284/612 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 568/1180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:22:04] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-28 18:22:04] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-28 18:22:04] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-28 18:22:04] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 4/1184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:22:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 1/1185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1554/2450 variables, 591/1776 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2450 variables, 1554/3330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:22:05] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 3 ms to minimize.
[2024-05-28 18:22:06] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-28 18:22:06] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-28 18:22:06] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2024-05-28 18:22:06] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-28 18:22:06] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-28 18:22:06] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-28 18:22:06] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:22:06] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-28 18:22:06] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 18:22:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-28 18:22:07] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 18:22:07] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2450 variables, 13/3343 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:22:07] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2450 variables, 1/3344 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:22:08] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2450 variables, 1/3345 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2450 variables, 0/3345 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 51/2501 variables, 26/3371 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2501 variables, 51/3422 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:22:08] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-28 18:22:08] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2501 variables, 2/3424 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2501 variables, 0/3424 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2401/4902 variables, 2501/5925 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 4/5929 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :2.23143e+13 after 5.89999e+15
At refinement iteration 19 (INCLUDED_ONLY) 0/4902 variables, 7/5936 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:22:21] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-28 18:22:21] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-05-28 18:22:21] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:22:22] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 5 ms to minimize.
[2024-05-28 18:22:22] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-28 18:22:22] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-28 18:22:23] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-28 18:22:23] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:22:23] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 18:22:24] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 2 ms to minimize.
[2024-05-28 18:22:24] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-28 18:22:25] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-28 18:22:26] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:22:26] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-28 18:22:26] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:22:27] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4902 variables, 16/5952 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:22:31] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:22:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/4902 variables, 2/5954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 18:22:36] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 18:22:36] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 18:22:36] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/4902 variables, 3/5957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 262144
SDD size :5.89999e+15 after 1.14883e+17
At refinement iteration 23 (INCLUDED_ONLY) 0/4902 variables, 0/5957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 0/4902 variables, 0/5957 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5957 constraints, problems are : Problem set: 0 solved, 7 unsolved in 44413 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 875/875 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 43/43 constraints]
After SMT, in 48134ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 28016 ms.
Support contains 216 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 51 times.
Drop transitions (Partial Free agglomeration) removed 51 transitions
Iterating global reduction 0 with 51 rules applied. Total rules applied 51 place count 2501 transition count 2401
Applied a total of 51 rules in 183 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 2501/2501 places, 2401/2401 transitions.
RANDOM walk for 40000 steps (8 resets) in 1151 ms. (34 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 682 ms. (58 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 727 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 713 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 747 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 739 ms. (54 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 90269 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 5
Probabilistic random walk after 90269 steps, saw 86323 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-28 18:23:21] [INFO ] Computed 901 invariants in 38 ms
[2024-05-28 18:23:21] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 427/643 variables, 201/417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 427/844 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1812/2455 variables, 676/1520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2455 variables, 1812/3332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2455 variables, 0/3332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 46/2501 variables, 24/3356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 46/3402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2478 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 877/877 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 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/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 427/643 variables, 201/417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 427/844 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:23:24] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1812/2455 variables, 676/1521 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2455 variables, 1812/3333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 8 ms to minimize.
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 18:23:25] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2455 variables, 7/3340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2455 variables, 0/3340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 46/2501 variables, 24/3364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2501 variables, 46/3410 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:23:26] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-28 18:23:26] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-28 18:23:26] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2501 variables, 3/3413 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:23:26] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-28 18:23:26] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2501 variables, 2/3415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2501 variables, 0/3415 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2401/4902 variables, 2501/5916 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4902 variables, 4/5920 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4902 variables, 5/5925 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:23:34] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
[2024-05-28 18:23:34] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 2 ms to minimize.
[2024-05-28 18:23:34] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 3 ms to minimize.
[2024-05-28 18:23:35] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2024-05-28 18:23:35] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-05-28 18:23:35] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
[2024-05-28 18:23:36] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-05-28 18:23:36] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-05-28 18:23:36] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-28 18:23:37] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-28 18:23:37] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-05-28 18:23:37] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-28 18:23:37] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 2 ms to minimize.
[2024-05-28 18:23:38] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-28 18:23:38] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-05-28 18:23:38] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:23:39] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-28 18:23:39] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 18:23:39] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:23:39] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 20/5945 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:23:42] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:23:42] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-28 18:23:42] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:23:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 524288
SDD size :1.14883e+17 after 2.85878e+19
[2024-05-28 18:23:44] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
[2024-05-28 18:23:45] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 3 ms to minimize.
[2024-05-28 18:23:45] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-05-28 18:23:45] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-05-28 18:23:45] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-28 18:23:46] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-28 18:23:46] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-28 18:23:46] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-28 18:23:47] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-28 18:23:47] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-28 18:23:47] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-28 18:23:47] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:23:48] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-28 18:23:48] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 18:23:49] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4902 variables, 19/5964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4902 variables, 0/5964 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:23:55] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/4902 variables, 1/5965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4902 variables, 0/5965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/4902 variables, 0/5965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5965 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41000 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 877/877 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 53/53 constraints]
After SMT, in 43657ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 24364 ms.
Support contains 216 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 86 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 81 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-28 18:24:29] [INFO ] Invariant cache hit.
[2024-05-28 18:24:31] [INFO ] Implicit Places using invariants in 1763 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1774 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 84 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1941 ms. Remains : 2500/2501 places, 2401/2401 transitions.
RANDOM walk for 40000 steps (8 resets) in 1368 ms. (29 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 752 ms. (53 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 704 ms. (56 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 659 ms. (60 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 723 ms. (55 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 698 ms. (57 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 91787 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 5
Probabilistic random walk after 91787 steps, saw 87752 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
// Phase 1: matrix 2401 rows 2500 cols
[2024-05-28 18:24:36] [INFO ] Computed 900 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 427/643 variables, 201/417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 427/844 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1811/2454 variables, 675/1519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2454 variables, 1811/3330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2454 variables, 0/3330 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 46/2500 variables, 24/3354 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2500 variables, 46/3400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2500 variables, 0/3400 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4901 variables, 2500/5900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4901 variables, 0/5900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/4901 variables, 0/5900 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5900 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2284 ms.
Refiners :[Domain max(s): 2500/2500 constraints, Positive P Invariants (semi-flows): 876/876 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 2500/2500 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/216 variables, 216/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 427/643 variables, 201/417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/643 variables, 427/844 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:24:38] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 1/845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1811/2454 variables, 675/1520 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2454 variables, 1811/3331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:24:39] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-28 18:24:39] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-28 18:24:39] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-05-28 18:24:39] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-28 18:24:39] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-28 18:24:39] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:24:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-28 18:24:40] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-28 18:24:40] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:24:40] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-28 18:24:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 18:24:40] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 18:24:40] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 18:24:40] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2454 variables, 14/3345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:24:41] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2454 variables, 1/3346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2454 variables, 0/3346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 46/2500 variables, 24/3370 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2500 variables, 46/3416 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:24:41] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-28 18:24:41] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-28 18:24:41] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2500 variables, 3/3419 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:24:41] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2500 variables, 1/3420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2500 variables, 0/3420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2401/4901 variables, 2500/5920 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4901 variables, 5/5925 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:24:49] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-28 18:24:49] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-28 18:24:50] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-28 18:24:50] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 2 ms to minimize.
[2024-05-28 18:24:50] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-05-28 18:24:51] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-28 18:24:51] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-28 18:24:51] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-28 18:24:52] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-28 18:24:52] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-28 18:24:52] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-28 18:24:52] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-28 18:24:53] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-28 18:24:53] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-28 18:24:53] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-28 18:24:54] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-28 18:24:54] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-28 18:24:54] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
[2024-05-28 18:24:55] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 18:24:55] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4901 variables, 20/5945 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:24:58] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-28 18:24:58] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-28 18:24:58] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:24:58] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:24:59] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4901 variables, 5/5950 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-28 18:25:02] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-28 18:25:03] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/4901 variables, 2/5952 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4901 variables, 0/5952 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/4901 variables, 0/5952 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 5952 constraints, problems are : Problem set: 0 solved, 5 unsolved in 34783 ms.
Refiners :[Domain max(s): 2500/2500 constraints, Positive P Invariants (semi-flows): 876/876 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 47/47 constraints]
After SMT, in 37167ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
SDD proceeding with computation,8 properties remain. new max is 1048576
SDD size :2.85878e+19 after 3.32115e+19
Parikh walk visited 0 properties in 38860 ms.
Support contains 216 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 73 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 69 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2024-05-28 18:25:52] [INFO ] Invariant cache hit.
[2024-05-28 18:25:53] [INFO ] Implicit Places using invariants in 1568 ms returned []
[2024-05-28 18:25:53] [INFO ] Invariant cache hit.
[2024-05-28 18:25:57] [INFO ] Implicit Places using invariants and state equation in 3971 ms returned []
Implicit Place search using SMT with State Equation took 5542 ms to find 0 implicit places.
[2024-05-28 18:25:58] [INFO ] Redundant transitions in 775 ms returned []
Running 2400 sub problems to find dead transitions.
[2024-05-28 18:25:58] [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/2499 variables, 2499/2499 constraints. Problems are: Problem set: 0 solved, 2400 unsolved
SMT process timed out in 31936ms, After SMT, problems are : Problem set: 0 solved, 2400 unsolved
Search for dead transitions found 0 dead transitions in 31962ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38366 ms. Remains : 2500/2500 places, 2401/2401 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 18:26:31] [INFO ] Flatten gal took : 184 ms
[2024-05-28 18:26:31] [INFO ] Applying decomposition
[2024-05-28 18:26:31] [INFO ] Flatten gal took : 175 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/graph7639851806022267912.txt' '-o' '/tmp/graph7639851806022267912.bin' '-w' '/tmp/graph7639851806022267912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7639851806022267912.bin' '-l' '-1' '-v' '-w' '/tmp/graph7639851806022267912.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:26:31] [INFO ] Decomposing Gal with order
[2024-05-28 18:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:26:32] [INFO ] Removed a total of 1600 redundant transitions.
[2024-05-28 18:26:32] [INFO ] Flatten gal took : 270 ms
[2024-05-28 18:26:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1556 labels/synchronizations in 351 ms.
[2024-05-28 18:26:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3796336989014605164.gal : 48 ms
[2024-05-28 18:26:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12803750647606857552.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/ReachabilityCardinality3796336989014605164.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12803750647606857552.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12803750647606857552.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 79
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :79 after 61659
ITS-tools command line returned an error code 137
[2024-05-28 18:38:37] [INFO ] Flatten gal took : 146 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16693129062882153022
[2024-05-28 18:38:37] [INFO ] Too many transitions (2401) to apply POR reductions. Disabling POR matrices.
[2024-05-28 18:38:37] [INFO ] Applying decomposition
[2024-05-28 18:38:37] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16693129062882153022
Running compilation step : cd /tmp/ltsmin16693129062882153022;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 18:38:37] [INFO ] Flatten gal took : 149 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/graph6106938762936584410.txt' '-o' '/tmp/graph6106938762936584410.bin' '-w' '/tmp/graph6106938762936584410.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6106938762936584410.bin' '-l' '-1' '-v' '-w' '/tmp/graph6106938762936584410.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:38:37] [INFO ] Decomposing Gal with order
[2024-05-28 18:38:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:38:38] [INFO ] Removed a total of 1898 redundant transitions.
[2024-05-28 18:38:38] [INFO ] Flatten gal took : 160 ms
[2024-05-28 18:38:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2159 labels/synchronizations in 164 ms.
[2024-05-28 18:38:38] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4762748909132869355.gal : 23 ms
[2024-05-28 18:38:38] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9790366868655470444.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/ReachabilityFireability4762748909132869355.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9790366868655470444.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability9790366868655470444.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :2 after 2
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :2 after 2
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :2 after 2
Compilation finished in 8612 ms.
Running link step : cd /tmp/ltsmin16693129062882153022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202400==true'
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :2 after 2
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202401==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202401==true'
Running LTSmin : cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202408==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202408==true'
Running LTSmin : cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202412==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202412==true'
Running LTSmin : cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202413==true'
WARNING : LTSmin timed out (>144 s) on command cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202413==true'
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202400==true'
ITS-tools command line returned an error code 137
[2024-05-28 18:59:33] [INFO ] Applying decomposition
[2024-05-28 18:59:33] [INFO ] Flatten gal took : 355 ms
[2024-05-28 18:59:33] [INFO ] Decomposing Gal with order
[2024-05-28 18:59:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:59:34] [INFO ] Removed a total of 2211 redundant transitions.
[2024-05-28 18:59:34] [INFO ] Flatten gal took : 325 ms
[2024-05-28 18:59:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1999 labels/synchronizations in 553 ms.
[2024-05-28 18:59:35] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8409812085229927808.gal : 45 ms
[2024-05-28 18:59:35] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16075462075077243251.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/ReachabilityFireability8409812085229927808.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16075462075077243251.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability16075462075077243251.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :3 after 3
WARNING : LTSmin timed out (>1152 s) on command cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin16693129062882153022;'/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' 'ShieldIIPsPT100AReachabilityFireability202401==true'
ITS-tools command line returned an error code 137
[2024-05-28 19:14:46] [INFO ] Flatten gal took : 672 ms
[2024-05-28 19:14:46] [INFO ] Input system was already deterministic with 2401 transitions.
[2024-05-28 19:14:46] [INFO ] Transformed 2500 places.
[2024-05-28 19:14:47] [INFO ] Transformed 2401 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 19:14:49] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18227492604086769458.gal : 36 ms
[2024-05-28 19:14:49] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8093637152139779256.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability18227492604086769458.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8093637152139779256.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...374
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability8093637152139779256.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :129 after 310
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :310 after 5198
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :5198 after 34158
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :34158 after 634641
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :634641 after 7.64055e+06
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :7.64055e+06 after 1.36476e+07
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1.36476e+07 after 4.9927e+07
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :4.9927e+07 after 9.55743e+08
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :9.55743e+08 after 1.3925e+09
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :1.3925e+09 after 1.14174e+10
SDD proceeding with computation,5 properties remain. new max is 262144
SDD size :1.14174e+10 after 3.52992e+11
SDD proceeding with computation,5 properties remain. new max is 524288
SDD size :3.52992e+11 after 2.2358e+12

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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