About the Execution of ITS-Tools for ShieldRVs-PT-003B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 525.191 | 37128.00 | 89661.00 | 118.10 | FTFTTFFFFTTTTTTF | normal |
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-171683761800751.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 ShieldRVs-PT-003B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761800751
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 17:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 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 36K 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 ShieldRVs-PT-003B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVs-PT-003B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717033684129
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-30 01:48:05] [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-30 01:48:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:48:05] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-05-30 01:48:05] [INFO ] Transformed 123 places.
[2024-05-30 01:48:05] [INFO ] Transformed 138 transitions.
[2024-05-30 01:48:05] [INFO ] Found NUPN structural information;
[2024-05-30 01:48:05] [INFO ] Parsed PT model containing 123 places and 138 transitions and 432 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 01:48:05] [INFO ] Flatten gal took : 104 ms
[2024-05-30 01:48:06] [INFO ] Flatten gal took : 35 ms
RANDOM walk for 40000 steps (268 resets) in 1464 ms. (27 steps per ms) remains 4/16 properties
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:48:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8362379674630582808.gal : 34 ms
BEST_FIRST walk for 40004 steps (50 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
[2024-05-30 01:48:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17050708206296935589.prop : 11 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/ReachabilityCardinality8362379674630582808.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17050708206296935589.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/ReachabilityCardinality17050708206296935589.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :15 after 153
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :153 after 1814
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1814 after 883390
BEST_FIRST walk for 40001 steps (55 resets) in 762 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (53 resets) in 754 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (45 resets) in 225 ms. (177 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.55956e+06 after 3.81961e+06
// Phase 1: matrix 138 rows 123 cols
[2024-05-30 01:48:06] [INFO ] Computed 13 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 43/123 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 43/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 138/261 variables, 123/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/261 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 259 constraints, problems are : Problem set: 0 solved, 4 unsolved in 442 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 123/123 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/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 43/123 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 43/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 01:48:07] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 18 ms to minimize.
[2024-05-30 01:48:07] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:48:07] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:48:07] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:48:07] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:48:07] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:48:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
Problem ShieldRVs-PT-003B-ReachabilityFireability-2024-00 is UNSAT
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-30 01:48:07] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:48:07] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:48:07] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 12/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 19 ms to minimize.
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 4/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 3 ms to minimize.
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 5/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 138/261 variables, 123/280 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 3/283 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/284 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-30 01:48:08] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 7 ms to minimize.
[2024-05-30 01:48:09] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/261 variables, 2/286 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/261 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/261 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 286 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2070 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 24/24 constraints]
After SMT, in 2620ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 1469 ms.
Support contains 79 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 136
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 121 transition count 132
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 12 place count 117 transition count 132
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12 place count 117 transition count 127
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 22 place count 112 transition count 127
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 25 place count 109 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 109 transition count 124
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 36 place count 105 transition count 120
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 105 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 104 transition count 119
Applied a total of 38 rules in 39 ms. Remains 104 /123 variables (removed 19) and now considering 119/138 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 104/123 places, 119/138 transitions.
RANDOM walk for 40000 steps (299 resets) in 293 ms. (136 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :3.81961e+06 after 3.90834e+06
BEST_FIRST walk for 40004 steps (67 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (51 resets) in 91 ms. (434 steps per ms) remains 1/2 properties
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 119 rows 104 cols
[2024-05-30 01:48:11] [INFO ] Computed 13 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/104 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 119/223 variables, 104/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/223 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/104 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 01:48:11] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:48:11] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:48:11] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:48:11] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:48:11] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 119/223 variables, 104/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 01:48:11] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:48:11] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/223 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 49 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 119/119 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 118
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 103 transition count 113
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 98 transition count 113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 19 place count 91 transition count 106
Iterating global reduction 2 with 7 rules applied. Total rules applied 26 place count 91 transition count 106
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 82 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 81 transition count 96
Applied a total of 45 rules in 16 ms. Remains 81 /104 variables (removed 23) and now considering 96/119 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 81/104 places, 96/119 transitions.
RANDOM walk for 40000 steps (353 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (87 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3315721 steps, run timeout after 3001 ms. (steps per millisecond=1104 ) properties seen :0 out of 1
Probabilistic random walk after 3315721 steps, saw 491687 distinct states, run finished after 3005 ms. (steps per millisecond=1103 ) properties seen :0
// Phase 1: matrix 96 rows 81 cols
[2024-05-30 01:48:14] [INFO ] Computed 13 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/81 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 96/177 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/177 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/81 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 01:48:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:48:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:48:15] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 96/177 variables, 81/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 01:48:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 01:48:15] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3.90834e+06 after 3.98521e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/177 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 517ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 49 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 96/96 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 81/81 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-30 01:48:15] [INFO ] Invariant cache hit.
[2024-05-30 01:48:15] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 01:48:15] [INFO ] Invariant cache hit.
[2024-05-30 01:48:15] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-30 01:48:15] [INFO ] Redundant transitions in 1 ms returned []
Running 93 sub problems to find dead transitions.
[2024-05-30 01:48:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 3/81 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:15] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:48:15] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 2 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:48:16] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:48:17] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:48:18] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:48:19] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:19] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:48:19] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:48:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:48:19] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:48:19] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:48:19] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:48:19] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 93 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :3.98521e+06 after 4.16711e+06
[2024-05-30 01:48:19] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 96/177 variables, 81/168 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:20] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:48:20] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:48:20] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:48:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:48:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:48:20] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:48:20] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:48:20] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:48:20] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 9/177 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:21] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:48:21] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:48:21] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:48:21] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:22] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:48:22] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:48:22] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:48:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:48:22] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:22] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/177 variables, 6/193 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:48:23] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:48:24] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:48:24] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:48:24] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:48:24] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/177 variables, 15/208 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:24] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:48:24] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/177 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:25] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:48:25] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:48:25] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/177 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:25] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:48:25] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/177 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/177 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:26] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/177 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:26] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:48:26] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:48:27] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/177 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/177 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:27] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/177 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/177 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 27 (OVERLAPS) 0/177 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 220 constraints, problems are : Problem set: 0 solved, 93 unsolved in 13485 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 126/126 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 3/81 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 126/139 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 3 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:48:29] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:48:30] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 18/157 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 96/177 variables, 81/238 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 93/331 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:31] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:48:31] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:48:31] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:48:32] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:48:32] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 5/336 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-05-30 01:48:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:48:34] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/177 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 338 constraints, problems are : Problem set: 0 solved, 93 unsolved in 11281 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 151/151 constraints]
After SMT, in 24797ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 24798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24937 ms. Remains : 81/81 places, 96/96 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 01:48:40] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:48:40] [INFO ] Applying decomposition
[2024-05-30 01:48:40] [INFO ] Flatten gal took : 11 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/graph3706925282262734808.txt' '-o' '/tmp/graph3706925282262734808.bin' '-w' '/tmp/graph3706925282262734808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3706925282262734808.bin' '-l' '-1' '-v' '-w' '/tmp/graph3706925282262734808.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:48:40] [INFO ] Decomposing Gal with order
[2024-05-30 01:48:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:48:40] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:48:40] [INFO ] Flatten gal took : 46 ms
[2024-05-30 01:48:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 01:48:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11923622694113569454.gal : 4 ms
[2024-05-30 01:48:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7292225504248862896.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/ReachabilityCardinality11923622694113569454.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7292225504248862896.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/ReachabilityCardinality7292225504248862896.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 35
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :35 after 163
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :163 after 607
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :543625 after 906041
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5.48516e+06 after 8.00943e+06
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,5.28131e+09,0.617421,22248,1426,80,31501,422,476,64701,64,1942,0
Total reachable state count : 5281314130
Verifying 1 reachability properties.
Invariant property ShieldRVs-PT-003B-ReachabilityFireability-2024-04 is true.
FORMULA ShieldRVs-PT-003B-ReachabilityFireability-2024-04 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
ShieldRVs-PT-003B-ReachabilityFireability-2024-04,0,0.66282,22508,1,0,31501,422,570,64701,76,1942,10012
All properties solved without resorting to model-checking.
Total runtime 35912 ms.
BK_STOP 1717033721257
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldRVs-PT-003B"
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 ShieldRVs-PT-003B, 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-171683761800751"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-003B.tgz
mv ShieldRVs-PT-003B 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 '
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 ;