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-171640602700111.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-16b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602700111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 13 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 08:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 08:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 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 945K 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-16b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716426568130

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-16b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-23 01:09:29] [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-23 01:09:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:09:29] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-23 01:09:29] [INFO ] Transformed 3472 places.
[2024-05-23 01:09:29] [INFO ] Transformed 4001 transitions.
[2024-05-23 01:09:29] [INFO ] Found NUPN structural information;
[2024-05-23 01:09:29] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (363 resets) in 2625 ms. (15 steps per ms) remains 12/16 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 01:09:30] [INFO ] Flatten gal took : 537 ms
BEST_FIRST walk for 40004 steps (32 resets) in 1022 ms. (39 steps per ms) remains 11/12 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-23 01:09:31] [INFO ] Flatten gal took : 207 ms
BEST_FIRST walk for 40004 steps (29 resets) in 741 ms. (53 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (28 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (28 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (26 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
[2024-05-23 01:09:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2189161043774886033.gal : 143 ms
[2024-05-23 01:09:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3826998077243759719.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/ReachabilityCardinality2189161043774886033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3826998077243759719.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (29 resets) in 147 ms. (270 steps per ms) remains 11/11 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (25 resets) in 346 ms. (115 steps per ms) remains 10/11 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (28 resets) in 277 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (30 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (30 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
// Phase 1: matrix 4001 rows 3472 cols
[2024-05-23 01:09:31] [INFO ] Computed 18 invariants in 98 ms
Loading property file /tmp/ReachabilityCardinality3826998077243759719.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 3291/3472 variables, 18/199 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3472 variables, 3291/3490 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3472 variables, 0/3490 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4001/7473 variables, 3472/6962 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7473 variables, 0/6962 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/7473 variables, 0/6962 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7473/7473 variables, and 6962 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5040 ms.
Refiners :[Domain max(s): 3472/3472 constraints, Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 3472/3472 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Problem FlexibleBarrier-PT-16b-ReachabilityFireability-2024-08 is UNSAT
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 181/181 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
At refinement iteration 2 (OVERLAPS) 3291/3472 variables, 18/199 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
At refinement iteration 3 (INCLUDED_ONLY) 0/3472 variables, 3291/3490 constraints. Problems are: Problem set: 1 solved, 9 unsolved
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 56
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :56 after 1616
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :1616 after 64055
[2024-05-23 01:09:38] [INFO ] Deduced a trap composed of 28 places in 230 ms of which 21 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :64055 after 1.02466e+08
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :1.02466e+08 after 2.62312e+14
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :2.62312e+14 after 4.62005e+25
[2024-05-23 01:09:39] [INFO ] Deduced a trap composed of 1321 places in 1555 ms of which 22 ms to minimize.
[2024-05-23 01:09:41] [INFO ] Deduced a trap composed of 1243 places in 1495 ms of which 15 ms to minimize.
[2024-05-23 01:09:43] [INFO ] Deduced a trap composed of 1214 places in 1664 ms of which 17 ms to minimize.
SMT process timed out in 12034ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 166 out of 3472 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Graph (trivial) has 2384 edges and 3472 vertex of which 18 / 3472 are part of one of the 3 SCC in 17 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 582 transitions
Trivial Post-agglo rules discarded 582 transitions
Performed 582 trivial Post agglomeration. Transition count delta: 582
Iterating post reduction 0 with 582 rules applied. Total rules applied 583 place count 3457 transition count 3401
Reduce places removed 582 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 608 rules applied. Total rules applied 1191 place count 2875 transition count 3375
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 1217 place count 2849 transition count 3375
Performed 431 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 431 Pre rules applied. Total rules applied 1217 place count 2849 transition count 2944
Deduced a syphon composed of 431 places in 8 ms
Reduce places removed 431 places and 0 transitions.
Iterating global reduction 3 with 862 rules applied. Total rules applied 2079 place count 2418 transition count 2944
Discarding 1294 places :
Symmetric choice reduction at 3 with 1294 rule applications. Total rules 3373 place count 1124 transition count 1650
Iterating global reduction 3 with 1294 rules applied. Total rules applied 4667 place count 1124 transition count 1650
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4668 place count 1124 transition count 1649
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 4668 place count 1124 transition count 1644
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4678 place count 1119 transition count 1644
Discarding 165 places :
Symmetric choice reduction at 4 with 165 rule applications. Total rules 4843 place count 954 transition count 1479
Iterating global reduction 4 with 165 rules applied. Total rules applied 5008 place count 954 transition count 1479
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 5152 place count 954 transition count 1335
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 5 with 244 rules applied. Total rules applied 5396 place count 832 transition count 1213
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 5410 place count 832 transition count 1199
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 5423 place count 819 transition count 1186
Iterating global reduction 6 with 13 rules applied. Total rules applied 5436 place count 819 transition count 1186
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 5460 place count 807 transition count 1186
Free-agglomeration rule applied 87 times.
Iterating global reduction 6 with 87 rules applied. Total rules applied 5547 place count 807 transition count 1099
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 6 with 87 rules applied. Total rules applied 5634 place count 720 transition count 1099
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 5650 place count 720 transition count 1083
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 5660 place count 720 transition count 1083
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 5661 place count 719 transition count 1082
Applied a total of 5661 rules in 1153 ms. Remains 719 /3472 variables (removed 2753) and now considering 1082/4001 (removed 2919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1242 ms. Remains : 719/3472 places, 1082/4001 transitions.
RANDOM walk for 40000 steps (849 resets) in 976 ms. (40 steps per ms) remains 7/9 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (39 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (20 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
[2024-05-23 01:09:45] [INFO ] Flow matrix only has 1081 transitions (discarded 1 similar events)
// Phase 1: matrix 1081 rows 719 cols
[2024-05-23 01:09:45] [INFO ] Computed 18 invariants in 14 ms
[2024-05-23 01:09:45] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 583/717 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/717 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1797 variables, 717/734 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1797 variables, 29/763 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1797 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 3/1800 variables, 2/765 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1800 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1800 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1800 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1800/1800 variables, and 766 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 719/719 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 583/717 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 01:09:47] [INFO ] Deduced a trap composed of 307 places in 259 ms of which 4 ms to minimize.
[2024-05-23 01:09:47] [INFO ] Deduced a trap composed of 322 places in 233 ms of which 4 ms to minimize.
[2024-05-23 01:09:48] [INFO ] Deduced a trap composed of 293 places in 264 ms of which 5 ms to minimize.
[2024-05-23 01:09:48] [INFO ] Deduced a trap composed of 271 places in 270 ms of which 4 ms to minimize.
[2024-05-23 01:09:48] [INFO ] Deduced a trap composed of 290 places in 234 ms of which 3 ms to minimize.
[2024-05-23 01:09:48] [INFO ] Deduced a trap composed of 293 places in 251 ms of which 4 ms to minimize.
[2024-05-23 01:09:49] [INFO ] Deduced a trap composed of 293 places in 284 ms of which 4 ms to minimize.
[2024-05-23 01:09:49] [INFO ] Deduced a trap composed of 291 places in 246 ms of which 4 ms to minimize.
[2024-05-23 01:09:50] [INFO ] Deduced a trap composed of 300 places in 752 ms of which 4 ms to minimize.
[2024-05-23 01:09:50] [INFO ] Deduced a trap composed of 273 places in 319 ms of which 4 ms to minimize.
[2024-05-23 01:09:51] [INFO ] Deduced a trap composed of 301 places in 476 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/717 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 01:09:51] [INFO ] Deduced a trap composed of 297 places in 217 ms of which 4 ms to minimize.
[2024-05-23 01:09:51] [INFO ] Deduced a trap composed of 312 places in 258 ms of which 3 ms to minimize.
[2024-05-23 01:09:51] [INFO ] Deduced a trap composed of 294 places in 253 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/717 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 01:09:52] [INFO ] Deduced a trap composed of 311 places in 227 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1080/1797 variables, 717/749 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1797 variables, 29/778 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1797 variables, 5/783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 01:09:53] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1797 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1797 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 3/1800 variables, 2/786 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1800 variables, 1/787 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1800 variables, 2/789 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 01:09:55] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1800 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1800 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 01:09:56] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/1800 variables, 1/791 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1800 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/1800 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1800/1800 variables, and 791 constraints, problems are : Problem set: 0 solved, 7 unsolved in 11593 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 719/719 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 18/18 constraints]
After SMT, in 12974ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 1556 ms.
Support contains 50 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1082/1082 transitions.
Graph (trivial) has 255 edges and 719 vertex of which 15 / 719 are part of one of the 7 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 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 23 place count 711 transition count 1045
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 689 transition count 1045
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 45 place count 689 transition count 1039
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 683 transition count 1039
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 116 place count 624 transition count 980
Iterating global reduction 2 with 59 rules applied. Total rules applied 175 place count 624 transition count 980
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 185 place count 624 transition count 970
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 187 place count 622 transition count 968
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 622 transition count 968
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 191 place count 622 transition count 966
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 49 rules applied. Total rules applied 240 place count 597 transition count 942
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 219 edges and 597 vertex of which 26 / 597 are part of one of the 9 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 9 rules applied. Total rules applied 249 place count 580 transition count 934
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 5 with 38 rules applied. Total rules applied 287 place count 576 transition count 900
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 287 place count 576 transition count 883
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 321 place count 559 transition count 883
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 346 place count 534 transition count 858
Iterating global reduction 6 with 25 rules applied. Total rules applied 371 place count 534 transition count 858
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 396 place count 534 transition count 833
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 436 place count 514 transition count 813
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 437 place count 514 transition count 812
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 447 place count 509 transition count 812
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 457 place count 509 transition count 802
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 471 place count 509 transition count 788
Free-agglomeration rule applied 125 times with reduction of 1 identical transitions.
Iterating global reduction 9 with 125 rules applied. Total rules applied 596 place count 509 transition count 662
Reduce places removed 127 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 9 with 141 rules applied. Total rules applied 737 place count 382 transition count 648
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 741 place count 380 transition count 646
Discarding 41 places :
Symmetric choice reduction at 11 with 41 rule applications. Total rules 782 place count 339 transition count 605
Iterating global reduction 11 with 41 rules applied. Total rules applied 823 place count 339 transition count 605
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 11 with 41 rules applied. Total rules applied 864 place count 339 transition count 564
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 12 with 19 rules applied. Total rules applied 883 place count 339 transition count 545
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 884 place count 338 transition count 544
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 2 rules applied. Total rules applied 886 place count 337 transition count 543
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 888 place count 336 transition count 542
Discarding 13 places :
Symmetric choice reduction at 14 with 13 rule applications. Total rules 901 place count 323 transition count 529
Iterating global reduction 14 with 13 rules applied. Total rules applied 914 place count 323 transition count 529
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 14 with 13 rules applied. Total rules applied 927 place count 323 transition count 516
Applied a total of 927 rules in 721 ms. Remains 323 /719 variables (removed 396) and now considering 516/1082 (removed 566) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 722 ms. Remains : 323/719 places, 516/1082 transitions.
RANDOM walk for 40000 steps (1537 resets) in 517 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (70 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (43 resets) in 36 ms. (1081 steps per ms) remains 1/2 properties
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 516 rows 323 cols
[2024-05-23 01:10:01] [INFO ] Computed 14 invariants in 49 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 265/304 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 497/801 variables, 304/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/801 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/839 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/839 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/839 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/839 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 839/839 variables, and 337 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 323/323 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/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 265/304 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 01:10:01] [INFO ] Deduced a trap composed of 196 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/304 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 497/801 variables, 304/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 01:10:01] [INFO ] Deduced a trap composed of 177 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/801 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/839 variables, 19/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/839 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/839 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/839 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 839/839 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 949ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 555 steps, including 28 resets, run visited all 1 properties in 2 ms. (steps per millisecond=277 )
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 21 ms.
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 32916 ms.

BK_STOP 1716426602274

--------------------
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-16b"
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-16b, 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-171640602700111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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