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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:52 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 9.2K Apr 12 20:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 20:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 20:37 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 167K 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-010B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716931198219

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 21:19:59] [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 21:19:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:19:59] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-28 21:19:59] [INFO ] Transformed 703 places.
[2024-05-28 21:19:59] [INFO ] Transformed 653 transitions.
[2024-05-28 21:19:59] [INFO ] Found NUPN structural information;
[2024-05-28 21:19:59] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1564 ms. (25 steps per ms) remains 3/16 properties
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 21:20:00] [INFO ] Flatten gal took : 173 ms
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 3/3 properties
[2024-05-28 21:20:00] [INFO ] Flatten gal took : 62 ms
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
[2024-05-28 21:20:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7775581413162430432.gal : 74 ms
[2024-05-28 21:20:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14247647895654763325.prop : 6 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/ReachabilityCardinality7775581413162430432.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14247647895654763325.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 653 rows 703 cols
[2024-05-28 21:20:00] [INFO ] Computed 91 invariants in 13 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14247647895654763325.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
Problem ShieldIIPt-PT-010B-ReachabilityFireability-2024-05 is UNSAT
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,3 properties remain. new max is 16
At refinement iteration 2 (OVERLAPS) 305/328 variables, 37/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD size :10 after 12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :12 after 19
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :19 after 289
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :289 after 17523
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :17523 after 1.15741e+09
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 305/365 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 375/703 variables, 54/419 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 375/794 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/794 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 653/1356 variables, 703/1497 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1356 variables, 0/1497 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1356 variables, 0/1497 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1356/1356 variables, and 1497 constraints, problems are : Problem set: 1 solved, 2 unsolved in 742 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 207/221 variables, 25/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 207/246 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 19 ms to minimize.
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/249 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/249 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 482/703 variables, 66/315 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 482/797 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 21:20:01] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 2 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 5 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 11 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-28 21:20:02] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 10/807 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 0/807 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 653/1356 variables, 703/1510 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1356 variables, 2/1512 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 2 ms to minimize.
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1356 variables, 5/1517 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-28 21:20:03] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1356 variables, 1/1518 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1356 variables, 0/1518 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1356 variables, 0/1518 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1356/1356 variables, and 1518 constraints, problems are : Problem set: 1 solved, 2 unsolved in 3019 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 19/19 constraints]
After SMT, in 3833ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 436 ms.
Support contains 14 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 703 transition count 495
Reduce places removed 158 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 160 rules applied. Total rules applied 318 place count 545 transition count 493
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 324 place count 544 transition count 488
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 329 place count 539 transition count 488
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 329 place count 539 transition count 445
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 415 place count 496 transition count 445
Discarding 68 places :
Symmetric choice reduction at 4 with 68 rule applications. Total rules 483 place count 428 transition count 377
Iterating global reduction 4 with 68 rules applied. Total rules applied 551 place count 428 transition count 377
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 551 place count 428 transition count 349
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 607 place count 400 transition count 349
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 0 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 4 with 324 rules applied. Total rules applied 931 place count 238 transition count 187
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 985 place count 211 transition count 202
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 986 place count 211 transition count 201
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 987 place count 211 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 988 place count 210 transition count 200
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 997 place count 210 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 998 place count 209 transition count 199
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1000 place count 207 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1000 place count 207 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1002 place count 206 transition count 198
Applied a total of 1002 rules in 160 ms. Remains 206 /703 variables (removed 497) and now considering 198/653 (removed 455) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 206/703 places, 198/653 transitions.
RANDOM walk for 40000 steps (8 resets) in 727 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 430565 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 2
Probabilistic random walk after 430565 steps, saw 310535 distinct states, run finished after 3005 ms. (steps per millisecond=143 ) properties seen :0
// Phase 1: matrix 198 rows 206 cols
[2024-05-28 21:20:08] [INFO ] Computed 89 invariants in 2 ms
[2024-05-28 21:20:08] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/72 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 83/155 variables, 72/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 9/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 94/249 variables, 48/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 23/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 78/327 variables, 40/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 15/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/330 variables, 5/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/330 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/332 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 36/368 variables, 22/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/368 variables, 9/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/369 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/369 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/369 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/371 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/371 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 16/387 variables, 10/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/387 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/387 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 9/396 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/396 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/396 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/396 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 1/397 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/397 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/397 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 1/398 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/398 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/398 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 6/404 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/404 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/404 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 0/404 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 206/206 constraints, ReadFeed: 14/14 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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/72 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:20:08] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 83/155 variables, 72/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 94/249 variables, 48/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 78/327 variables, 40/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 15/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/330 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/332 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/332 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 36/368 variables, 22/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/368 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/369 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/369 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/369 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/371 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/371 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 16/387 variables, 10/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/387 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/387 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 9/396 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/396 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/396 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/396 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 1/397 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/397 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/397 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 1/398 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/398 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/398 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 6/404 variables, 4/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/404 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/404 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 0/404 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 312 constraints, problems are : Problem set: 0 solved, 2 unsolved in 431 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, State Equation: 206/206 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 755ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 14 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 198/198 transitions.
Applied a total of 0 rules in 13 ms. Remains 206 /206 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 206/206 places, 198/198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 198/198 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-28 21:20:09] [INFO ] Invariant cache hit.
[2024-05-28 21:20:09] [INFO ] Implicit Places using invariants in 114 ms returned [195]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/206 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 204 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 204 transition count 197
Applied a total of 2 rules in 10 ms. Remains 204 /205 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 204 cols
[2024-05-28 21:20:09] [INFO ] Computed 88 invariants in 1 ms
[2024-05-28 21:20:09] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 21:20:09] [INFO ] Invariant cache hit.
[2024-05-28 21:20:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 21:20:09] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 204/206 places, 197/198 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 453 ms. Remains : 204/206 places, 197/198 transitions.
RANDOM walk for 40000 steps (8 resets) in 312 ms. (127 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 501407 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 2
Probabilistic random walk after 501407 steps, saw 351271 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-28 21:20:12] [INFO ] Invariant cache hit.
[2024-05-28 21:20:12] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/72 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:20:12] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 83/155 variables, 72/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 94/249 variables, 48/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 23/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 78/327 variables, 40/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 15/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/330 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/332 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 36/368 variables, 22/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 9/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/369 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/369 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/369 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/371 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/371 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 16/387 variables, 10/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/387 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/387 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 8/395 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/395 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/395 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 6/401 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/401 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/401 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 0/401 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 204/204 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 58/72 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 83/155 variables, 72/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 94/249 variables, 48/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 78/327 variables, 40/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 15/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/330 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/332 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/332 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 36/368 variables, 22/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/368 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 21:20:13] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/368 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/368 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/369 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/369 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/369 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/371 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/371 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 16/387 variables, 10/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/387 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/387 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 8/395 variables, 4/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/395 variables, 2/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/395 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 6/401 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/401 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/401 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 0/401 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 309 constraints, problems are : Problem set: 0 solved, 2 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 204/204 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 745ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 148 ms.
Support contains 14 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 197/197 transitions.
Applied a total of 0 rules in 9 ms. Remains 204 /204 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 204/204 places, 197/197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 204 /204 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-28 21:20:13] [INFO ] Invariant cache hit.
[2024-05-28 21:20:13] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 21:20:13] [INFO ] Invariant cache hit.
[2024-05-28 21:20:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-28 21:20:13] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-28 21:20:13] [INFO ] Redundant transitions in 6 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-28 21:20:13] [INFO ] Invariant cache hit.
[2024-05-28 21:20:13] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 3/204 variables, 19/88 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-28 21:20:15] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-28 21:20:15] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-28 21:20:15] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-28 21:20:15] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 197/401 variables, 204/296 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 13/309 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/401 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 309 constraints, problems are : Problem set: 0 solved, 191 unsolved in 6114 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 204/204 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 3/204 variables, 19/91 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 197/401 variables, 204/296 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 13/309 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 191/500 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-28 21:20:22] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-28 21:20:25] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (OVERLAPS) 0/401 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 502 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12315 ms.
Refiners :[Positive P Invariants (semi-flows): 88/88 constraints, State Equation: 204/204 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 6/6 constraints]
After SMT, in 18495ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18500ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18850 ms. Remains : 204/204 places, 197/197 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 204 transition count 197
Applied a total of 21 rules in 17 ms. Remains 204 /204 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 197 rows 204 cols
[2024-05-28 21:20:32] [INFO ] Computed 88 invariants in 4 ms
[2024-05-28 21:20:32] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 21:20:32] [INFO ] [Nat]Absence check using 88 positive place invariants in 9 ms returned sat
[2024-05-28 21:20:32] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 21:20:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-28 21:20:32] [INFO ] After 22ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 21:20:32] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 21:20:32] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-28 21:20:32] [INFO ] Flatten gal took : 21 ms
[2024-05-28 21:20:32] [INFO ] Flatten gal took : 19 ms
[2024-05-28 21:20:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality832420391380141363.gal : 11 ms
[2024-05-28 21:20:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5346726258355395224.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/ReachabilityCardinality832420391380141363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5346726258355395224.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 ...327
Loading property file /tmp/ReachabilityCardinality5346726258355395224.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 99
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :99 after 117
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :117 after 1755
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1755 after 7512
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7512 after 135982
Detected timeout of ITS tools.
[2024-05-28 21:20:47] [INFO ] Flatten gal took : 18 ms
[2024-05-28 21:20:47] [INFO ] Applying decomposition
[2024-05-28 21:20:47] [INFO ] Flatten gal took : 19 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/graph14655654402704627149.txt' '-o' '/tmp/graph14655654402704627149.bin' '-w' '/tmp/graph14655654402704627149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14655654402704627149.bin' '-l' '-1' '-v' '-w' '/tmp/graph14655654402704627149.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:20:47] [INFO ] Decomposing Gal with order
[2024-05-28 21:20:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:20:48] [INFO ] Removed a total of 108 redundant transitions.
[2024-05-28 21:20:48] [INFO ] Flatten gal took : 70 ms
[2024-05-28 21:20:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 15 ms.
[2024-05-28 21:20:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3919426344777924125.gal : 12 ms
[2024-05-28 21:20:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11932675230543456901.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/ReachabilityCardinality3919426344777924125.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11932675230543456901.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/ReachabilityCardinality11932675230543456901.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 3
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3 after 45
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :59904 after 5.20704e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5.20704e+06 after 2.97449e+15
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-2024-14 is true.
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-2024-12 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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,2.69288e+23,4.93161,160480,1268,209,212288,1809,480,1.22841e+06,116,24820,0
Total reachable state count : 269287832363164982476800

Verifying 2 reachability properties.
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-2024-12 is 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
ShieldIIPt-PT-010B-ReachabilityFireability-2024-12,1.35291e+14,4.93846,160480,108,53,212288,1809,558,1.22841e+06,135,24820,0
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-2024-14 is 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
ShieldIIPt-PT-010B-ReachabilityFireability-2024-14,1.25241e+15,4.93898,160480,108,64,212288,1809,567,1.22841e+06,139,24820,0
Over-approximation ignoring read arcs solved 0 properties in 20735 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 21:20:53] [INFO ] Flatten gal took : 21 ms
[2024-05-28 21:20:53] [INFO ] Applying decomposition
[2024-05-28 21:20:53] [INFO ] Flatten gal took : 21 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/graph14811637300039012291.txt' '-o' '/tmp/graph14811637300039012291.bin' '-w' '/tmp/graph14811637300039012291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14811637300039012291.bin' '-l' '-1' '-v' '-w' '/tmp/graph14811637300039012291.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:20:53] [INFO ] Decomposing Gal with order
[2024-05-28 21:20:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:20:53] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-28 21:20:53] [INFO ] Flatten gal took : 43 ms
[2024-05-28 21:20:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 21:20:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1390240568017553137.gal : 11 ms
[2024-05-28 21:20:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16977726905711928134.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/ReachabilityCardinality1390240568017553137.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16977726905711928134.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/ReachabilityCardinality16977726905711928134.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.26423e+07
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1.26423e+07 after 2.2347e+17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.61054e+29 after 1.95332e+31
ITS-tools command line returned an error code 137
[2024-05-28 21:31:13] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin127727373078299229
[2024-05-28 21:31:13] [INFO ] Applying decomposition
[2024-05-28 21:31:13] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2024-05-28 21:31:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:31:13] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2024-05-28 21:31:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:31:13] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2024-05-28 21:31:13] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:31:13] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:31:13] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin127727373078299229
Running compilation step : cd /tmp/ltsmin127727373078299229;'/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/graph17460714670064638962.txt' '-o' '/tmp/graph17460714670064638962.bin' '-w' '/tmp/graph17460714670064638962.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17460714670064638962.bin' '-l' '-1' '-v' '-w' '/tmp/graph17460714670064638962.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:31:13] [INFO ] Decomposing Gal with order
[2024-05-28 21:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:31:13] [INFO ] Removed a total of 176 redundant transitions.
[2024-05-28 21:31:13] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 5 ms.
[2024-05-28 21:31:13] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6371982558172138913.gal : 4 ms
[2024-05-28 21:31:13] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13867261512064287940.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/ReachabilityFireability6371982558172138913.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability13867261512064287940.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/ReachabilityFireability13867261512064287940.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3 after 117
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-2024-12 is true.
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7488 after 3.4212e+17
Compilation finished in 709 ms.
Running link step : cd /tmp/ltsmin127727373078299229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin127727373078299229;'/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' 'ShieldIIPtPT010BReachabilityFireability202414==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.07862e+29,8.8657,216716,270,40,311461,288,469,1.52646e+06,74,1048,0
Total reachable state count : 107861571411612499046544965632

Verifying 2 reachability properties.
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-2024-12 is 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
ShieldIIPt-PT-010B-ReachabilityFireability-2024-12,3.69811e+23,9.78679,216976,114,30,311461,288,554,1.52646e+06,88,1048,122
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-2024-14 does not hold.
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : ShieldIIPt-PT-010B-ReachabilityFireability-2024-14

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-010B-ReachabilityFireability-2024-14,0,9.78712,216976,1,0,311461,288,555,1.52646e+06,89,1048,135
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 695222 ms.

BK_STOP 1716931894617

--------------------
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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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-171683760700271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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