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-171734920000094.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-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 43K 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-12-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-12-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717368364096

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-06-02 22:46:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:46:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:46:06] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-06-02 22:46:06] [INFO ] Transformed 172 places.
[2024-06-02 22:46:06] [INFO ] Transformed 166 transitions.
[2024-06-02 22:46:06] [INFO ] Found NUPN structural information;
[2024-06-02 22:46:06] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 58 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:46:07] [INFO ] Flatten gal took : 174 ms
[2024-06-02 22:46:07] [INFO ] Flatten gal took : 69 ms
RANDOM walk for 40000 steps (820 resets) in 3086 ms. (12 steps per ms) remains 4/14 properties
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 22:46:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5436668668233430690.gal : 31 ms
[2024-06-02 22:46:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13658318939691080277.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/ReachabilityCardinality5436668668233430690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13658318939691080277.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13658318939691080277.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 24
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :24 after 395
BEST_FIRST walk for 40004 steps (186 resets) in 986 ms. (40 steps per ms) remains 3/4 properties
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :395 after 1036
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1036 after 39561
BEST_FIRST walk for 40004 steps (159 resets) in 1425 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (202 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
// Phase 1: matrix 166 rows 172 cols
[2024-06-02 22:46:08] [INFO ] Computed 24 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MedleyA-PT-12-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-12-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 75/145 variables, 11/81 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 75/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/172 variables, 12/169 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 27/196 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/196 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 166/338 variables, 172/368 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/368 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/338 variables, 0/368 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 368 constraints, problems are : Problem set: 2 solved, 1 unsolved in 665 ms.
Refiners :[Domain max(s): 172/172 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 97/136 variables, 11/50 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 97/147 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 1/148 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-02 22:46:09] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 48 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/149 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/172 variables, 12/161 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 36/197 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-02 22:46:09] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 1/198 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/198 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 166/338 variables, 172/370 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 1/371 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 0/371 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/338 variables, 0/371 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 371 constraints, problems are : Problem set: 2 solved, 1 unsolved in 759 ms.
Refiners :[Domain max(s): 172/172 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1605ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 39 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 167 transition count 158
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 159 transition count 156
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 28 place count 158 transition count 152
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 32 place count 154 transition count 152
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 32 place count 154 transition count 135
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 66 place count 137 transition count 135
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 77 place count 126 transition count 113
Iterating global reduction 4 with 11 rules applied. Total rules applied 88 place count 126 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 88 place count 126 transition count 112
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 125 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 124 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 124 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 123 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 123 transition count 110
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 122 place count 109 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 130 place count 105 transition count 99
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 105 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 103 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 103 transition count 97
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 103 transition count 97
Applied a total of 136 rules in 111 ms. Remains 103 /172 variables (removed 69) and now considering 97/166 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 103/172 places, 97/166 transitions.
RANDOM walk for 40000 steps (1624 resets) in 420 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (347 resets) in 415 ms. (96 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2516592 steps, run timeout after 3001 ms. (steps per millisecond=838 ) properties seen :0 out of 1
Probabilistic random walk after 2516592 steps, saw 392529 distinct states, run finished after 3006 ms. (steps per millisecond=837 ) properties seen :0
// Phase 1: matrix 97 rows 103 cols
[2024-06-02 22:46:13] [INFO ] Computed 19 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/90 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/103 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 97/200 variables, 103/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 122 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/90 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:46:13] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/103 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/200 variables, 103/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 124 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 497ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 38 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 97/97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 102 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 102 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 101 transition count 95
Applied a total of 4 rules in 28 ms. Remains 101 /103 variables (removed 2) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 101/103 places, 95/97 transitions.
RANDOM walk for 40000 steps (1612 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (337 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2416345 steps, run timeout after 3001 ms. (steps per millisecond=805 ) properties seen :0 out of 1
Probabilistic random walk after 2416345 steps, saw 378467 distinct states, run finished after 3002 ms. (steps per millisecond=804 ) properties seen :0
// Phase 1: matrix 95 rows 101 cols
[2024-06-02 22:46:17] [INFO ] Computed 19 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/101 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/196 variables, 101/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 101/101 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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/88 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:46:17] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/101 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/196 variables, 101/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 122 constraints, problems are : Problem set: 0 solved, 1 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 713ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 38 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 95/95 transitions.
Applied a total of 0 rules in 22 ms. Remains 101 /101 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 101/101 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 95/95 transitions.
Applied a total of 0 rules in 21 ms. Remains 101 /101 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-06-02 22:46:18] [INFO ] Invariant cache hit.
[2024-06-02 22:46:18] [INFO ] Implicit Places using invariants in 167 ms returned [26, 60]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 178 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/101 places, 95/95 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 99 transition count 94
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 98 transition count 94
Applied a total of 2 rules in 21 ms. Remains 98 /99 variables (removed 1) and now considering 94/95 (removed 1) transitions.
// Phase 1: matrix 94 rows 98 cols
[2024-06-02 22:46:18] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 22:46:18] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:46:18] [INFO ] Invariant cache hit.
[2024-06-02 22:46:18] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/101 places, 94/95 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 531 ms. Remains : 98/101 places, 94/95 transitions.
RANDOM walk for 40000 steps (1628 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (330 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2724646 steps, run timeout after 3001 ms. (steps per millisecond=907 ) properties seen :0 out of 1
Probabilistic random walk after 2724646 steps, saw 427599 distinct states, run finished after 3001 ms. (steps per millisecond=907 ) properties seen :0
[2024-06-02 22:46:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/86 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/98 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 94/192 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 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/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/86 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/98 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 94/192 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:46:22] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 521ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 38 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-06-02 22:46:22] [INFO ] Invariant cache hit.
[2024-06-02 22:46:22] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 22:46:22] [INFO ] Invariant cache hit.
[2024-06-02 22:46:22] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-06-02 22:46:22] [INFO ] Redundant transitions in 4 ms returned []
Running 93 sub problems to find dead transitions.
[2024-06-02 22:46:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-02 22:46:24] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2024-06-02 22:46:24] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 3 ms to minimize.
[2024-06-02 22:46:24] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:46:24] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 4 ms to minimize.
[2024-06-02 22:46:24] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:46:25] [INFO ] Deduced a trap composed of 23 places in 836 ms of which 25 ms to minimize.
[2024-06-02 22:46:26] [INFO ] Deduced a trap composed of 23 places in 574 ms of which 2 ms to minimize.
[2024-06-02 22:46:26] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 1 ms to minimize.
[2024-06-02 22:46:27] [INFO ] Deduced a trap composed of 19 places in 882 ms of which 1 ms to minimize.
[2024-06-02 22:46:27] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-02 22:46:28] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 94/192 variables, 98/126 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 126 constraints, problems are : Problem set: 0 solved, 93 unsolved in 8797 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 94/192 variables, 98/126 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 93/219 constraints. Problems are: Problem set: 0 solved, 93 unsolved
[2024-06-02 22:46:33] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:46:34] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :39561 after 6.07362e+06
After SMT solving in domain Int declared 192/192 variables, and 221 constraints, problems are : Problem set: 0 solved, 93 unsolved in 6441 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 13/13 constraints]
After SMT, in 15294ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 15299ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15565 ms. Remains : 98/98 places, 94/94 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 22:46:37] [INFO ] Flatten gal took : 26 ms
[2024-06-02 22:46:37] [INFO ] Applying decomposition
[2024-06-02 22:46:37] [INFO ] Flatten gal took : 20 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/graph7108260095440701976.txt' '-o' '/tmp/graph7108260095440701976.bin' '-w' '/tmp/graph7108260095440701976.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7108260095440701976.bin' '-l' '-1' '-v' '-w' '/tmp/graph7108260095440701976.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:46:38] [INFO ] Decomposing Gal with order
[2024-06-02 22:46:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:46:38] [INFO ] Removed a total of 15 redundant transitions.
[2024-06-02 22:46:38] [INFO ] Flatten gal took : 77 ms
[2024-06-02 22:46:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-06-02 22:46:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7373410630858397268.gal : 12 ms
[2024-06-02 22:46:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11923314079119566546.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/ReachabilityCardinality7373410630858397268.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11923314079119566546.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/ReachabilityCardinality11923314079119566546.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 146
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :146 after 2066
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2066 after 2070
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2070 after 2070
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2070 after 38217
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :38217 after 4.88515e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.88515e+06 after 1.00128e+07
Invariant property MedleyA-PT-12-ReachabilityCardinality-2024-09 does not hold.
FORMULA MedleyA-PT-12-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.53631e+08,1.57241,22500,1530,537,24190,13660,461,50849,108,130566,0
Total reachable state count : 453630861

Verifying 1 reachability properties.
Invariant property MedleyA-PT-12-ReachabilityCardinality-2024-09 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-12-ReachabilityCardinality-2024-09,3696,2.46274,22760,109,37,24190,13660,640,50849,129,130566,0
All properties solved without resorting to model-checking.
Total runtime 34765 ms.

BK_STOP 1717368400809

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-12"
export BK_EXAMINATION="ReachabilityCardinality"
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-12, examination is ReachabilityCardinality"
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-171734920000094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-12.tgz
mv MedleyA-PT-12 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;