fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r576-smll-171734920200167
Last Updated
July 7, 2024

About the Execution of ITS-Tools for MedleyA-PT-21

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
803.296 1850424.00 1943963.00 6249.40 FFTTFTFTTFTTTTFT 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.r576-smll-171734920200167.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 MedleyA-PT-21, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920200167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 70K Jun 2 16:33 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 MedleyA-PT-21-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-21-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717394258586

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-03 05:57:40] [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-06-03 05:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 05:57:41] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2024-06-03 05:57:41] [INFO ] Transformed 306 places.
[2024-06-03 05:57:41] [INFO ] Transformed 298 transitions.
[2024-06-03 05:57:41] [INFO ] Found NUPN structural information;
[2024-06-03 05:57:41] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 529 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
[2024-06-03 05:57:42] [INFO ] Flatten gal took : 214 ms
[2024-06-03 05:57:42] [INFO ] Flatten gal took : 53 ms
[2024-06-03 05:57:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7572287446242142670.gal : 43 ms
RANDOM walk for 40000 steps (8 resets) in 3613 ms. (11 steps per ms) remains 6/16 properties
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-03 05:57:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2379104235868363324.prop : 3 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/ReachabilityCardinality7572287446242142670.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2379104235868363324.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 ...328
Loading property file /tmp/ReachabilityCardinality2379104235868363324.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :14 after 88
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :88 after 836
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :836 after 10622
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :10622 after 515134
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :515134 after 1.47012e+09
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 4/6 properties
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 367 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 676 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
// Phase 1: matrix 298 rows 306 cols
[2024-06-03 05:57:43] [INFO ] Computed 20 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 219/306 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 219/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 298/604 variables, 306/632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/604 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 632 constraints, problems are : Problem set: 0 solved, 4 unsolved in 787 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 306/306 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/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MedleyA-PT-21-ReachabilityFireability-2024-10 is UNSAT
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 219/306 variables, 20/107 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 219/326 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-03 05:57:44] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 13 ms to minimize.
[2024-06-03 05:57:44] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
Problem MedleyA-PT-21-ReachabilityFireability-2024-01 is UNSAT
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-03 05:57:44] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 3 ms to minimize.
[2024-06-03 05:57:45] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-06-03 05:57:45] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 5/331 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 298/604 variables, 306/637 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 2/639 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-03 05:57:45] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 1 ms to minimize.
[2024-06-03 05:57:45] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 3 ms to minimize.
[2024-06-03 05:57:46] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 3/642 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 0/642 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/604 variables, 0/642 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 642 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2136 ms.
Refiners :[Domain max(s): 306/306 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 8/8 constraints]
After SMT, in 3098ms problems are : Problem set: 2 solved, 2 unsolved
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 145 ms.
Support contains 51 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 298/298 transitions.
Graph (trivial) has 154 edges and 306 vertex of which 6 / 306 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 301 transition count 236
Reduce places removed 56 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 66 rules applied. Total rules applied 123 place count 245 transition count 226
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 133 place count 235 transition count 226
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 133 place count 235 transition count 193
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 199 place count 202 transition count 193
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 227 place count 174 transition count 165
Iterating global reduction 3 with 28 rules applied. Total rules applied 255 place count 174 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 255 place count 174 transition count 164
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 173 transition count 164
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 311 place count 146 transition count 137
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -13
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 319 place count 142 transition count 150
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 323 place count 142 transition count 146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 327 place count 138 transition count 146
Applied a total of 327 rules in 131 ms. Remains 138 /306 variables (removed 168) and now considering 146/298 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 138/306 places, 146/298 transitions.
RANDOM walk for 40000 steps (8 resets) in 523 ms. (76 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1477420 steps, run timeout after 3001 ms. (steps per millisecond=492 ) properties seen :0 out of 1
Probabilistic random walk after 1477420 steps, saw 232293 distinct states, run finished after 3006 ms. (steps per millisecond=491 ) properties seen :0
// Phase 1: matrix 146 rows 138 cols
[2024-06-03 05:57:50] [INFO ] Computed 20 invariants in 4 ms
[2024-06-03 05:57:50] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/138 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/284 variables, 138/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/284 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 138/138 constraints, ReadFeed: 9/9 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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/138 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 05:57:50] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-03 05:57:50] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 146/284 variables, 138/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 05:57:50] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/284 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 138/138 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 51 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 146/146 transitions.
Applied a total of 0 rules in 8 ms. Remains 138 /138 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 138/138 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 146/146 transitions.
Applied a total of 0 rules in 9 ms. Remains 138 /138 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2024-06-03 05:57:50] [INFO ] Invariant cache hit.
[2024-06-03 05:57:50] [INFO ] Implicit Places using invariants in 87 ms returned [129]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 137/138 places, 146/146 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 137 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 135 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 135 transition count 143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 134 transition count 143
Applied a total of 6 rules in 13 ms. Remains 134 /137 variables (removed 3) and now considering 143/146 (removed 3) transitions.
// Phase 1: matrix 143 rows 134 cols
[2024-06-03 05:57:50] [INFO ] Computed 19 invariants in 1 ms
[2024-06-03 05:57:51] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-03 05:57:51] [INFO ] Invariant cache hit.
[2024-06-03 05:57:51] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-03 05:57:51] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 134/138 places, 143/146 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 438 ms. Remains : 134/138 places, 143/146 transitions.
RANDOM walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1758634 steps, run timeout after 3001 ms. (steps per millisecond=586 ) properties seen :0 out of 1
Probabilistic random walk after 1758634 steps, saw 283409 distinct states, run finished after 3001 ms. (steps per millisecond=586 ) properties seen :0
[2024-06-03 05:57:54] [INFO ] Invariant cache hit.
[2024-06-03 05:57:54] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/134 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/277 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/277 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 134/134 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/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/134 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 05:57:54] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-03 05:57:54] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 143/277 variables, 134/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 134/134 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 51 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 143/143 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 134/134 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 143/143 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-06-03 05:57:55] [INFO ] Invariant cache hit.
[2024-06-03 05:57:55] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-03 05:57:55] [INFO ] Invariant cache hit.
[2024-06-03 05:57:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-03 05:57:55] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-03 05:57:55] [INFO ] Redundant transitions in 6 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-03 05:57:55] [INFO ] Invariant cache hit.
[2024-06-03 05:57:55] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-03 05:57:56] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-03 05:57:56] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-03 05:57:56] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-03 05:57:56] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-03 05:57:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-03 05:57:57] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-03 05:57:57] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-03 05:57:57] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-03 05:57:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-03 05:57:57] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 2 ms to minimize.
[2024-06-03 05:57:57] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-03 05:57:58] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/277 variables, 134/165 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 171 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6109 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 134/134 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/277 variables, 134/165 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 142/313 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-03 05:58:04] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 314 constraints, problems are : Problem set: 0 solved, 142 unsolved in 9005 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 134/134 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 13/13 constraints]
After SMT, in 15182ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 15189ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15524 ms. Remains : 134/134 places, 143/143 transitions.
Attempting over-approximation, by ignoring read arcs.
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 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 142
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 142
Applied a total of 5 rules in 38 ms. Remains 133 /134 variables (removed 1) and now considering 142/143 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 142 rows 133 cols
[2024-06-03 05:58:10] [INFO ] Computed 19 invariants in 2 ms
[2024-06-03 05:58:10] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-03 05:58:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2024-06-03 05:58:11] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-03 05:58:11] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-03 05:58:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
TRAPS : Iteration 1
[2024-06-03 05:58:12] [INFO ] Deduced a trap composed of 10 places in 713 ms of which 1 ms to minimize.
[2024-06-03 05:58:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 742 ms
TRAPS : Iteration 2
[2024-06-03 05:58:12] [INFO ] After 1261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-03 05:58:12] [INFO ] After 1487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-06-03 05:58:12] [INFO ] Flatten gal took : 35 ms
[2024-06-03 05:58:12] [INFO ] Flatten gal took : 16 ms
[2024-06-03 05:58:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5435483720575157105.gal : 6 ms
[2024-06-03 05:58:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2254151248792574413.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/ReachabilityCardinality5435483720575157105.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2254151248792574413.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 ...328
Loading property file /tmp/ReachabilityCardinality2254151248792574413.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 169
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :169 after 1029
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1029 after 1526
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1526 after 463482
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :463482 after 1.9594e+09
Detected timeout of ITS tools.
[2024-06-03 05:58:27] [INFO ] Flatten gal took : 13 ms
[2024-06-03 05:58:27] [INFO ] Applying decomposition
[2024-06-03 05:58:27] [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/graph11079872379783125108.txt' '-o' '/tmp/graph11079872379783125108.bin' '-w' '/tmp/graph11079872379783125108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11079872379783125108.bin' '-l' '-1' '-v' '-w' '/tmp/graph11079872379783125108.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:58:27] [INFO ] Decomposing Gal with order
[2024-06-03 05:58:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:58:27] [INFO ] Removed a total of 45 redundant transitions.
[2024-06-03 05:58:27] [INFO ] Flatten gal took : 69 ms
[2024-06-03 05:58:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 12 ms.
[2024-06-03 05:58:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17352822063681357768.gal : 5 ms
[2024-06-03 05:58:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11138971044867180866.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/ReachabilityCardinality17352822063681357768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11138971044867180866.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11138971044867180866.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :27 after 123
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :123 after 25419
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :25419 after 476403
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :476403 after 1.05391e+09
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.59243e+13,0.244865,10568,457,147,13028,888,518,25507,136,3615,0
Total reachable state count : 15924337751267

Verifying 1 reachability properties.
Invariant property MedleyA-PT-21-ReachabilityFireability-2024-06 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-21-ReachabilityFireability-2024-06,1.19111e+07,0.268231,10828,168,87,13028,888,590,25507,146,3615,4241
Over-approximation ignoring read arcs solved 0 properties in 17428 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-03 05:58:28] [INFO ] Flatten gal took : 18 ms
[2024-06-03 05:58:28] [INFO ] Applying decomposition
[2024-06-03 05:58:28] [INFO ] Flatten gal took : 18 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/graph8488440125991844898.txt' '-o' '/tmp/graph8488440125991844898.bin' '-w' '/tmp/graph8488440125991844898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8488440125991844898.bin' '-l' '-1' '-v' '-w' '/tmp/graph8488440125991844898.weights' '-q' '0' '-e' '0.001'
[2024-06-03 05:58:28] [INFO ] Decomposing Gal with order
[2024-06-03 05:58:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 05:58:28] [INFO ] Removed a total of 41 redundant transitions.
[2024-06-03 05:58:28] [INFO ] Flatten gal took : 37 ms
[2024-06-03 05:58:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-06-03 05:58:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5418338502498080715.gal : 10 ms
[2024-06-03 05:58:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13001838845379086067.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/ReachabilityCardinality5418338502498080715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13001838845379086067.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/ReachabilityCardinality13001838845379086067.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 37
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :37 after 17561
Detected timeout of ITS tools.
[2024-06-03 06:28:28] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
[2024-06-03 06:28:28] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin11515154280408399844
[2024-06-03 06:28:28] [INFO ] Flatten gal took : 7 ms
[2024-06-03 06:28:28] [INFO ] Computing symmetric may disable matrix : 143 transitions.
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/graph12835468823914411209.txt' '-o' '/tmp/graph12835468823914411209.bin' '-w' '/tmp/graph12835468823914411209.weights'
[2024-06-03 06:28:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 06:28:28] [INFO ] Computing symmetric may enable matrix : 143 transitions.
[2024-06-03 06:28:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12835468823914411209.bin' '-l' '-1' '-v' '-w' '/tmp/graph12835468823914411209.weights' '-q' '0' '-e' '0.001'
[2024-06-03 06:28:28] [INFO ] Decomposing Gal with order
[2024-06-03 06:28:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 06:28:28] [INFO ] Computing Do-Not-Accords matrix : 143 transitions.
[2024-06-03 06:28:28] [INFO ] Removed a total of 48 redundant transitions.
[2024-06-03 06:28:28] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-03 06:28:28] [INFO ] Flatten gal took : 21 ms
[2024-06-03 06:28:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 5 ms.
[2024-06-03 06:28:28] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14813049811898424831.gal : 3 ms
[2024-06-03 06:28:28] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9711545304842601074.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability14813049811898424831.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9711545304842601074.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/ReachabilityFireability9711545304842601074.prop.
[2024-06-03 06:28:28] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11515154280408399844
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 75
Running compilation step : cd /tmp/ltsmin11515154280408399844;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :75 after 25011
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :25011 after 5.39616e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5.39616e+07 after 1.5694e+10
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.47467e+13,0.381124,12440,459,161,18366,1334,534,24085,139,5026,0
Total reachable state count : 14746676271075

Verifying 1 reachability properties.
Invariant property MedleyA-PT-21-ReachabilityFireability-2024-06 does not hold.
FORMULA MedleyA-PT-21-ReachabilityFireability-2024-06 FALSE 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
MedleyA-PT-21-ReachabilityFireability-2024-06,6.61728e+06,0.405081,12704,153,96,18366,1334,619,24085,151,5026,3613
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1848034 ms.

BK_STOP 1717396109010

--------------------
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="MedleyA-PT-21"
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 MedleyA-PT-21, 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 r576-smll-171734920200167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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