Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r308-tajo-171654461400227.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PolyORBNT-COL-S05J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r308-tajo-171654461400227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 8.0K Apr 12 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 09:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 12 09:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 09:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 09:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 09:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 92K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717190985705

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J20
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202304061127
[2024-05-31 21:29:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 21:29:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:29:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 21:29:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 21:29:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 568 ms
[2024-05-31 21:29:48] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 33 ms.
[2024-05-31 21:29:48] [INFO ] Unfolded HLPN to a Petri net with 369 places and 1230 transitions 8864 arcs in 49 ms.
[2024-05-31 21:29:48] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2024-05-31 21:29:48] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-31 21:29:48] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-31 21:29:48] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
[2024-05-31 21:29:49] [INFO ] Flatten gal took : 207 ms
[2024-05-31 21:29:49] [INFO ] Flatten gal took : 65 ms
[2024-05-31 21:29:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13359695710180121696.gal : 46 ms
[2024-05-31 21:29:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4265374378540316599.prop : 6 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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13359695710180121696.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4265374378540316599.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4265374378540316599.prop.
Incomplete random walk after 10000 steps, including 667 resets, run finished after 730 ms. (steps per millisecond=13 ) properties (out of 36) seen :29
Incomplete Best-First random walk after 10000 steps, including 175 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Reachability property qltransition_31 is true.
SDD proceeding with computation,35 properties remain. new max is 2
SDD size :1 after 2
Reachability property qltransition_32 is true.
SDD proceeding with computation,34 properties remain. new max is 2
SDD size :2 after 3
SDD proceeding with computation,34 properties remain. new max is 4
SDD size :3 after 6
Reachability property qltransition_35 is true.
Reachability property qltransition_27 is true.
Reachability property qltransition_16 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :6 after 12
Reachability property qltransition_20 is true.
SDD proceeding with computation,29 properties remain. new max is 4
SDD size :12 after 13
Reachability property qltransition_21 is true.
Reachability property qltransition_6 is true.
SDD proceeding with computation,27 properties remain. new max is 4
SDD size :13 after 15
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
SDD proceeding with computation,27 properties remain. new max is 8
SDD size :15 after 16
Reachability property qltransition_25 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,23 properties remain. new max is 8
SDD size :16 after 23
Reachability property qltransition_36 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_9 is true.
Reachability property qltransition_8 is true.
SDD proceeding with computation,19 properties remain. new max is 8
SDD size :23 after 28
Reachability property qltransition_30 is true.
SDD proceeding with computation,18 properties remain. new max is 8
SDD size :28 after 29
SDD proceeding with computation,18 properties remain. new max is 16
SDD size :29 after 37
SDD proceeding with computation,18 properties remain. new max is 32
SDD size :37 after 38
SDD proceeding with computation,18 properties remain. new max is 64
SDD size :38 after 47
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Reachability property qltransition_34 is true.
Reachability property qltransition_28 is true.
Reachability property qltransition_3 is true.
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :47 after 54
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :3
Reachability property qltransition_33 is true.
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :54 after 59
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :59 after 71
Running SMT prover for 4 properties.
[2024-05-31 21:29:50] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :71 after 87
[2024-05-31 21:29:50] [INFO ] Computed 62 invariants in 60 ms
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :87 after 116
[2024-05-31 21:29:50] [INFO ] [Real]Absence check using 55 positive place invariants in 46 ms returned sat
[2024-05-31 21:29:50] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
Reachability property qltransition_24 is true.
Reachability property qltransition_19 is true.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :116 after 282
[2024-05-31 21:29:50] [INFO ] After 344ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-31 21:29:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:29:51] [INFO ] After 45ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:3
[2024-05-31 21:29:51] [INFO ] After 122ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-31 21:29:51] [INFO ] After 920ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
Reachability property qltransition_13 is true.
Reachability property qltransition_4 is true.
[2024-05-31 21:29:51] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :282 after 516
[2024-05-31 21:29:51] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 25 ms returned sat
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :516 after 757
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :757 after 1178
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :1178 after 2112
[2024-05-31 21:29:54] [INFO ] After 2739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-31 21:29:54] [INFO ] After 529ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-31 21:29:55] [INFO ] After 1264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 744 ms.
[2024-05-31 21:29:56] [INFO ] After 4962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 232 ms.
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 292 transition count 503
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 292 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 290 transition count 501
Applied a total of 113 rules in 223 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
[2024-05-31 21:29:56] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2024-05-31 21:29:56] [INFO ] Computed 57 invariants in 45 ms
[2024-05-31 21:29:56] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 290/349 places, 406/555 transitions.
Applied a total of 0 rules in 20 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 597 ms. Remains : 290/349 places, 406/555 transitions.
Reachability property qltransition_23 is true.
Reachability property qltransition_18 is true.
Reachability property qltransition_12 is true.
Reachability property qltransition_0 is true.
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2112 after 7381
Incomplete random walk after 1000000 steps, including 52050 resets, run finished after 3164 ms. (steps per millisecond=316 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7205 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 1) seen :0
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :7381 after 14512
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :14512 after 37251
Interrupted probabilistic random walk after 3459405 steps, run timeout after 12001 ms. (steps per millisecond=288 ) properties seen :{}
Probabilistic random walk after 3459405 steps, saw 1000596 distinct states, run finished after 12003 ms. (steps per millisecond=288 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:30:13] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2024-05-31 21:30:13] [INFO ] Computed 57 invariants in 17 ms
[2024-05-31 21:30:13] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2024-05-31 21:30:13] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 21:30:13] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:30:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 23 ms returned sat
[2024-05-31 21:30:13] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 21:30:13] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:30:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:30:13] [INFO ] After 60ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:30:13] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 1 ms to minimize.
[2024-05-31 21:30:14] [INFO ] Deduced a trap composed of 89 places in 170 ms of which 1 ms to minimize.
[2024-05-31 21:30:14] [INFO ] Deduced a trap composed of 98 places in 171 ms of which 1 ms to minimize.
[2024-05-31 21:30:14] [INFO ] Deduced a trap composed of 87 places in 175 ms of which 1 ms to minimize.
[2024-05-31 21:30:14] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 1 ms to minimize.
[2024-05-31 21:30:14] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 1 ms to minimize.
[2024-05-31 21:30:14] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 0 ms to minimize.
[2024-05-31 21:30:15] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 1 ms to minimize.
[2024-05-31 21:30:15] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 1 ms to minimize.
[2024-05-31 21:30:15] [INFO ] Deduced a trap composed of 89 places in 191 ms of which 0 ms to minimize.
[2024-05-31 21:30:15] [INFO ] Deduced a trap composed of 92 places in 189 ms of which 0 ms to minimize.
[2024-05-31 21:30:15] [INFO ] Deduced a trap composed of 86 places in 233 ms of which 0 ms to minimize.
[2024-05-31 21:30:16] [INFO ] Deduced a trap composed of 83 places in 186 ms of which 0 ms to minimize.
[2024-05-31 21:30:16] [INFO ] Deduced a trap composed of 89 places in 221 ms of which 1 ms to minimize.
[2024-05-31 21:30:16] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 1 ms to minimize.
[2024-05-31 21:30:16] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 1 ms to minimize.
[2024-05-31 21:30:17] [INFO ] Deduced a trap composed of 107 places in 176 ms of which 1 ms to minimize.
[2024-05-31 21:30:17] [INFO ] Deduced a trap composed of 89 places in 244 ms of which 1 ms to minimize.
[2024-05-31 21:30:17] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 1 ms to minimize.
[2024-05-31 21:30:17] [INFO ] Deduced a trap composed of 105 places in 176 ms of which 1 ms to minimize.
[2024-05-31 21:30:17] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 1 ms to minimize.
[2024-05-31 21:30:18] [INFO ] Deduced a trap composed of 89 places in 204 ms of which 1 ms to minimize.
[2024-05-31 21:30:18] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 0 ms to minimize.
[2024-05-31 21:30:18] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 1 ms to minimize.
[2024-05-31 21:30:18] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 0 ms to minimize.
[2024-05-31 21:30:19] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 1 ms to minimize.
[2024-05-31 21:30:20] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 0 ms to minimize.
[2024-05-31 21:30:20] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 1 ms to minimize.
[2024-05-31 21:30:21] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 1 ms to minimize.
[2024-05-31 21:30:21] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 0 ms to minimize.
[2024-05-31 21:30:25] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :37251 after 105413
[2024-05-31 21:30:28] [INFO ] Deduced a trap composed of 80 places in 187 ms of which 5 ms to minimize.
[2024-05-31 21:30:28] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 0 ms to minimize.
[2024-05-31 21:30:28] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 0 ms to minimize.
[2024-05-31 21:30:29] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 1 ms to minimize.
[2024-05-31 21:30:29] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 0 ms to minimize.
[2024-05-31 21:30:29] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 1 ms to minimize.
[2024-05-31 21:30:29] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 1 ms to minimize.
[2024-05-31 21:30:29] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 1 ms to minimize.
[2024-05-31 21:30:30] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 1 ms to minimize.
[2024-05-31 21:30:30] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-31 21:30:30] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 1 ms to minimize.
[2024-05-31 21:30:32] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 0 ms to minimize.
[2024-05-31 21:30:32] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 0 ms to minimize.
[2024-05-31 21:30:33] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 1 ms to minimize.
[2024-05-31 21:30:33] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 0 ms to minimize.
[2024-05-31 21:30:38] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 1 ms to minimize.
[2024-05-31 21:30:39] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 0 ms to minimize.
[2024-05-31 21:30:40] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-31 21:30:42] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 0 ms to minimize.
[2024-05-31 21:30:45] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 1 ms to minimize.
[2024-05-31 21:30:46] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 0 ms to minimize.
[2024-05-31 21:30:47] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 1 ms to minimize.
[2024-05-31 21:30:47] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 12 ms to minimize.
[2024-05-31 21:30:48] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 1 ms to minimize.
Reachability property qltransition_37 is true.
Reachability property qltransition_2 is true.
Reachability property qltransition_1 is true.
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :105413 after 132467
[2024-05-31 21:30:55] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 0 ms to minimize.
[2024-05-31 21:30:56] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 0 ms to minimize.
[2024-05-31 21:30:57] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 1 ms to minimize.
[2024-05-31 21:30:57] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 1 ms to minimize.
[2024-05-31 21:31:01] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 0 ms to minimize.
[2024-05-31 21:31:04] [INFO ] Deduced a trap composed of 92 places in 211 ms of which 0 ms to minimize.
[2024-05-31 21:31:05] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-31 21:31:09] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 1 ms to minimize.
[2024-05-31 21:31:18] [INFO ] Trap strengthening (SAT) tested/added 63/63 trap constraints in 64896 ms
[2024-05-31 21:31:18] [INFO ] After 65070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:31:18] [INFO ] After 65428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 47 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 22 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-05-31 21:31:18] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:31:18] [INFO ] Invariant cache hit.
[2024-05-31 21:31:34] [INFO ] Implicit Places using invariants in 15245 ms returned []
[2024-05-31 21:31:34] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:31:34] [INFO ] Invariant cache hit.
[2024-05-31 21:31:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:31:35] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 16488 ms to find 0 implicit places.
[2024-05-31 21:31:35] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-31 21:31:35] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:31:35] [INFO ] Invariant cache hit.
[2024-05-31 21:31:35] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16899 ms. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5228 resets, run finished after 667 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:31:36] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:31:36] [INFO ] Invariant cache hit.
[2024-05-31 21:31:36] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2024-05-31 21:31:36] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 21:31:36] [INFO ] After 145ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:31:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:31:36] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:31:36] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:31:36] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:31:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-05-31 21:31:36] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 21:31:36] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:31:37] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:31:43] [INFO ] Deduced a trap composed of 86 places in 6282 ms of which 28 ms to minimize.
[2024-05-31 21:31:43] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 13 ms to minimize.
[2024-05-31 21:31:43] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 0 ms to minimize.
[2024-05-31 21:31:43] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 1 ms to minimize.
[2024-05-31 21:31:44] [INFO ] Deduced a trap composed of 95 places in 172 ms of which 0 ms to minimize.
[2024-05-31 21:31:44] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 0 ms to minimize.
[2024-05-31 21:31:44] [INFO ] Deduced a trap composed of 86 places in 169 ms of which 0 ms to minimize.
[2024-05-31 21:31:44] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 0 ms to minimize.
[2024-05-31 21:31:44] [INFO ] Deduced a trap composed of 95 places in 178 ms of which 16 ms to minimize.
[2024-05-31 21:31:44] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 1 ms to minimize.
[2024-05-31 21:31:45] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 0 ms to minimize.
[2024-05-31 21:31:45] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 1 ms to minimize.
[2024-05-31 21:31:45] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 0 ms to minimize.
[2024-05-31 21:31:45] [INFO ] Deduced a trap composed of 98 places in 226 ms of which 2 ms to minimize.
[2024-05-31 21:31:45] [INFO ] Deduced a trap composed of 92 places in 197 ms of which 2 ms to minimize.
[2024-05-31 21:31:46] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 1 ms to minimize.
[2024-05-31 21:31:46] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 1 ms to minimize.
Reachability property qltransition_22 is true.
[2024-05-31 21:31:46] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 1 ms to minimize.
[2024-05-31 21:31:46] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 1 ms to minimize.
Reachability property qltransition_17 is true.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :132467 after 471991
[2024-05-31 21:31:52] [INFO ] Deduced a trap composed of 98 places in 6220 ms of which 26 ms to minimize.
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 0 ms to minimize.
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 1 ms to minimize.
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 1 ms to minimize.
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 0 ms to minimize.
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 0 ms to minimize.
[2024-05-31 21:31:54] [INFO ] Deduced a trap composed of 104 places in 226 ms of which 1 ms to minimize.
[2024-05-31 21:31:54] [INFO ] Deduced a trap composed of 104 places in 242 ms of which 0 ms to minimize.
[2024-05-31 21:31:54] [INFO ] Deduced a trap composed of 95 places in 174 ms of which 1 ms to minimize.
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 95 places in 181 ms of which 1 ms to minimize.
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 0 ms to minimize.
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 0 ms to minimize.
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 0 ms to minimize.
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 0 ms to minimize.
[2024-05-31 21:31:56] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 1 ms to minimize.
[2024-05-31 21:31:56] [INFO ] Deduced a trap composed of 98 places in 175 ms of which 0 ms to minimize.
[2024-05-31 21:31:56] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 0 ms to minimize.
[2024-05-31 21:31:56] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 1 ms to minimize.
[2024-05-31 21:31:56] [INFO ] Deduced a trap composed of 92 places in 189 ms of which 0 ms to minimize.
[2024-05-31 21:31:57] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 1 ms to minimize.
[2024-05-31 21:31:57] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 1 ms to minimize.
[2024-05-31 21:31:57] [INFO ] Deduced a trap composed of 92 places in 230 ms of which 1 ms to minimize.
[2024-05-31 21:31:58] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 0 ms to minimize.
[2024-05-31 21:31:58] [INFO ] Deduced a trap composed of 92 places in 212 ms of which 1 ms to minimize.
[2024-05-31 21:31:58] [INFO ] Deduced a trap composed of 92 places in 180 ms of which 1 ms to minimize.
[2024-05-31 21:32:07] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 30952 ms
[2024-05-31 21:32:08] [INFO ] After 31094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:32:08] [INFO ] After 31306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 51857 resets, run finished after 3476 ms. (steps per millisecond=287 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7181 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3480414 steps, run timeout after 12001 ms. (steps per millisecond=290 ) properties seen :{}
Probabilistic random walk after 3480414 steps, saw 1006879 distinct states, run finished after 12001 ms. (steps per millisecond=290 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:32:24] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:32:24] [INFO ] Invariant cache hit.
[2024-05-31 21:32:24] [INFO ] [Real]Absence check using 50 positive place invariants in 21 ms returned sat
[2024-05-31 21:32:24] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 21:32:24] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:32:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2024-05-31 21:32:24] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 21:32:24] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:32:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:32:24] [INFO ] After 92ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:32:25] [INFO ] Deduced a trap composed of 86 places in 195 ms of which 1 ms to minimize.
[2024-05-31 21:32:25] [INFO ] Deduced a trap composed of 89 places in 186 ms of which 0 ms to minimize.
[2024-05-31 21:32:25] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 1 ms to minimize.
[2024-05-31 21:32:25] [INFO ] Deduced a trap composed of 86 places in 190 ms of which 1 ms to minimize.
[2024-05-31 21:32:26] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 0 ms to minimize.
[2024-05-31 21:32:26] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 1 ms to minimize.
[2024-05-31 21:32:26] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 0 ms to minimize.
[2024-05-31 21:32:26] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 1 ms to minimize.
[2024-05-31 21:32:26] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 0 ms to minimize.
[2024-05-31 21:32:26] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 1 ms to minimize.
[2024-05-31 21:32:27] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 0 ms to minimize.
[2024-05-31 21:32:27] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 1 ms to minimize.
[2024-05-31 21:32:27] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 1 ms to minimize.
[2024-05-31 21:32:27] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 1 ms to minimize.
[2024-05-31 21:32:27] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 0 ms to minimize.
[2024-05-31 21:32:27] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 1 ms to minimize.
[2024-05-31 21:32:28] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 1 ms to minimize.
[2024-05-31 21:32:28] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 1 ms to minimize.
[2024-05-31 21:32:28] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 1 ms to minimize.
[2024-05-31 21:32:28] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 1 ms to minimize.
[2024-05-31 21:32:28] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 0 ms to minimize.
[2024-05-31 21:32:29] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 0 ms to minimize.
[2024-05-31 21:32:29] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 0 ms to minimize.
[2024-05-31 21:32:29] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 1 ms to minimize.
[2024-05-31 21:32:29] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 0 ms to minimize.
[2024-05-31 21:32:29] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 0 ms to minimize.
[2024-05-31 21:32:30] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 0 ms to minimize.
[2024-05-31 21:32:30] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 0 ms to minimize.
[2024-05-31 21:32:30] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 0 ms to minimize.
[2024-05-31 21:32:30] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 1 ms to minimize.
[2024-05-31 21:32:30] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 1 ms to minimize.
[2024-05-31 21:32:31] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 0 ms to minimize.
[2024-05-31 21:32:31] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 2 ms to minimize.
[2024-05-31 21:32:31] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 0 ms to minimize.
[2024-05-31 21:32:31] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 0 ms to minimize.
[2024-05-31 21:32:31] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 0 ms to minimize.
[2024-05-31 21:32:32] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-05-31 21:32:32] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 1 ms to minimize.
[2024-05-31 21:32:32] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 0 ms to minimize.
[2024-05-31 21:32:32] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 1 ms to minimize.
[2024-05-31 21:32:32] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 1 ms to minimize.
[2024-05-31 21:32:33] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 1 ms to minimize.
[2024-05-31 21:32:33] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 0 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 65536
[2024-05-31 21:32:33] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 0 ms to minimize.
SDD size :471991 after 764293
[2024-05-31 21:32:42] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 17928 ms
[2024-05-31 21:32:42] [INFO ] After 18124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:32:43] [INFO ] After 18479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 30 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 18 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-05-31 21:32:43] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:32:43] [INFO ] Invariant cache hit.
[2024-05-31 21:32:44] [INFO ] Implicit Places using invariants in 1890 ms returned []
[2024-05-31 21:32:44] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:32:44] [INFO ] Invariant cache hit.
[2024-05-31 21:32:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:32:45] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 2691 ms to find 0 implicit places.
[2024-05-31 21:32:45] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-31 21:32:45] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:32:45] [INFO ] Invariant cache hit.
[2024-05-31 21:32:45] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2935 ms. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5205 resets, run finished after 318 ms. (steps per millisecond=314 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:32:46] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:32:46] [INFO ] Invariant cache hit.
[2024-05-31 21:32:46] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-05-31 21:32:46] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 21:32:46] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:32:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:32:46] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:32:46] [INFO ] After 41ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:32:46] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:32:46] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-05-31 21:32:46] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 21:32:46] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:32:46] [INFO ] After 45ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:32:46] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 1 ms to minimize.
[2024-05-31 21:32:47] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 1 ms to minimize.
[2024-05-31 21:32:47] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 0 ms to minimize.
[2024-05-31 21:32:47] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 0 ms to minimize.
[2024-05-31 21:32:47] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 1 ms to minimize.
[2024-05-31 21:32:47] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 1 ms to minimize.
[2024-05-31 21:32:47] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 0 ms to minimize.
[2024-05-31 21:32:47] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 1 ms to minimize.
[2024-05-31 21:32:48] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 0 ms to minimize.
[2024-05-31 21:32:48] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 1 ms to minimize.
[2024-05-31 21:32:48] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 0 ms to minimize.
[2024-05-31 21:32:48] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 0 ms to minimize.
[2024-05-31 21:32:48] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 0 ms to minimize.
[2024-05-31 21:32:48] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 0 ms to minimize.
[2024-05-31 21:32:49] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 1 ms to minimize.
[2024-05-31 21:32:49] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 1 ms to minimize.
[2024-05-31 21:32:49] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 1 ms to minimize.
[2024-05-31 21:32:49] [INFO ] Deduced a trap composed of 95 places in 175 ms of which 1 ms to minimize.
[2024-05-31 21:32:50] [INFO ] Deduced a trap composed of 86 places in 1152 ms of which 0 ms to minimize.
[2024-05-31 21:32:51] [INFO ] Deduced a trap composed of 98 places in 669 ms of which 1 ms to minimize.
[2024-05-31 21:32:51] [INFO ] Deduced a trap composed of 83 places in 168 ms of which 1 ms to minimize.
[2024-05-31 21:32:52] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 1 ms to minimize.
[2024-05-31 21:32:52] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 1 ms to minimize.
[2024-05-31 21:32:53] [INFO ] Deduced a trap composed of 89 places in 1031 ms of which 1 ms to minimize.
[2024-05-31 21:32:53] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 0 ms to minimize.
[2024-05-31 21:32:53] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 2 ms to minimize.
[2024-05-31 21:32:54] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 0 ms to minimize.
[2024-05-31 21:32:54] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 1 ms to minimize.
[2024-05-31 21:32:54] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 0 ms to minimize.
[2024-05-31 21:32:54] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 0 ms to minimize.
[2024-05-31 21:32:54] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 0 ms to minimize.
[2024-05-31 21:32:54] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 1 ms to minimize.
[2024-05-31 21:32:54] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 0 ms to minimize.
[2024-05-31 21:32:55] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 1 ms to minimize.
[2024-05-31 21:32:55] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 1 ms to minimize.
[2024-05-31 21:32:55] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 0 ms to minimize.
[2024-05-31 21:32:55] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 1 ms to minimize.
[2024-05-31 21:32:55] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 1 ms to minimize.
[2024-05-31 21:32:56] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 1 ms to minimize.
[2024-05-31 21:32:56] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 0 ms to minimize.
[2024-05-31 21:32:56] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 0 ms to minimize.
[2024-05-31 21:32:56] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 0 ms to minimize.
[2024-05-31 21:32:57] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 0 ms to minimize.
[2024-05-31 21:32:57] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 1 ms to minimize.
[2024-05-31 21:33:06] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 19584 ms
[2024-05-31 21:33:06] [INFO ] After 19797ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:33:06] [INFO ] After 19987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 510 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 814515 steps, run timeout after 3001 ms. (steps per millisecond=271 ) properties seen :{}
Probabilistic random walk after 814515 steps, saw 254282 distinct states, run finished after 3014 ms. (steps per millisecond=270 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:33:09] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:33:09] [INFO ] Invariant cache hit.
[2024-05-31 21:33:09] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-05-31 21:33:09] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 21:33:09] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:33:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned sat
[2024-05-31 21:33:09] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 21:33:10] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:33:10] [INFO ] After 85ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:10] [INFO ] Deduced a trap composed of 95 places in 219 ms of which 0 ms to minimize.
[2024-05-31 21:33:10] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 0 ms to minimize.
[2024-05-31 21:33:10] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 1 ms to minimize.
[2024-05-31 21:33:10] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 1 ms to minimize.
[2024-05-31 21:33:11] [INFO ] Deduced a trap composed of 80 places in 1127 ms of which 0 ms to minimize.
[2024-05-31 21:33:12] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 1 ms to minimize.
[2024-05-31 21:33:12] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 0 ms to minimize.
[2024-05-31 21:33:12] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 1 ms to minimize.
[2024-05-31 21:33:12] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 1 ms to minimize.
[2024-05-31 21:33:12] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 0 ms to minimize.
[2024-05-31 21:33:12] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 1 ms to minimize.
[2024-05-31 21:33:13] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 1 ms to minimize.
[2024-05-31 21:33:13] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 1 ms to minimize.
[2024-05-31 21:33:13] [INFO ] Deduced a trap composed of 86 places in 225 ms of which 1 ms to minimize.
[2024-05-31 21:33:13] [INFO ] Deduced a trap composed of 92 places in 214 ms of which 0 ms to minimize.
[2024-05-31 21:33:14] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 1 ms to minimize.
[2024-05-31 21:33:14] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 1 ms to minimize.
[2024-05-31 21:33:14] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 0 ms to minimize.
[2024-05-31 21:33:14] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 0 ms to minimize.
[2024-05-31 21:33:14] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 1 ms to minimize.
[2024-05-31 21:33:14] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 0 ms to minimize.
[2024-05-31 21:33:15] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 0 ms to minimize.
[2024-05-31 21:33:15] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 1 ms to minimize.
[2024-05-31 21:33:15] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 1 ms to minimize.
[2024-05-31 21:33:15] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 1 ms to minimize.
[2024-05-31 21:33:15] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 0 ms to minimize.
[2024-05-31 21:33:16] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 0 ms to minimize.
[2024-05-31 21:33:16] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 1 ms to minimize.
[2024-05-31 21:33:16] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 0 ms to minimize.
[2024-05-31 21:33:16] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 0 ms to minimize.
[2024-05-31 21:33:16] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 1 ms to minimize.
[2024-05-31 21:33:17] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 0 ms to minimize.
[2024-05-31 21:33:17] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 1 ms to minimize.
[2024-05-31 21:33:17] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 1 ms to minimize.
[2024-05-31 21:33:18] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 1 ms to minimize.
[2024-05-31 21:33:27] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 16954 ms
[2024-05-31 21:33:27] [INFO ] After 17062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:33:27] [INFO ] After 17311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 11 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-05-31 21:33:27] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:33:27] [INFO ] Invariant cache hit.
[2024-05-31 21:33:31] [INFO ] Dead Transitions using invariants and state equation in 3975 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3994 ms. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 10000 steps, including 521 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 799523 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :{}
Probabilistic random walk after 799523 steps, saw 249350 distinct states, run finished after 3002 ms. (steps per millisecond=266 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:33:34] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:33:34] [INFO ] Invariant cache hit.
[2024-05-31 21:33:34] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2024-05-31 21:33:34] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 11 ms returned sat
[2024-05-31 21:33:34] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:33:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-31 21:33:34] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 10 ms returned sat
[2024-05-31 21:33:34] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:33:34] [INFO ] After 84ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 1 ms to minimize.
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 1 ms to minimize.
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 0 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 0 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 1 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 0 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 0 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 0 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 1 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 0 ms to minimize.
[2024-05-31 21:33:36] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 0 ms to minimize.
[2024-05-31 21:33:36] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 1 ms to minimize.
[2024-05-31 21:33:36] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 1 ms to minimize.
[2024-05-31 21:33:36] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 1 ms to minimize.
[2024-05-31 21:33:36] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 0 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 1 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 3 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 1 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 0 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 1 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 0 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 0 ms to minimize.
[2024-05-31 21:33:38] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 1 ms to minimize.
[2024-05-31 21:33:38] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
[2024-05-31 21:33:38] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 1 ms to minimize.
[2024-05-31 21:33:38] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 2 ms to minimize.
[2024-05-31 21:33:38] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 0 ms to minimize.
[2024-05-31 21:33:39] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 0 ms to minimize.
[2024-05-31 21:33:39] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 0 ms to minimize.
[2024-05-31 21:33:39] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 0 ms to minimize.
[2024-05-31 21:33:39] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 1 ms to minimize.
[2024-05-31 21:33:39] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 1 ms to minimize.
[2024-05-31 21:33:40] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 0 ms to minimize.
[2024-05-31 21:33:40] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 1 ms to minimize.
[2024-05-31 21:33:41] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 2 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :764293 after 2.39088e+06
[2024-05-31 21:33:50] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 15520 ms
[2024-05-31 21:33:50] [INFO ] After 15634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:33:50] [INFO ] After 15842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 22 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 18 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2024-05-31 21:33:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:33:50] [INFO ] Invariant cache hit.
[2024-05-31 21:33:50] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-31 21:33:50] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:33:50] [INFO ] Invariant cache hit.
[2024-05-31 21:33:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:33:51] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2024-05-31 21:33:51] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 21:33:51] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
[2024-05-31 21:33:51] [INFO ] Invariant cache hit.
[2024-05-31 21:33:51] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1341 ms. Remains : 290/290 places, 406/406 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 66 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 395 rows 283 cols
[2024-05-31 21:33:51] [INFO ] Computed 57 invariants in 4 ms
[2024-05-31 21:33:51] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-31 21:33:51] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-31 21:33:51] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:33:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-31 21:33:51] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2024-05-31 21:33:51] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:51] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 1 ms to minimize.
[2024-05-31 21:33:52] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 1 ms to minimize.
[2024-05-31 21:33:52] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 0 ms to minimize.
[2024-05-31 21:33:52] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 0 ms to minimize.
[2024-05-31 21:33:52] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 1 ms to minimize.
[2024-05-31 21:33:52] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 1 ms to minimize.
[2024-05-31 21:33:52] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 1 ms to minimize.
[2024-05-31 21:33:52] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 1 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 0 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 0 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 0 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 0 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 1 ms to minimize.
[2024-05-31 21:33:54] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 0 ms to minimize.
[2024-05-31 21:33:54] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 1 ms to minimize.
[2024-05-31 21:33:54] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 0 ms to minimize.
[2024-05-31 21:33:54] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 1 ms to minimize.
[2024-05-31 21:33:54] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 1 ms to minimize.
[2024-05-31 21:33:54] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 0 ms to minimize.
[2024-05-31 21:33:55] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 0 ms to minimize.
[2024-05-31 21:33:55] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 0 ms to minimize.
[2024-05-31 21:33:55] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 0 ms to minimize.
[2024-05-31 21:33:55] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2024-05-31 21:33:55] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 0 ms to minimize.
[2024-05-31 21:33:55] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 0 ms to minimize.
[2024-05-31 21:33:55] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 0 ms to minimize.
[2024-05-31 21:33:56] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 1 ms to minimize.
[2024-05-31 21:33:56] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 1 ms to minimize.
[2024-05-31 21:33:56] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 1 ms to minimize.
[2024-05-31 21:33:56] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 1 ms to minimize.
[2024-05-31 21:33:56] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 0 ms to minimize.
[2024-05-31 21:33:57] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 0 ms to minimize.
[2024-05-31 21:33:57] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 1 ms to minimize.
[2024-05-31 21:33:57] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 1 ms to minimize.
[2024-05-31 21:33:57] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 0 ms to minimize.
[2024-05-31 21:33:57] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 0 ms to minimize.
[2024-05-31 21:33:57] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 0 ms to minimize.
[2024-05-31 21:33:58] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 1 ms to minimize.
[2024-05-31 21:33:58] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 0 ms to minimize.
[2024-05-31 21:33:58] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 1 ms to minimize.
[2024-05-31 21:33:58] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 0 ms to minimize.
[2024-05-31 21:33:59] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 1 ms to minimize.
[2024-05-31 21:33:59] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 1 ms to minimize.
[2024-05-31 21:33:59] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 1 ms to minimize.
[2024-05-31 21:33:59] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 0 ms to minimize.
[2024-05-31 21:34:00] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 0 ms to minimize.
[2024-05-31 21:34:02] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 0 ms to minimize.
[2024-05-31 21:34:02] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 1 ms to minimize.
[2024-05-31 21:34:03] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 1 ms to minimize.
[2024-05-31 21:34:03] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 0 ms to minimize.
[2024-05-31 21:34:04] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 0 ms to minimize.
[2024-05-31 21:34:04] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 1 ms to minimize.
[2024-05-31 21:34:04] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2024-05-31 21:34:05] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 1 ms to minimize.
[2024-05-31 21:34:05] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 0 ms to minimize.
[2024-05-31 21:34:14] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 22335 ms
[2024-05-31 21:34:14] [INFO ] After 22646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:34:14] [INFO ] After 22727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 290 transition count 402
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 290 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 64 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
Running SMT prover for 1 properties.
[2024-05-31 21:34:14] [INFO ] Invariant cache hit.
[2024-05-31 21:34:14] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-05-31 21:34:14] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-31 21:34:14] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:34:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-05-31 21:34:14] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-31 21:34:14] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:34:14] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 1 ms to minimize.
[2024-05-31 21:34:14] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 1 ms to minimize.
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 1 ms to minimize.
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 1 ms to minimize.
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 0 ms to minimize.
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 0 ms to minimize.
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 1 ms to minimize.
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 0 ms to minimize.
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 1 ms to minimize.
[2024-05-31 21:34:16] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 1 ms to minimize.
[2024-05-31 21:34:16] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 1 ms to minimize.
[2024-05-31 21:34:16] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 0 ms to minimize.
[2024-05-31 21:34:16] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 0 ms to minimize.
[2024-05-31 21:34:16] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 1 ms to minimize.
[2024-05-31 21:34:16] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 1 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 0 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 1 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 0 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 0 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 1 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 0 ms to minimize.
[2024-05-31 21:34:18] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 0 ms to minimize.
[2024-05-31 21:34:18] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 0 ms to minimize.
[2024-05-31 21:34:18] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 1 ms to minimize.
[2024-05-31 21:34:18] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 0 ms to minimize.
[2024-05-31 21:34:18] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 0 ms to minimize.
[2024-05-31 21:34:18] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 1 ms to minimize.
[2024-05-31 21:34:19] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 0 ms to minimize.
[2024-05-31 21:34:19] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 0 ms to minimize.
[2024-05-31 21:34:19] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 0 ms to minimize.
[2024-05-31 21:34:19] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 1 ms to minimize.
[2024-05-31 21:34:19] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 0 ms to minimize.
[2024-05-31 21:34:19] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 0 ms to minimize.
[2024-05-31 21:34:19] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 0 ms to minimize.
[2024-05-31 21:34:20] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 0 ms to minimize.
[2024-05-31 21:34:20] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 0 ms to minimize.
[2024-05-31 21:34:20] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 0 ms to minimize.
[2024-05-31 21:34:20] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 1 ms to minimize.
[2024-05-31 21:34:20] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 0 ms to minimize.
[2024-05-31 21:34:20] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 0 ms to minimize.
[2024-05-31 21:34:21] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 1 ms to minimize.
[2024-05-31 21:34:21] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 0 ms to minimize.
[2024-05-31 21:34:21] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 1 ms to minimize.
[2024-05-31 21:34:22] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 1 ms to minimize.
[2024-05-31 21:34:23] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 0 ms to minimize.
[2024-05-31 21:34:23] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 0 ms to minimize.
[2024-05-31 21:34:23] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 0 ms to minimize.
[2024-05-31 21:34:25] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 0 ms to minimize.
[2024-05-31 21:34:25] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 0 ms to minimize.
[2024-05-31 21:34:26] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 1 ms to minimize.
[2024-05-31 21:34:27] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 1 ms to minimize.
[2024-05-31 21:34:29] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 0 ms to minimize.
[2024-05-31 21:34:34] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 0 ms to minimize.
[2024-05-31 21:34:35] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 1 ms to minimize.
[2024-05-31 21:34:35] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 0 ms to minimize.
[2024-05-31 21:34:37] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 0 ms to minimize.
[2024-05-31 21:34:41] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 1 ms to minimize.
[2024-05-31 21:34:42] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 0 ms to minimize.
[2024-05-31 21:34:51] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 36792 ms
[2024-05-31 21:34:51] [INFO ] After 36920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:34:51] [INFO ] After 36990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:34:51] [INFO ] Flatten gal took : 75 ms
[2024-05-31 21:34:51] [INFO ] Flatten gal took : 49 ms
[2024-05-31 21:34:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1544353308802524879.gal : 7 ms
[2024-05-31 21:34:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7045477960538436733.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1544353308802524879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7045477960538436733.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7045477960538436733.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 29
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :29 after 35
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :35 after 62
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :62 after 635
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :635 after 794
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :794 after 1110
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1110 after 1721
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1721 after 28545
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :28545 after 46567
Detected timeout of ITS tools.
[2024-05-31 21:35:06] [INFO ] Flatten gal took : 58 ms
[2024-05-31 21:35:06] [INFO ] Applying decomposition
[2024-05-31 21:35:06] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5040623190561955973.txt' '-o' '/tmp/graph5040623190561955973.bin' '-w' '/tmp/graph5040623190561955973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5040623190561955973.bin' '-l' '-1' '-v' '-w' '/tmp/graph5040623190561955973.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:35:07] [INFO ] Decomposing Gal with order
[2024-05-31 21:35:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:35:07] [INFO ] Removed a total of 434 redundant transitions.
[2024-05-31 21:35:07] [INFO ] Flatten gal took : 127 ms
[2024-05-31 21:35:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 197 labels/synchronizations in 24 ms.
[2024-05-31 21:35:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15976240560680646008.gal : 13 ms
[2024-05-31 21:35:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12417773907988905269.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15976240560680646008.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12417773907988905269.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12417773907988905269.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13996827823452849944
[2024-05-31 21:35:22] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13996827823452849944
Running compilation step : cd /tmp/ltsmin13996827823452849944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 997 ms.
Running link step : cd /tmp/ltsmin13996827823452849944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin13996827823452849944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 21:35:37] [INFO ] Flatten gal took : 63 ms
[2024-05-31 21:35:37] [INFO ] Applying decomposition
[2024-05-31 21:35:37] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3502653623725598300.txt' '-o' '/tmp/graph3502653623725598300.bin' '-w' '/tmp/graph3502653623725598300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3502653623725598300.bin' '-l' '-1' '-v' '-w' '/tmp/graph3502653623725598300.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:35:37] [INFO ] Decomposing Gal with order
[2024-05-31 21:35:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:35:37] [INFO ] Removed a total of 599 redundant transitions.
[2024-05-31 21:35:37] [INFO ] Flatten gal took : 62 ms
[2024-05-31 21:35:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2024-05-31 21:35:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14428912425799494044.gal : 8 ms
[2024-05-31 21:35:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality865335116436077040.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14428912425799494044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality865335116436077040.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality865335116436077040.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 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :36 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :106 after 110
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :110 after 216
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :216 after 224
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :224 after 243
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :243 after 365
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1346 after 19465
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :19465 after 20185
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :20185 after 31920
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :173088 after 1.35786e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.35786e+06 after 1.39656e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.39656e+06 after 1.97181e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.69967e+07 after 6.32047e+07
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :6.32047e+07 after 6.90672e+07
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.39088e+06 after 4.21366e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :6.90672e+07 after 1.37651e+08
Detected timeout of ITS tools.
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,6.93821e+08,577.801,6203680,829478,1.46688e+06,1.15053e+07,9.49818e+06,1256,6.56346e+06,755,1.47615e+07,0
Total reachable state count : 693820562

Verifying 1 reachability properties.
Reachability property qltransition_11 does not hold.
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 927753 ms.

BK_STOP 1717191916014

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="PolyORBNT-COL-S05J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2023"
echo " Input is PolyORBNT-COL-S05J20, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r308-tajo-171654461400227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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