fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r180-tall-171640602500015
Last Updated
July 7, 2024

About the Execution of ITS-Tools for FlexibleBarrier-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
454.096 14417.00 40744.00 98.30 TFTTFFTTTFFTFTTT 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.r180-tall-171640602500015.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 FlexibleBarrier-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602500015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 13 08:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 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 FlexibleBarrier-PT-04b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716416000152

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 22:13:21] [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-22 22:13:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:13:21] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-22 22:13:21] [INFO ] Transformed 268 places.
[2024-05-22 22:13:21] [INFO ] Transformed 305 transitions.
[2024-05-22 22:13:21] [INFO ] Found NUPN structural information;
[2024-05-22 22:13:21] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 22:13:22] [INFO ] Flatten gal took : 129 ms
[2024-05-22 22:13:22] [INFO ] Flatten gal took : 48 ms
[2024-05-22 22:13:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4132028959523463204.gal : 14 ms
[2024-05-22 22:13:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12101940458019015978.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4132028959523463204.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12101940458019015978.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (945 resets) in 1746 ms. (22 steps per ms) remains 6/16 properties
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

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/ReachabilityCardinality12101940458019015978.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :11 after 20
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :20 after 260
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :260 after 4115
BEST_FIRST walk for 40003 steps (166 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
Invariant property FlexibleBarrier-PT-04b-ReachabilityFireability-2024-10 does not hold.
Reachability property FlexibleBarrier-PT-04b-ReachabilityFireability-2024-07 is true.
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :4115 after 1.11342e+06
BEST_FIRST walk for 40004 steps (181 resets) in 637 ms. (62 steps per ms) remains 6/6 properties
Reachability property FlexibleBarrier-PT-04b-ReachabilityFireability-2024-06 is true.
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :1.11342e+06 after 1.11792e+06
BEST_FIRST walk for 40003 steps (183 resets) in 304 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (98 resets) in 207 ms. (192 steps per ms) remains 6/6 properties
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :1.11792e+06 after 1.19518e+06
BEST_FIRST walk for 40003 steps (171 resets) in 476 ms. (83 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (173 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
// Phase 1: matrix 305 rows 268 cols
[2024-05-22 22:13:22] [INFO ] Computed 6 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem FlexibleBarrier-PT-04b-ReachabilityFireability-2024-09 is UNSAT
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 149/268 variables, 6/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 149/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 305/573 variables, 268/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/573 variables, 0/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 542 constraints, problems are : Problem set: 1 solved, 5 unsolved in 896 ms.
Refiners :[Domain max(s): 268/268 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 171/268 variables, 6/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 171/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 30 ms to minimize.
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 2 ms to minimize.
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 2 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
Problem FlexibleBarrier-PT-04b-ReachabilityFireability-2024-15 is UNSAT
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 8/282 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 3/285 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 22:13:25] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 305/573 variables, 268/554 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 4/558 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/558 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/573 variables, 0/558 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 558 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2343 ms.
Refiners :[Domain max(s): 268/268 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 12/12 constraints]
After SMT, in 3397ms problems are : Problem set: 2 solved, 4 unsolved
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1093 ms.
Support contains 77 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 305/305 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 268 transition count 283
Reduce places removed 22 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 37 rules applied. Total rules applied 59 place count 246 transition count 268
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 74 place count 231 transition count 268
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 74 place count 231 transition count 256
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 98 place count 219 transition count 256
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 136 place count 181 transition count 218
Iterating global reduction 3 with 38 rules applied. Total rules applied 174 place count 181 transition count 218
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 174 place count 181 transition count 216
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 178 place count 179 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 177 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 177 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 177 transition count 213
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 219 place count 159 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 158 transition count 195
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 158 transition count 191
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 229 place count 154 transition count 191
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 154 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 153 transition count 190
Applied a total of 231 rules in 142 ms. Remains 153 /268 variables (removed 115) and now considering 190/305 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 153/268 places, 190/305 transitions.
RANDOM walk for 40000 steps (1183 resets) in 547 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (215 resets) in 125 ms. (317 steps per ms) remains 2/3 properties
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (120 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (198 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
[2024-05-22 22:13:27] [INFO ] Flow matrix only has 189 transitions (discarded 1 similar events)
// Phase 1: matrix 189 rows 153 cols
[2024-05-22 22:13:27] [INFO ] Computed 6 invariants in 2 ms
[2024-05-22 22:13:27] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 93/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 189/342 variables, 153/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/342 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 153/153 constraints, ReadFeed: 1/1 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/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 93/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 22:13:28] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-22 22:13:28] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 189/342 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 22:13:28] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :1.19518e+06 after 1.44112e+06
At refinement iteration 8 (OVERLAPS) 0/342 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/342 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 165 constraints, problems are : Problem set: 0 solved, 2 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 153/153 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 816ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 318 ms.
Support contains 60 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 190/190 transitions.
Graph (trivial) has 22 edges and 153 vertex of which 5 / 153 are part of one of the 1 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 place count 149 transition count 183
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 147 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 146 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 146 transition count 181
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 145 transition count 181
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 12 place count 142 transition count 178
Iterating global reduction 3 with 3 rules applied. Total rules applied 15 place count 142 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 141 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 141 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 141 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 32 place count 134 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 133 transition count 168
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 37 place count 133 transition count 165
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 40 place count 130 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 41 place count 130 transition count 164
Applied a total of 41 rules in 45 ms. Remains 130 /153 variables (removed 23) and now considering 164/190 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 130/153 places, 164/190 transitions.
RANDOM walk for 40000 steps (1366 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (133 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (242 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1914472 steps, run timeout after 3001 ms. (steps per millisecond=637 ) properties seen :1 out of 2
Probabilistic random walk after 1914472 steps, saw 473693 distinct states, run finished after 3004 ms. (steps per millisecond=637 ) properties seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-22 22:13:32] [INFO ] Flow matrix only has 163 transitions (discarded 1 similar events)
// Phase 1: matrix 163 rows 130 cols
[2024-05-22 22:13:32] [INFO ] Computed 6 invariants in 2 ms
[2024-05-22 22:13:32] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/130 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 163/293 variables, 130/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 130/130 constraints, ReadFeed: 6/6 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 22:13:32] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 21/130 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 22:13:32] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-22 22:13:32] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 163/293 variables, 130/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 130/130 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 414ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 17 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 164/164 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 130 transition count 150
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 116 transition count 150
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 28 place count 116 transition count 146
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 112 transition count 146
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 49 place count 99 transition count 133
Iterating global reduction 2 with 13 rules applied. Total rules applied 62 place count 99 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 99 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 98 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 98 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 98 transition count 130
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 96 place count 83 transition count 115
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 81 transition count 119
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 110 place count 81 transition count 109
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 121 place count 71 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 125 place count 71 transition count 104
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 71 transition count 104
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 70 transition count 103
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 70 transition count 103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 68 transition count 101
Applied a total of 130 rules in 24 ms. Remains 68 /130 variables (removed 62) and now considering 101/164 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 68/130 places, 101/164 transitions.
RANDOM walk for 40000 steps (976 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (78 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Invariant property FlexibleBarrier-PT-04b-ReachabilityFireability-2024-05 does not hold.
Reachability property FlexibleBarrier-PT-04b-ReachabilityFireability-2024-00 is true.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :1.44112e+06 after 1.72444e+06
Finished probabilistic random walk after 2219669 steps, run visited all 1 properties in 1934 ms. (steps per millisecond=1147 )
Probabilistic random walk after 2219669 steps, saw 526031 distinct states, run finished after 1937 ms. (steps per millisecond=1145 ) properties seen :1
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 13243 ms.

BK_STOP 1716416014569

--------------------
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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, 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 r180-tall-171640602500015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b 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 ;