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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 20:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 338K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716933825140

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 22:03:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 22:03:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:03:46] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-28 22:03:46] [INFO ] Transformed 1403 places.
[2024-05-28 22:03:46] [INFO ] Transformed 1303 transitions.
[2024-05-28 22:03:46] [INFO ] Found NUPN structural information;
[2024-05-28 22:03:46] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 22:03:47] [INFO ] Flatten gal took : 267 ms
RANDOM walk for 40000 steps (8 resets) in 2123 ms. (18 steps per ms) remains 5/14 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
[2024-05-28 22:03:47] [INFO ] Flatten gal took : 144 ms
BEST_FIRST walk for 40004 steps (8 resets) in 426 ms. (93 steps per ms) remains 5/5 properties
[2024-05-28 22:03:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality524286346447415434.gal : 80 ms
[2024-05-28 22:03:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9339950023239225732.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality524286346447415434.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9339950023239225732.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/5 properties

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 ...327
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality9339950023239225732.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 5/5 properties
// Phase 1: matrix 1303 rows 1403 cols
[2024-05-28 22:03:47] [INFO ] Computed 181 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem ShieldIIPt-PT-020B-ReachabilityCardinality-2024-14 is UNSAT
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1238/1352 variables, 173/287 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 3 (INCLUDED_ONLY) 0/1352 variables, 1238/1525 constraints. Problems are: Problem set: 1 solved, 4 unsolved
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 28
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :28 after 277
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :277 after 733
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :733 after 88423
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :88423 after 5.78704e+08
At refinement iteration 4 (INCLUDED_ONLY) 0/1352 variables, 0/1525 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 51/1403 variables, 8/1533 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 51/1584 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 0/1584 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2706 variables, 1403/2987 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2706 variables, 0/2987 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2706 variables, 0/2987 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2706/2706 variables, and 2987 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1740 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1403/1403 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1253/1338 variables, 171/256 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1338 variables, 1253/1509 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-28 22:03:50] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 44 ms to minimize.
[2024-05-28 22:03:50] [INFO ] Deduced a trap composed of 27 places in 236 ms of which 5 ms to minimize.
[2024-05-28 22:03:51] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 15 ms to minimize.
[2024-05-28 22:03:51] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 4 ms to minimize.
[2024-05-28 22:03:51] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 4 ms to minimize.
[2024-05-28 22:03:51] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 4 ms to minimize.
[2024-05-28 22:03:51] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 4 ms to minimize.
[2024-05-28 22:03:52] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
[2024-05-28 22:03:52] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 4 ms to minimize.
[2024-05-28 22:03:52] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 3 ms to minimize.
[2024-05-28 22:03:52] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 4 ms to minimize.
[2024-05-28 22:03:52] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 4 ms to minimize.
[2024-05-28 22:03:52] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-05-28 22:03:53] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 4 ms to minimize.
[2024-05-28 22:03:53] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 3 ms to minimize.
[2024-05-28 22:03:53] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
[2024-05-28 22:03:53] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 3 ms to minimize.
[2024-05-28 22:03:53] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 3 ms to minimize.
[2024-05-28 22:03:54] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2024-05-28 22:03:54] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1338 variables, 20/1529 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-28 22:03:54] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 3 ms to minimize.
[2024-05-28 22:03:54] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 4 ms to minimize.
[2024-05-28 22:03:54] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 3 ms to minimize.
[2024-05-28 22:03:54] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 3 ms to minimize.
SMT process timed out in 7027ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 284 transitions
Trivial Post-agglo rules discarded 284 transitions
Performed 284 trivial Post agglomeration. Transition count delta: 284
Iterating post reduction 0 with 284 rules applied. Total rules applied 284 place count 1403 transition count 1019
Reduce places removed 284 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 286 rules applied. Total rules applied 570 place count 1119 transition count 1017
Reduce places removed 1 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 2 with 27 rules applied. Total rules applied 597 place count 1118 transition count 991
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 623 place count 1092 transition count 991
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 83 Pre rules applied. Total rules applied 623 place count 1092 transition count 908
Deduced a syphon composed of 83 places in 2 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 789 place count 1009 transition count 908
Discarding 117 places :
Symmetric choice reduction at 4 with 117 rule applications. Total rules 906 place count 892 transition count 791
Iterating global reduction 4 with 117 rules applied. Total rules applied 1023 place count 892 transition count 791
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 1023 place count 892 transition count 753
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1099 place count 854 transition count 753
Performed 306 Post agglomeration using F-continuation condition.Transition count delta: 306
Deduced a syphon composed of 306 places in 1 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 4 with 612 rules applied. Total rules applied 1711 place count 548 transition count 447
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1795 place count 506 transition count 464
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 1800 place count 506 transition count 459
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1805 place count 501 transition count 459
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 1823 place count 501 transition count 459
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1824 place count 500 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1825 place count 499 transition count 458
Applied a total of 1825 rules in 704 ms. Remains 499 /1403 variables (removed 904) and now considering 458/1303 (removed 845) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 499/1403 places, 458/1303 transitions.
RANDOM walk for 40000 steps (8 resets) in 1161 ms. (34 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 197414 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 4
Probabilistic random walk after 197414 steps, saw 140839 distinct states, run finished after 3007 ms. (steps per millisecond=65 ) properties seen :0
// Phase 1: matrix 458 rows 499 cols
[2024-05-28 22:03:59] [INFO ] Computed 180 invariants in 4 ms
[2024-05-28 22:03:59] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 395/480 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/484 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 448/932 variables, 484/657 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/932 variables, 96/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/932 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 25/957 variables, 15/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/957 variables, 7/775 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/957 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/957 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 957/957 variables, and 775 constraints, problems are : Problem set: 0 solved, 4 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 395/480 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 2 ms to minimize.
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 5 ms to minimize.
[2024-05-28 22:04:00] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 2 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-28 22:04:01] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/484 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 9 ms to minimize.
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 22:04:02] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 448/932 variables, 484/691 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/932 variables, 96/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/932 variables, 2/789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 2 ms to minimize.
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/932 variables, 6/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 22:04:03] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/932 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/932 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 25/957 variables, 15/811 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/957 variables, 7/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/957 variables, 2/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 22:04:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-28 22:04:04] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-28 22:04:04] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/957 variables, 3/823 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/957 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/957 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 957/957 variables, and 823 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5854 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 44/44 constraints]
After SMT, in 6527ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 2748 ms.
Support contains 36 out of 499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 499/499 places, 458/458 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 499 transition count 450
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 491 transition count 450
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 16 place count 491 transition count 439
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 38 place count 480 transition count 439
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 479 transition count 438
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 479 transition count 438
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 40 place count 479 transition count 437
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 478 transition count 437
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 112 place count 443 transition count 402
Renaming transitions due to excessive name length > 1024 char.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 132 place count 433 transition count 413
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 433 transition count 412
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 433 transition count 411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 432 transition count 411
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 432 transition count 411
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 430 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 429 transition count 409
Applied a total of 139 rules in 227 ms. Remains 429 /499 variables (removed 70) and now considering 409/458 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 429/499 places, 409/458 transitions.
RANDOM walk for 40000 steps (8 resets) in 451 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 342 ms. (116 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 300572 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 2
Probabilistic random walk after 300572 steps, saw 210645 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
// Phase 1: matrix 409 rows 429 cols
[2024-05-28 22:04:12] [INFO ] Computed 179 invariants in 4 ms
[2024-05-28 22:04:12] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 362/398 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/406 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 392/798 variables, 406/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 132/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 22/820 variables, 12/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/820 variables, 6/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/820 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/835 variables, 8/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/835 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/835 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/836 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/836 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/836 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/838 variables, 2/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/838 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/838 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/838 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 838/838 variables, and 740 constraints, problems are : Problem set: 0 solved, 2 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 429/429 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 362/398 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 22:04:12] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-28 22:04:12] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-28 22:04:12] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-28 22:04:13] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-28 22:04:13] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 22:04:13] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/406 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 392/798 variables, 406/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 132/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 22:04:13] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-28 22:04:13] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 22/820 variables, 12/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/820 variables, 6/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/820 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 22:04:13] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-28 22:04:13] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/820 variables, 2/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/820 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 15/835 variables, 8/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/835 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/835 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/836 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/836 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/836 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/838 variables, 2/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/838 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/838 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/838 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 838/838 variables, and 752 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1883 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 429/429 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 2442ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 786 ms.
Support contains 36 out of 429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 409/409 transitions.
Applied a total of 0 rules in 10 ms. Remains 429 /429 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 429/429 places, 409/409 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 409/409 transitions.
Applied a total of 0 rules in 10 ms. Remains 429 /429 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-05-28 22:04:15] [INFO ] Invariant cache hit.
[2024-05-28 22:04:15] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-28 22:04:15] [INFO ] Invariant cache hit.
[2024-05-28 22:04:15] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-28 22:04:16] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2024-05-28 22:04:16] [INFO ] Redundant transitions in 21 ms returned []
Running 405 sub problems to find dead transitions.
[2024-05-28 22:04:16] [INFO ] Invariant cache hit.
[2024-05-28 22:04:16] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/429 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-28 22:04:23] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 22:04:24] [INFO ] Deduced a trap composed of 5 places in 464 ms of which 0 ms to minimize.
[2024-05-28 22:04:25] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-28 22:04:25] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-28 22:04:25] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 17/196 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (OVERLAPS) 409/838 variables, 429/625 constraints. Problems are: Problem set: 0 solved, 405 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 132/757 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 838/838 variables, and 757 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 429/429 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 1/429 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 17/196 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-05-28 22:04:49] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-28 22:04:50] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 22:04:50] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-28 22:04:50] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-28 22:04:50] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-28 22:04:50] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-28 22:04:51] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (OVERLAPS) 409/838 variables, 429/632 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 132/764 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 405/1169 constraints. Problems are: Problem set: 0 solved, 405 unsolved
[2024-05-28 22:05:12] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/838 variables, and 1170 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 179/179 constraints, State Equation: 429/429 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 25/25 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61304 ms. Remains : 429/429 places, 409/409 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 72 times.
Drop transitions (Partial Free agglomeration) removed 72 transitions
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 429 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 429 transition count 407
Applied a total of 74 rules in 32 ms. Remains 429 /429 variables (removed 0) and now considering 407/409 (removed 2) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 407 rows 429 cols
[2024-05-28 22:05:16] [INFO ] Computed 179 invariants in 1 ms
[2024-05-28 22:05:16] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 22:05:17] [INFO ] [Nat]Absence check using 179 positive place invariants in 23 ms returned sat
[2024-05-28 22:05:17] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 22:05:17] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-28 22:05:17] [INFO ] After 129ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 22:05:17] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-28 22:05:17] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:05:17] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:05:17] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-28 22:05:17] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-28 22:05:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 318 ms
[2024-05-28 22:05:17] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-28 22:05:17] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-28 22:05:17] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-28 22:05:17] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 22:05:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 242 ms
TRAPS : Iteration 1
[2024-05-28 22:05:18] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-28 22:05:18] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-28 22:05:18] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-28 22:05:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 202 ms
TRAPS : Iteration 2
[2024-05-28 22:05:18] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-28 22:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-28 22:05:18] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-28 22:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
TRAPS : Iteration 3
[2024-05-28 22:05:18] [INFO ] After 1440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 22:05:18] [INFO ] After 1831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-28 22:05:18] [INFO ] Flatten gal took : 35 ms
[2024-05-28 22:05:18] [INFO ] Flatten gal took : 28 ms
[2024-05-28 22:05:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15340234687219083274.gal : 4 ms
[2024-05-28 22:05:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4110365161462781192.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/ReachabilityCardinality15340234687219083274.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4110365161462781192.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 ...329
Loading property file /tmp/ReachabilityCardinality4110365161462781192.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 164
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :164 after 2918
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2918 after 1.46968e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.46968e+06 after 1.51008e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.51008e+06 after 1.56657e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.56657e+06 after 1.61178e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.61178e+06 after 1.93538e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.93538e+07 after 5.86165e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5.86165e+08 after 9.67085e+11
Detected timeout of ITS tools.
[2024-05-28 22:05:33] [INFO ] Flatten gal took : 26 ms
[2024-05-28 22:05:33] [INFO ] Applying decomposition
[2024-05-28 22:05:33] [INFO ] Flatten gal took : 31 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/graph3834499366650451201.txt' '-o' '/tmp/graph3834499366650451201.bin' '-w' '/tmp/graph3834499366650451201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3834499366650451201.bin' '-l' '-1' '-v' '-w' '/tmp/graph3834499366650451201.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:05:34] [INFO ] Decomposing Gal with order
[2024-05-28 22:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:05:34] [INFO ] Removed a total of 234 redundant transitions.
[2024-05-28 22:05:35] [INFO ] Flatten gal took : 476 ms
[2024-05-28 22:05:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 56 ms.
[2024-05-28 22:05:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10609103355477311681.gal : 32 ms
[2024-05-28 22:05:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11916654388065579192.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/ReachabilityCardinality10609103355477311681.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11916654388065579192.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/ReachabilityCardinality11916654388065579192.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 1462
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1462 after 1462
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1462 after 1462
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5.44202e+08 after 3.01409e+17
Reachability property ShieldIIPt-PT-020B-ReachabilityCardinality-2024-08 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.01409e+17 after 5.61337e+29
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.61337e+29 after 1.81802e+30
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 33465 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 22:05:50] [INFO ] Flatten gal took : 37 ms
[2024-05-28 22:05:50] [INFO ] Applying decomposition
[2024-05-28 22:05:50] [INFO ] Flatten gal took : 32 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/graph5582742652673465210.txt' '-o' '/tmp/graph5582742652673465210.bin' '-w' '/tmp/graph5582742652673465210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5582742652673465210.bin' '-l' '-1' '-v' '-w' '/tmp/graph5582742652673465210.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:05:50] [INFO ] Decomposing Gal with order
[2024-05-28 22:05:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:05:50] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-28 22:05:50] [INFO ] Flatten gal took : 74 ms
[2024-05-28 22:05:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 22:05:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1577930195834413800.gal : 16 ms
[2024-05-28 22:05:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5446826223853679155.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/ReachabilityCardinality1577930195834413800.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5446826223853679155.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/ReachabilityCardinality5446826223853679155.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 6642
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :6642 after 2.98017e+53
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.98017e+53 after 9.32855e+60
ITS-tools command line returned an error code 137
[2024-05-28 22:14:36] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9066795389004039415
[2024-05-28 22:14:36] [INFO ] Applying decomposition
[2024-05-28 22:14:36] [INFO ] Computing symmetric may disable matrix : 409 transitions.
[2024-05-28 22:14:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:14:36] [INFO ] Computing symmetric may enable matrix : 409 transitions.
[2024-05-28 22:14:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:14:36] [INFO ] Flatten gal took : 99 ms
[2024-05-28 22:14:36] [INFO ] Computing Do-Not-Accords matrix : 409 transitions.
[2024-05-28 22:14:36] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 22:14:36] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9066795389004039415
Running compilation step : cd /tmp/ltsmin9066795389004039415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph662422199431695669.txt' '-o' '/tmp/graph662422199431695669.bin' '-w' '/tmp/graph662422199431695669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph662422199431695669.bin' '-l' '-1' '-v' '-w' '/tmp/graph662422199431695669.weights' '-q' '0' '-e' '0.001'
[2024-05-28 22:14:36] [INFO ] Decomposing Gal with order
[2024-05-28 22:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:14:36] [INFO ] Removed a total of 311 redundant transitions.
[2024-05-28 22:14:36] [INFO ] Flatten gal took : 58 ms
[2024-05-28 22:14:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 29 ms.
[2024-05-28 22:14:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7451299025124190437.gal : 5 ms
[2024-05-28 22:14:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13240660797513222786.prop : 33 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/ReachabilityCardinality7451299025124190437.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13240660797513222786.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/ReachabilityCardinality13240660797513222786.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 2920
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.36051e+08 after 4.81015e+12
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4.81015e+12 after 3.12444e+31
Compilation finished in 1772 ms.
Running link step : cd /tmp/ltsmin9066795389004039415;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9066795389004039415;'/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' 'ShieldIIPtPT020BReachabilityCardinality202408==true'
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.99775e+60,49.8222,711840,767,78,1.20936e+06,724,1080,4.46308e+06,134,9638,0
Total reachable state count : 1.997746950066774133876737349922969924098e+60

Verifying 2 reachability properties.
Reachability property ShieldIIPt-PT-020B-ReachabilityCardinality-2024-08 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-020B-ReachabilityCardinality-2024-08,6.56314e+25,52.2418,712100,248,54,1.20936e+06,724,1107,4.46308e+06,140,9638,101
Invariant property ShieldIIPt-PT-020B-ReachabilityCardinality-2024-15 is true.
FORMULA ShieldIIPt-PT-020B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-020B-ReachabilityCardinality-2024-15,0,52.246,712100,1,0,1.20936e+06,724,1136,4.46308e+06,142,9638,717
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 766881 ms.

BK_STOP 1716934593260

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-020B, 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-171683760800286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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